Approximation by juntas in the symmetric group, and forbidden intersection problems

DOI10.1215/00127094-2021-0050zbMath1490.05262arXiv1912.09228OpenAlexW2995687742MaRDI QIDQ2671454

David Ellis, Noam Lifshitz

Publication date: 3 June 2022

Published in: Duke Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

symmetric grouppseudorandomnessjuntasErdős-Ko-Rado problemsforbidden intersections

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal set theory (05D05)

Cites Work

• Unnamed Item
• Stability for \(t\)-intersecting families of permutations
• The complete intersection theorem for systems of finite sets
• Setwise intersecting families of permutations
• Forbidding just one intersection
• Some intersection theorems for ordered sets and graphs
• On the maximum number of permutations with given maximal or minimal distance
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
• Triangle-intersecting families of graphs
• Forbidding just one intersection, for permutations
• Erdős-Ko-Rado theorems for uniform set-partition systems
• Frankl-Rödl-type theorems for codes and permutations
• A survey of Turán problems for expansions
• Erdös–Ko–Rado Theorem—22 Years Later
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersecting Families are Essentially Contained in Juntas
• Generating a random permutation with random transpositions
• Set Systems with No Singleton Intersection
• Intersecting families of permutations
• Intersecting families of permutations

This page was built for publication: Approximation by juntas in the symmetric group, and forbidden intersection problems