2,006 research outputs found
Regular Intersecting Families
We call a family of sets intersecting, if any two sets in the family
intersect. In this paper we investigate intersecting families of
-element subsets of such that every element of
lies in the same (or approximately the same) number of members of
. In particular, we show that we can guarantee if and only if .Comment: 15 pages, accepted versio
On symmetric intersecting families
We make some progress on a question of Babai from the 1970s, namely: for with , what is the largest possible cardinality
of an intersecting family of -element subsets of
admitting a transitive group of automorphisms? We give upper and lower bounds
for , and show in particular that as if and only if for some function
that increases without bound, thereby determining the threshold
at which `symmetric' intersecting families are negligibly small compared to the
maximum-sized intersecting families. We also exhibit connections to some basic
questions in group theory and additive number theory, and pose a number of
problems.Comment: Minor change to the statement (and proof) of Theorem 1.4; the authors
thank Nathan Keller and Omri Marcus for pointing out a mistake in the
previous versio
Invariance principle on the slice
We prove an invariance principle for functions on a slice of the Boolean
cube, which is the set of all vectors {0,1}^n with Hamming weight k. Our
invariance principle shows that a low-degree, low-influence function has
similar distributions on the slice, on the entire Boolean cube, and on Gaussian
space.
Our proof relies on a combination of ideas from analysis and probability,
algebra and combinatorics.
Our result imply a version of majority is stablest for functions on the
slice, a version of Bourgain's tail bound, and a version of the Kindler-Safra
theorem. As a corollary of the Kindler-Safra theorem, we prove a stability
result of Wilson's theorem for t-intersecting families of sets, improving on a
result of Friedgut.Comment: 36 page
- β¦