restricted_cycle_exact_support_count
def
The number of permutations of Fin n with set of distinct cycle lengths exactly P, including fixed points as cycles of length 1.
Statement
noncomputable def restricted_cycle_exact_support_count (n : ℕ) (P : 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
- Built on 1
- restricted_cycle_length_supportThe finite set of distinct cycle lengths of a permutation of Fin n, defined by the cardinalities of its SameCycle equivalence classes.…
- Used by 3
- restricted_cycle_global_eq_iff_support_dvdFor every r and n, the global and one-parameter gcds are equal if and only if the one-parameter gcd divides the exact cycle-support count…
- 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_global_gcd_eq_support_gcdFor every r and n, the global gcd of counts avoiding cycle lengths 1 through r and any additional subset of lengths up to n equals the gcd…
Lean source view module on GitHub
noncomputable def restricted_cycle_exact_support_count (n : ℕ) (P : Finset ℕ) : ℕ := by classical exact (Finset.univ.filter fun σ : Equiv.Perm (Fin n) => restricted_cycle_length_support n σ = P).card