An eventown result for permutations
Proceedings of the American Mathematical Society · 06.11.2026
DOI: 10.1090/proc/17883 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the American Mathematical Society, online erschienen am 06.11.2026. Verfasst von Nathan Lindzey. Die Arbeit nennt 44 Literaturangaben.
Abstract (Originalsprache)
A family of permutations F ⊆ S n \mathcal {F} \subseteq S_n is even-cycle-intersecting if σ π − 1 \sigma \pi ^{-1} has an even cycle for all σ , π ∈ F \sigma ,\pi \in \mathcal {F} . We show that if F ⊆ S n \mathcal {F} \subseteq S_n is an even-cycle-intersecting family of permutations, then | F | ≤ 2 n − 1 |\mathcal {F}| \leq 2^{n-1} , and that equality holds when n n is a power of 2 and F \mathcal {F} is a double-translate of a Sylow 2 2 -subgroup of S n S_n . This result can be seen as an analogue of the classical eventown problem for subsets and it confirms a conjecture of János Körner on maximum reversing families of the symmetric group. Along the way, we show that the canonically intersecting families of S n S_n are also the extremal odd-cycle-intersecting families of S n S_n for all even n n . While the latter result has less combinatorial significance, its proof uses an interesting new character-theoretic identity that might be of independent interest in algebraic combinatorics.
Zitieren
APA
Lindzey, N. (2026). An eventown result for permutations. Proceedings of the American Mathematical Society. https://doi.org/10.1090/proc/17883
Vancouver
Lindzey N. An eventown result for permutations. Proceedings of the American Mathematical Society. 2026. doi:10.1090/proc/17883
BibTeX
@article{Lindzey2026,
author = {Lindzey, Nathan},
title = {An eventown result for permutations},
journal = {Proceedings of the American Mathematical Society},
year = {2026},
doi = {10.1090/proc/17883}
}
EUVIMED