2-intersecting permutations
Karen Meagher, A.S. Razafimahatratra

TL;DR
This paper proves conjectures regarding the Erdős-Ko-Rado property for 2-pointwise and 2-setwise intersecting permutations in symmetric groups, confirming these properties for all sufficiently large n when t=2.
Contribution
The paper establishes the Erdős-Ko-Rado property for 2-pointwise and 2-setwise intersecting permutations in symmetric groups specifically for t=2, confirming conjectures for all n ≥ 2t+1.
Findings
Proved the 2-pointwise intersecting property for all n ≥ 5.
Confirmed the 2-setwise intersecting property for all n ≥ 4.
Validated conjectures for the case t=2 in symmetric groups.
Abstract
In this paper we consider the Erd\H{o}s-Ko-Rado property for both -pointwise and -setwise intersecting permutations. Two permutations are -setwise intersecting if there exists a -subset of such that . If for each , , then we say and are -pointwise intersecting. We say that has the -setwise (resp. -pointwise) intersecting property if for any family of -setwise (resp. -pointwise) intersecting permutations, (resp. ). Ellis (["Setwise intersecting families of permutation". { Journal of Combinatorial Theory, Series A}, 119(4):825-849, 2012.]), proved that for sufficiently large relative to , has the -setwise intersecting property. Ellis also conjuctured that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Combinatorial Mathematics · Advanced Mathematical Identities
