6,227 research outputs found
Ramsey numbers of cubes versus cliques
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an
n-regular graph on 2^n vertices. The Ramsey number r(Q_n, K_s) is the minimum N
such that every graph of order N contains the cube graph Q_n or an independent
set of order s. Burr and Erdos in 1983 asked whether the simple lower bound
r(Q_n, K_s) >= (s-1)(2^n - 1)+1 is tight for s fixed and n sufficiently large.
We make progress on this problem, obtaining the first upper bound which is
within a constant factor of the lower bound.Comment: 26 page
Short proofs of some extremal results
We prove several results from different areas of extremal combinatorics,
giving complete or partial solutions to a number of open problems. These
results, coming from areas such as extremal graph theory, Ramsey theory and
additive combinatorics, have been collected together because in each case the
relevant proofs are quite short.Comment: 19 page
Tur\'an and Ramsey Properties of Subcube Intersection Graphs
The discrete cube is a fundamental combinatorial structure. A
subcube of is a subset of of its points formed by fixing
coordinates and allowing the remaining to vary freely. The subcube
structure of the discrete cube is surprisingly complicated and there are many
open questions relating to it.
This paper is concerned with patterns of intersections among subcubes of the
discrete cube. Two sample questions along these lines are as follows: given a
family of subcubes in which no of them have non-empty intersection, how
many pairwise intersections can we have? How many subcubes can we have if among
them there are no which have non-empty intersection and no which are
pairwise disjoint? These questions are naturally expressed as Tur\'an and
Ramsey type questions in intersection graphs of subcubes where the intersection
graph of a family of sets has one vertex for each set in the family with two
vertices being adjacent if the corresponding subsets intersect.
Tur\'an and Ramsey type problems are at the heart of extremal combinatorics
and so these problems are mathematically natural. However, a second motivation
is a connection with some questions in social choice theory arising from a
simple model of agreement in a society. Specifically, if we have to make a
binary choice on each of separate issues then it is reasonable to assume
that the set of choices which are acceptable to an individual will be
represented by a subcube. Consequently, the pattern of intersections within a
family of subcubes will have implications for the level of agreement within a
society.
We pose a number of questions and conjectures relating directly to the
Tur\'an and Ramsey problems as well as raising some further directions for
study of subcube intersection graphs.Comment: 18 page
Banach spaces and Ramsey Theory: some open problems
We discuss some open problems in the Geometry of Banach spaces having
Ramsey-theoretic flavor. The problems are exposed together with well known
results related to them.Comment: 17 pages, no figures; RACSAM, to appea
On metric Ramsey-type phenomena
The main question studied in this article may be viewed as a nonlinear
analogue of Dvoretzky's theorem in Banach space theory or as part of Ramsey
theory in combinatorics. Given a finite metric space on n points, we seek its
subspace of largest cardinality which can be embedded with a given distortion
in Hilbert space. We provide nearly tight upper and lower bounds on the
cardinality of this subspace in terms of n and the desired distortion. Our main
theorem states that for any epsilon>0, every n point metric space contains a
subset of size at least n^{1-\epsilon} which is embeddable in Hilbert space
with O(\frac{\log(1/\epsilon)}{\epsilon}) distortion. The bound on the
distortion is tight up to the log(1/\epsilon) factor. We further include a
comprehensive study of various other aspects of this problem.Comment: 67 pages, published versio
Protected subspace Ramsey spectroscopy
We study a modified Ramsey spectroscopy technique employing slowly decaying
states for quantum metrology applications using dense ensembles. While closely
positioned atoms exhibit superradiant collective decay and dipole-dipole
induced frequency shifts, recent results [Ostermann, Ritsch and Genes, Phys.
Rev. Lett. \textbf{111}, 123601 (2013)] suggest the possibility to suppress
such detrimental effects and achieve an even better scaling of the frequency
sensitivity with interrogation time than for noninteracting particles. Here we
present an in-depth analysis of this 'protected subspace Ramsey technique'
using improved analytical modeling and numerical simulations including larger
3D samples. Surprisingly we find that using sub-radiant states of particles
to encode the atomic coherence yields a scaling of the optimal sensitivity
better than . Applied to ultracold atoms in 3D optical lattices we
predict a precision beyond the single atom linewidth.Comment: 9 pages, 7 figure
Boolean algebras and Lubell functions
Let denote the power set of . A collection
\B\subset 2^{[n]} forms a -dimensional {\em Boolean algebra} if there
exist pairwise disjoint sets , all non-empty
with perhaps the exception of , so that \B={X_0\cup \bigcup_{i\in I}
X_i\colon I\subseteq [d]}. Let be the maximum cardinality of a family
\F\subset 2^X that does not contain a -dimensional Boolean algebra.
Gunderson, R\"odl, and Sidorenko proved that where .
In this paper, we use the Lubell function as a new measurement for large
families instead of cardinality. The Lubell value of a family of sets \F with
\F\subseteq \tsupn is defined by h_n(\F):=\sum_{F\in \F}1/{{n\choose |F|}}.
We prove the following Tur\'an type theorem. If \F\subseteq 2^{[n]} contains
no -dimensional Boolean algebra, then h_n(\F)\leq 2(n+1)^{1-2^{1-d}} for
sufficiently large . This results implies , where is an absolute constant independent of and . As a
consequence, we improve several Ramsey-type bounds on Boolean algebras. We also
prove a canonical Ramsey theorem for Boolean algebras.Comment: 10 page
Approximate Euclidean Ramsey theorems
According to a classical result of Szemer\'{e}di, every dense subset of
contains an arbitrary long arithmetic progression, if is large
enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson
says that every dense subset of contains an arbitrary large
grid, if is large enough. Here we generalize these results for separated
point sets on the line and respectively in the Euclidean space: (i) every dense
separated set of points in some interval on the line contains an
arbitrary long approximate arithmetic progression, if is large enough. (ii)
every dense separated set of points in the -dimensional cube in
\RR^d contains an arbitrary large approximate grid, if is large enough. A
further generalization for any finite pattern in \RR^d is also established.
The separation condition is shown to be necessary for such results to hold. In
the end we show that every sufficiently large point set in \RR^d contains an
arbitrarily large subset of almost collinear points. No separation condition is
needed in this case.Comment: 11 pages, 1 figure
- …