Fetching the paper…
Reading the bibliography…
We prove that Boolean functions on $S_n$, whose Fourier transform is highly concentrated on irreducible representations indexed by partitions of $n$ whose largest part has size at least $n-t$, are close to being unions of cosets of stabilizers of $t$-tuples.
P. Erdős, C. Ko and R. Rado, An Intersection Theorem for Systems of Finite Sets, Quart. J. Math. Oxford, Ser. 2
1961
Earlier work this paper cites.
L. H. Harper, Optimal assignments of numbers to vertices, SIAM Journal on Applied Mathematics
1964
Earlier work this paper cites.
J. H. Lindsey, II, Assignment of numbers to vertices, American Mathematical Monthly
1964
Earlier work this paper cites.
A. J. Bernstein, Maximally connected arrays on the n
1967
Earlier work this paper cites.
A.J.W. Hilton and E.C. Milner, Some intersection theorems for systems of finite sets, Quart. J. Math. Oxford Series 2
1967
Earlier work this paper cites.
A. J. Hoffman, On eigenvalues and colourings of graphs, Graph Theory and its Applications , Academic Press, New York (1970), 79–91
1970
Earlier work this paper cites.
S. Hart, A note on the edges of the n n -cube, Discrete Mathematics 14 (1976), 157–163
1976
Earlier work this paper cites.
M. Deza and P. Frankl, On the maximum number of permutations with given maximal or minimal distance, Journal of Combinatorial Theory, Series A 22 (1977), 352–360
1977
Earlier work this paper cites.
J.-P. Serre, Linear Representations of Finite Groups
1977
Earlier work this paper cites.
P. Diaconis and M. Shahshahani, Generating a random permutation with random transpositions, Z. Wahrsch. Verw. Gebeite 57 (1981), 159–179
1981
Cited alongside, same era.
J. Dodziuk, Difference equations, isoperimetric inequality and transience of certain random walks, Transactions of the American Mathematical Society
1984
Cited alongside, same era.
N. Alon and V. D. Milman, λ 1 \lambda_{1} , isoperimetric inequalities for graphs, and superconcentrators, Journal of Combinatorial Theory, Series B
1985
Cited alongside, same era.
G. James and A. Kerber, The Representation Theory of the Symmetric Group
1985
Cited alongside, same era.
B. E. Sagan, The Symmetric Group: Representations, Combinatorial Algorithms and Symmetric Functions , Springer-Verlag, New York, 1991. [2nd revised printing, 2001.]
2001
Cited alongside, same era.
E. Friedgut, Hypergraphs, Entropy and Inequalities, American Mathematical Monthly
2004
Later among the works it cites.
B. Larose and C. Malvenuto, Stable sets of maximal size in Kneser-type graphs, European Journal of Combinatorics
2004
Later among the works it cites.
H. Hatami and M. Ghandehari, Fourier analysis and large independent sets in powers of complete graphs, Journal of Combinatorial Theory, Series B
2008
Later among the works it cites.
D. Ellis, Stability for t t -intersecting families of permutations, Journal of Combinatorial Theory, Series A
2011
Later among the works it cites.
D. Ellis, E. Friedgut and H. Pilpel, Intersecting Families of Permutations, Journal of the American Mathematical Society
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Bourgain, On the distribution of the Fourier spectrum of Boolean functions, Israel Journal of Mathematics 131 (2002), 269–276
2002
Cited alongside, same era.
E. Friedgut, G. Kalai and A. Naor, Boolean functions whose Fourier transform is concentrated on the first two levels, Advances in Applied Mathematics
2002
Cited alongside, same era.
P.J. Cameron and C.Y. Ku, Intersecting Families of Permutations, European Journal of Combinatorics
2003
Cited alongside, same era.
N. Alon, I. Dinur, E. Friedgut and B. Sudakov, Graph products, Fourier analysis and spectral techniques, Geometric and Functional Analysis
2004
Cited alongside, same era.
L. Ben Efraim, personal communication
Cited in the paper.
Cited in the paper.
Y. Filmus, A comment on ‘Intersecting Families of Permutations’, manuscript, available at http://www.cs.toronto.edu/~yuvalf/EFP-comment.pdf
Cited in the paper.
D. Ellis, A Proof of the Cameron–Ku Conjecture, Journal of the London Mathematical Society
2012
Later among the works it cites.
A. Tal, Properties and applications of Boolean function composition. In Proceedings of the 4th Conference on Innovations in Theoretical Computer Science
2013
Later among the works it cites.
D. Ellis, E. Friedgut and Y. Filmus, A stability result for balanced dictatorships in S n S_{n} , Random Structures and Algorithms
2015
Closest in time.
I. Dinur, S. Knot, G. Kindler, D. Minzer and M. Safra, On non-optimally expanding sets in Grassmann graphs, Electronic Colloquium on Computational Complexity
2017
Closest in time.