Stability for \(t\)-intersecting families of permutations (Q616451)

Let \(S_n\) be the set of all permutations of size \(n\). A family of permutations \(A\subseteq S_n\) is said to be \(t\)-intersecting if \(|\{i\mid 1\leq i\leq n, \pi(i)=\sigma(i)\}|>t\), for all \(\pi,\sigma\in A\). \textit{M. Deza} and \textit{P. Frankl} [``On the maximum number of permutations with given maximal or minimal distance'', J. Comb. Theory, Ser. A 22, 352--360 (1977; Zbl 0352.05003)] conjectured that for \(n\) sufficiently large depending on \(t\), a \(t\)-intersecting family \(A\subseteq S_n\) has size at most \((n-t)!\). This conjecture has been proved by the author, \textit{E. Friedgut}, and \textit{H. Pilpel} [``Intersecting families of permutations,'' J. Am. Math. Soc. 24, No.\, 3, 649--682 (2011; Zbl 1285.05171)]. In this paper, the author shows that for any positive integer \(t\) and any positive constant \(c\), if \(A\subseteq S_n\) is a \(t\)-intersecting family of size at least \(c(n-t)!\), then there exists a \(t\)-coset \(C\) such that \(|A \backslash C| \leq \Theta((n-1-t)!)\). Also, the exact stability result has been considered, and the author showed for \(n\) sufficiently large depending on \(t\), if \(A\subseteq S_n\) is a \(t\)-intersecting family which is not contained within a \(t\)-coset, then \(A\) is at most as large as the family \(D =D_1\cup D_2\) with \[ D_1 = \{\sigma\in S_n\mid \sigma(i) = i\text{ for all }i\leq t,\, \sigma(j) = j\text{ for some }j>t+1\} \] and \[ D_2=\{(i\,t+1)\mid i=1,2,\dots,t\}, \] which has size \((1-1/e + o(1))(n-t)!\). Moreover, if \(|A|=|D|\) then there exist \(\pi,\pi' \in S_n\) such that \(A = \pi D \pi'\).