pith. sign in

arxiv: 1706.10146 · v1 · pith:JQVTIFZMnew · submitted 2017-06-30 · 🧮 math.CO

A comment on Intersecting Families of Permutations

classification 🧮 math.CO
keywords ellispermutationscharacterizationfamiliesfriedgutintersectingpilpelalready
0
0 comments X
read the original abstract

Ellis, Friedgut and Pilpel proved that for large enough $n$, a $t$-intersecting family of permutations contains at most $(n-t)!$ permutations. Their main theorem also states that equality holds only for $t$-cosets. We show that their proof of the characterization of extremal families is wrong. However, the characterization follows from a paper of Ellis, as mentioned already by Ellis, Friedgut and Pilpel.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Tiling the symmetric group by transpositions

    math.CO 2025-05 conditional novelty 6.0

    A new necessary condition is established that Y must be partition-transitive w.r.t. certain partitions of n for (T_n, Y) to tile S_n, generalizing Rothaus-Thompson and Nomura, with a conjecture that neither T_n nor T_...