Approximation by juntas in the symmetric group, and forbidden intersection problems
Authors:
- 15 May 2022
- journal article
- research article
- Published by Duke University Press in Duke Mathematical Journal
- Vol. 171 (7) , 1-51
Abstract
A family of permutations is said to be t-intersecting if any two permutations in agree on at least t points. It is said to be -intersection-free if no two permutations in agree on exactly points. If with , and is a bijection, then the π-star in is the family of all permutations that agree with π on S. An s-star is a π-star such that π is a bijection between sets of size s.
Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Setwise intersecting families of permutationsJournal of Combinatorial Theory, Series A, 2012
- Triangle-intersecting families of graphsJournal of the European Mathematical Society, 2012
- Intersecting families of permutationsJournal of the American Mathematical Society, 2011
- Stability for t-intersecting families of permutationsJournal of Combinatorial Theory, Series A, 2011
- Intersecting families of permutationsEuropean Journal of Combinatorics, 2003
- The Complete Intersection Theorem for Systems of Finite SetsEuropean Journal of Combinatorics, 1997
- Some intersection theorems for ordered sets and graphsJournal of Combinatorial Theory, Series A, 1986
- Forbidding just one intersectionJournal of Combinatorial Theory, Series A, 1985
- On the maximum number of permutations with given maximal or minimal distanceJournal of Combinatorial Theory, Series A, 1977
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1961