5,663 research outputs found
Lower bounds on geometric Ramsey functions
We continue a sequence of recent works studying Ramsey functions for
semialgebraic predicates in . A -ary semialgebraic predicate
on is a Boolean combination of polynomial
equations and inequalities in the coordinates of points
. A sequence of points in
is called -homogeneous if either holds for all choices , or it
holds for no such choice. The Ramsey function is the smallest
such that every point sequence of length contains a -homogeneous
subsequence of length .
Conlon, Fox, Pach, Sudakov, and Suk constructed the first examples of
semialgebraic predicates with the Ramsey function bounded from below by a tower
function of arbitrary height: for every , they exhibit a -ary
in dimension with bounded below by a tower of height .
We reduce the dimension in their construction, obtaining a -ary
semialgebraic predicate on with bounded
below by a tower of height .
We also provide a natural geometric Ramsey-type theorem with a large Ramsey
function. We call a point sequence in order-type homogeneous
if all -tuples in have the same orientation. Every sufficiently long
point sequence in general position in contains an order-type
homogeneous subsequence of length , and the corresponding Ramsey function
has recently been studied in several papers. Together with a recent work of
B\'ar\'any, Matou\v{s}ek, and P\'or, our results imply a tower function of
of height as a lower bound, matching an upper bound by Suk up
to the constant in front of .Comment: 12 page
High order recombination and an application to cubature on Wiener space
Particle methods are widely used because they can provide accurate
descriptions of evolving measures. Recently it has become clear that by
stepping outside the Monte Carlo paradigm these methods can be of higher order
with effective and transparent error bounds. A weakness of particle methods
(particularly in the higher order case) is the tendency for the number of
particles to explode if the process is iterated and accuracy preserved. In this
paper we identify a new approach that allows dynamic recombination in such
methods and retains the high order accuracy by simplifying the support of the
intermediate measures used in the iteration. We describe an algorithm that can
be used to simplify the support of a discrete measure and give an application
to the cubature on Wiener space method developed by Lyons and Victoir [Proc. R.
Soc. Lond. Ser. A Math. Phys. Eng. Sci. 460 (2004) 169-198].Comment: Published in at http://dx.doi.org/10.1214/11-AAP786 the Annals of
Applied Probability (http://www.imstat.org/aap/) by the Institute of
Mathematical Statistics (http://www.imstat.org
Hypergraph Ramsey numbers
The Ramsey number r_k(s,n) is the minimum N such that every red-blue coloring
of the k-tuples of an N-element set contains either a red set of size s or a
blue set of size n, where a set is called red (blue) if all k-tuples from this
set are red (blue). In this paper we obtain new estimates for several basic
hypergraph Ramsey problems. We give a new upper bound for r_k(s,n) for k \geq 3
and s fixed. In particular, we show that r_3(s,n) \leq 2^{n^{s-2}\log n}, which
improves by a factor of n^{s-2}/ polylog n the exponent of the previous upper
bound of Erdos and Rado from 1952. We also obtain a new lower bound for these
numbers, showing that there are constants c_1,c_2>0 such that r_3(s,n) \geq
2^{c_1 sn \log (n/s)} for all 4 \leq s \leq c_2n. When s is a constant, it
gives the first superexponential lower bound for r_3(s,n), answering an open
question posed by Erdos and Hajnal in 1972. Next, we consider the 3-color
Ramsey number r_3(n,n,n), which is the minimum N such that every 3-coloring of
the triples of an N-element set contains a monochromatic set of size n.
Improving another old result of Erdos and Hajnal, we show that r_3(n,n,n) \geq
2^{n^{c \log n}}. Finally, we make some progress on related hypergraph
Ramsey-type problems
The Relativized Second Eigenvalue Conjecture of Alon
We prove a relativization of the Alon Second Eigenvalue Conjecture for all
-regular base graphs, , with : for any , we show that
a random covering map of degree to has a new eigenvalue greater than
in absolute value with probability .
Furthermore, if is a Ramanujan graph, we show that this probability is
proportional to , where
is an integer depending on , which can be computed by a finite algorithm for
any fixed . For any -regular graph, , is
greater than .
Our proof introduces a number of ideas that simplify and strengthen the
methods of Friedman's proof of the original conjecture of Alon. The most
significant new idea is that of a ``certified trace,'' which is not only
greatly simplifies our trace methods, but is the reason we can obtain the
estimate above. This estimate represents an
improvement over Friedman's results of the original Alon conjecture for random
-regular graphs, for certain values of
- …