restricted_cycle_length_support
def
The finite set of distinct cycle lengths of a permutation of Fin n, defined by the cardinalities of its SameCycle equivalence classes. Fixed points contribute length 1.
Statement
noncomputable def restricted_cycle_length_support (n : ℕ) (σ : Equiv.Perm (Fin n)) : Finset ℕ
- Source
- Helper for global_gcd_agreement_r_ge_four, OP-746, inbox IN-440. arXiv:2610.40342v1 Proposition 11.3(i) and Appendix A.5 give the support decomposition. No novelty claim; the uniform conjecture in Question 14.10 remains open.
- Verified
- 01 Nov 2026
- Axioms
- none listed
- Used by 2
- restricted_cycle_count_as_support_sumIf A is contained in the interval of lengths from r+1 through n, the number of permutations avoiding lengths 1 through r and avoiding the…
- restricted_cycle_exact_support_countThe number of permutations of Fin n with set of distinct cycle lengths exactly P, including fixed points as cycles of length 1.
Lean source view module on GitHub
noncomputable def restricted_cycle_length_support (n : ℕ) (σ : Equiv.Perm (Fin n)) : Finset ℕ := by classical exact Finset.univ.image (fun x => (Finset.univ.filter fun y => σ.SameCycle x y).card)