Intersecting families of permutations

DOI10.1090/S0894-0347-2011-00690-5zbMath1285.05171arXiv1011.3342OpenAlexW2963536098MaRDI QIDQ5892593

Haran Pilpel, David Ellis, Ehud Friedgut

Publication date: 27 June 2011

Published in: Journal of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.3342

zbMATH Keywords

representation theoryErdős-Ko-Radointersecting families of permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10) Representations of finite symmetric groups (20C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Ramsey theory (05D10)

Related Items (87)

Log-Sobolev inequality for the multislice, with applications ⋮ The maximum product of sizes of cross-intersecting families ⋮ On Disjoint Cross Intersecting Families of Permutations ⋮ Boolean functions: influence, threshold and noise ⋮ Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations ⋮ Boolean degree 1 functions on some classical association schemes ⋮ Eigenvalues of Cayley graphs ⋮ Some Erdös-Ko-Rado results for linear and affine groups of degree two ⋮ Extremal \(t\)-intersecting families for direct products ⋮ Erdős-Ko-Rado for perfect matchings ⋮ An EKR-theorem for finite buildings of type \(D_{\ell }\) ⋮ The eigenvalue method for cross \(t\)-intersecting families ⋮ Remark on one problem in extremal combinatorics ⋮ An analogue of the Erdős-Ko-Rado theorem for weak compositions ⋮ Approximation by juntas in the symmetric group, and forbidden intersection problems ⋮ Independence ratio and random eigenvectors in transitive graphs ⋮ Stability for \(t\)-intersecting families of permutations ⋮ The Erdős-Ko-Rado property for some 2-transitive groups ⋮ Structure and supersaturation for intersecting families ⋮ An Erdős-Ko-Rado theorem for permutations with fixed number of cycles ⋮ On the Erdős-Ko-Rado property for finite groups ⋮ A non-trivial intersection theorem for permutations with fixed number of cycles ⋮ A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices ⋮ Intersection theorems for finite general linear groups ⋮ An extension of the Erdős-Ko-Rado theorem to uniform set partitions ⋮ Graphical designs and extremal combinatorics ⋮ Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 ⋮ Triangle-intersecting families of graphs ⋮ Boolean functions on $S_n$ which are nearly linear ⋮ Hypercontractivity on the symmetric group ⋮ The spectrum of eigenvalues for certain subgraphs of the \(k\)-point fixing graph ⋮ On the intersection density of the symmetric group acting on uniform subsets of small size ⋮ Large families of permutations of Zn whose pairwise sums are permutations ⋮ KKL's influence on me ⋮ On the intersection density of the Kneser graph \(K(n, 3)\) ⋮ The smallest eigenvalues of the 1-point fixing graph ⋮ Theorems of Erdős-Ko-Rado type in geometrical settings ⋮ High dimensional Hoffman bound and applications in extremal combinatorics ⋮ Erdős-Ko-Rado theorems in certain semilattices ⋮ Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph ⋮ A structure theorem for almost low-degree functions on the slice ⋮ Spectral bounds for the independence ratio and the chromatic number of an operator ⋮ New bounds on even cycle creating Hamiltonian paths using expander graphs ⋮ Forbidding just one intersection, for permutations ⋮ Setwise intersecting families in classical Coxeter groups ⋮ Forbiddance and capacity ⋮ On cross Parsons numbers ⋮ LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY ⋮ The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings ⋮ Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces ⋮ Intersecting families in classical Coxeter groups ⋮ The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Stability for 1-intersecting families of perfect matchings ⋮ Colourings without monochromatic disjoint pairs ⋮ Triangle-different Hamiltonian paths ⋮ A quasi-stability result for dictatorships in \(S_n\) ⋮ Representation theory in complex rank. I. ⋮ Intersecting families of permutations ⋮ Erdős-Ko-Rado theorem for irreducible imprimitive reflection groups ⋮ Intersecting families of discrete structures are typically trivial ⋮ Anzahl theorems in geometry oft-singular classical groups and their applications ⋮ Bounds on permutation codes of distance four ⋮ A note on “Largest independent sets of certain regular subgraphs of the derangement graph” ⋮ Spread approximations for forbidden intersections problems ⋮ An exact result for \((0, \pm 1)\)-vectors ⋮ 3-setwise intersecting families of the symmetric group ⋮ The maximum sum and the maximum product of sizes of cross-intersecting families ⋮ Largest independent sets of certain regular subgraphs of the derangement graph ⋮ Invitation to intersection problems for finite sets ⋮ Strongly intersecting integer partitions ⋮ Erdős-Ko-Rado theorems for set partitions with certain block size ⋮ Setwise intersecting families of permutations ⋮ The theta number of simplicial complexes ⋮ On $k$-Neighbor Separated Permutations ⋮ FKN theorem for the multislice, with applications ⋮ Cross t-Intersecting Integer Sequences from Weighted Erdős–Ko–Rado ⋮ Unnamed Item ⋮ Boolean constant degree functions on the slice are juntas ⋮ A stability result for balanced dictatorships in S_n ⋮ On \(r\)-cross \(t\)-intersecting families for weak compositions ⋮ A Deza-Frankl type theorem for set partitions ⋮ On complete multipartite derangement graphs ⋮ On the intersection density of primitive groups of degree a product of two odd primes ⋮ On the chromatic number of regular graphs of matrix algebras ⋮ Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs ⋮ On the partition associated to the smallest eigenvalues of the \(k\)-point fixing graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability for \(t\)-intersecting families of permutations
• The complete intersection theorem for systems of finite sets
• Understanding and using linear programming
• A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
• On the spectrum of the derangement graph
• Spectra of Cayley graphs
• On the maximum number of permutations with given maximal or minimal distance
• Boolean functions with low average sensitivity depend on few coordinates
• Stable sets of maximal size in Kneser-type graphs
• On the distribution of the Fourier spectrum of Boolean functions
• Boolean functions whose Fourier transform is concentrated on the first two levels.
• Upper bound on the characters of the symmetric groups
• Lower bound on the dimensions or irreducible representations of symmetric groups and on the exponents of varieties of Lie algebras
• Generating a random permutation with random transpositions
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The Hook Graphs of the Symmetric Group
• Intersecting families of permutations
• Intersecting families of permutations

This page was built for publication: Intersecting families of permutations