On products of permutations with the most uncontaminated cycles by designated labels
Abstract
There is a growing interest in studying the distribution of certain labels in products of permutations since the work of Stanley addressing a conjecture of B\'ona. This paper is concerned with a problem in that direction. Let D be a permutation on the set [n]=\1,2,…, n\ and E⊂ [n]. Suppose the maximum possible number of cycles uncontaminated by the E-labels in the product of D and a cyclic permutation on [n] is θ (depending on D and E). We prove that for arbitrary D and E with few exceptions, the number of cyclic permutations γ such that D γ has exactly θ-1 E-label free cycles is at least 1/2 that of γ for D γ to have θ E-label free cycles, where 1/2 is best possible. An even more general result is also conjectured.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.