We obtain several intersection theorems for permutations with purely combinatorial proofs. Two families are cross -intersecting if every and agree on at least points. A -coset is a coset of the stabilizer of points. A subset of is non-trivial if it is not contained in any -coset. Let denote the -th derangement number. We prove that, for all and , every pair of cross -intersecting families satisfies the following: (i) if is non-trivial. (ii) if both and are non-trivial. (iii) for some -coset if . We also characterize all extremal configurations. The first result extends a theorem of Ellis (2011) to an exponentially wider range and sharpens the stability theorem of Keller, Lifshitz, Minzer and Sheinfeld (2024); the second gives a product version of the classical Hilton–Milner–Frankl theorem for permutations; and the third settles the remaining cases of a conjecture of Ellis (2011) in a stronger form. In all three results, the linear dependence on is essentially optimal. Our proofs are based on the spread approximation method introduced by Kupavskii and Zakharov and on an approach to cross -intersection problems developed by the present authors, with several essential refinements. As an application of our approach, we prove a product version of the Hilton–Milner–Frankl theorem for the alternating group.

生成讲解博客的中文版本

生成AI智能校验的中文版本