Degree enumeration for labelled circular run-constrained words.
Definition 1.1 (degSeries).
degSeries = ( PowerSeries . mk ( fun n ↦ ∑ k ∈ Finset . range ( n + 1 ) , Polynomial . C ( N n k : Z ) ⋅ Polynomial . X k ))
Formalization. D5/S1/Words/AssociatedMersenne/DegreeGeneratingFunction.degSeries (✓ std3).
Source. Repository-derived.
Acknowledgement. J. Wei and Y. Yang (2024). Associated Mersenne graphs . DOI: 10.48550/arXiv.2407.08237 . URL: https://arxiv.org/abs/2407.08237v1 .
Commentary.
Each length coefficient is the polynomial histogram of admissible labelled words by degree.
Definition 1.2 (numCoeff).
∀ ( n : Nat ) , ( n = 0 ) → ( numCoeff n = 1 ) ∀ ( n : Nat ) , ( n = 1 ) → ( numCoeff n = 1 − ( Polynomial . X : Polynomial Z )) ∀ ( n : Nat ) , ( n = 2 ) → ( numCoeff n = − ( Polynomial . X : Polynomial Z ) − 3 ) ∀ ( n : Nat ) , ( n = 3 ) → ( numCoeff n = ( Polynomial . X : Polynomial Z ) 3 + 5 ⋅ ( Polynomial . X : Polynomial Z ) − 4 ) ∀ ( n : Nat ) , ( n = 4 ) → ( numCoeff n = − 3 ⋅ ( Polynomial . X : Polynomial Z ) 2 + 7 ⋅ ( Polynomial . X : Polynomial Z ) + 2 ) ∀ ( n : Nat ) , ( n = 5 ) → ( numCoeff n = ( Polynomial . X : Polynomial Z ) 3 − 11 ⋅ ( Polynomial . X : Polynomial Z ) + 6 ) ∀ ( n : Nat ) , ( n = 6 ) → ( numCoeff n = − 5 ⋅ ( Polynomial . X : Polynomial Z ) 3 + 17 ⋅ ( Polynomial . X : Polynomial Z ) 2 − 18 ⋅ ( Polynomial . X : Polynomial Z ) + 2 ) ∀ ( n : Nat ) , ( n = 7 ) → ( numCoeff n = 7 ⋅ ( Polynomial . X : Polynomial Z ) 4 − 22 ⋅ ( Polynomial . X : Polynomial Z ) 3 + 7 ⋅ ( Polynomial . X : Polynomial Z ) 2 + 14 ⋅ ( Polynomial . X : Polynomial Z ) − 4 ) ∀ ( n : Nat ) , ( n = 8 ) → ( numCoeff n = − ( Polynomial . X : Polynomial Z ) 4 + 15 ⋅ ( Polynomial . X : Polynomial Z ) 3 − 32 ⋅ ( Polynomial . X : Polynomial Z ) 2 + 22 ⋅ ( Polynomial . X : Polynomial Z ) − 3 ) ∀ ( n : Nat ) , ( n = 9 ) → ( numCoeff n = − ( Polynomial . X : Polynomial Z ) 5 − 24 ⋅ ( Polynomial . X : Polynomial Z ) 4 + 57 ⋅ ( Polynomial . X : Polynomial Z ) 3 − 22 ⋅ ( Polynomial . X : Polynomial Z ) 2 − 11 ⋅ ( Polynomial . X : Polynomial Z ) + 1 ) ∀ ( n : Nat ) , ( n = 10 ) → ( numCoeff n = − 2 ⋅ ( Polynomial . X : Polynomial Z ) 5 + 8 ⋅ ( Polynomial . X : Polynomial Z ) 4 − 21 ⋅ ( Polynomial . X : Polynomial Z ) 3 + 27 ⋅ ( Polynomial . X : Polynomial Z ) 2 − 13 ⋅ ( Polynomial . X : Polynomial Z ) + 1 ) ∀ ( n : Nat ) , ( n = 11 ) → ( numCoeff n = − 2 ⋅ ( Polynomial . X : Polynomial Z ) 6 − 2 ⋅ ( Polynomial . X : Polynomial Z ) 5 + 43 ⋅ ( Polynomial . X : Polynomial Z ) 4 − 71 ⋅ ( Polynomial . X : Polynomial Z ) 3 + 27 ⋅ ( Polynomial . X : Polynomial Z ) 2 + 5 ⋅ ( Polynomial . X : Polynomial Z )) ∀ ( n : Nat ) , ( n = 12 ) → ( numCoeff n = − ( Polynomial . X : Polynomial Z ) 6 + 8 ⋅ ( Polynomial . X : Polynomial Z ) 5 − 19 ⋅ ( Polynomial . X : Polynomial Z ) 4 + 21 ⋅ ( Polynomial . X : Polynomial Z ) 3 − 12 ⋅ ( Polynomial . X : Polynomial Z ) 2 + 3 ⋅ ( Polynomial . X : Polynomial Z )) ∀ ( n : Nat ) , ( n = 13 ) → ( numCoeff n = − ( Polynomial . X : Polynomial Z ) 7 − 7 ⋅ ( Polynomial . X : Polynomial Z ) 6 + 39 ⋅ ( Polynomial . X : Polynomial Z ) 5 − 72 ⋅ ( Polynomial . X : Polynomial Z ) 4 + 59 ⋅ ( Polynomial . X : Polynomial Z ) 3 − 17 ⋅ ( Polynomial . X : Polynomial Z ) 2 − ( Polynomial . X : Polynomial Z )) ∀ ( n : Nat ) , ( n = 14 ) → ( numCoeff n = 2 ⋅ ( Polynomial . X : Polynomial Z ) 6 − 10 ⋅ ( Polynomial . X : Polynomial Z ) 5 + 18 ⋅ ( Polynomial . X : Polynomial Z ) 4 − 14 ⋅ ( Polynomial . X : Polynomial Z ) 3 + 4 ⋅ ( Polynomial . X : Polynomial Z ) 2 ) ∀ ( n : Nat ) , ( n = 15 ) → ( numCoeff n = − 14 ⋅ ( Polynomial . X : Polynomial Z ) 7 + 64 ⋅ ( Polynomial . X : Polynomial Z ) 6 − 114 ⋅ ( Polynomial . X : Polynomial Z ) 5 + 98 ⋅ ( Polynomial . X : Polynomial Z ) 4 − 40 ⋅ ( Polynomial . X : Polynomial Z ) 3 + 6 ⋅ ( Polynomial . X : Polynomial Z ) 2 ) ∀ ( n : Nat ) , ( n = 16 ) → ( numCoeff n = − ( Polynomial . X : Polynomial Z ) 6 + 4 ⋅ ( Polynomial . X : Polynomial Z ) 5 − 6 ⋅ ( Polynomial . X : Polynomial Z ) 4 + 4 ⋅ ( Polynomial . X : Polynomial Z ) 3 − ( Polynomial . X : Polynomial Z ) 2 ) ∀ ( n : Nat ) , ( n = 17 ) → ( numCoeff n = − 6 ⋅ ( Polynomial . X : Polynomial Z ) 8 + 39 ⋅ ( Polynomial . X : Polynomial Z ) 7 − 97 ⋅ ( Polynomial . X : Polynomial Z ) 6 + 118 ⋅ ( Polynomial . X : Polynomial Z ) 5 − 72 ⋅ ( Polynomial . X : Polynomial Z ) 4 + 19 ⋅ ( Polynomial . X : Polynomial Z ) 3 − ( Polynomial . X : Polynomial Z ) 2 ) ∀ ( n : Nat ) , ( n = 19 ) → ( numCoeff n = 4 ⋅ ( Polynomial . X : Polynomial Z ) 8 − 20 ⋅ ( Polynomial . X : Polynomial Z ) 7 + 40 ⋅ ( Polynomial . X : Polynomial Z ) 6 − 40 ⋅ ( Polynomial . X : Polynomial Z ) 5 + 20 ⋅ ( Polynomial . X : Polynomial Z ) 4 − 4 ⋅ ( Polynomial . X : Polynomial Z ) 3 ) ∀ ( n : Nat ) , ( ¬ ( n ∈ [ 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 , 11 , 12 , 13 , 14 , 15 , 16 , 17 , 19 ])) → ( numCoeff n = 0 )
Formalization. D5/S1/Words/AssociatedMersenne/DegreeGeneratingFunction.numCoeff (✓ std3).
Source. Repository-derived.
Acknowledgement. J. Wei and Y. Yang (2024). Associated Mersenne graphs . DOI: 10.48550/arXiv.2407.08237 . URL: https://arxiv.org/abs/2407.08237v1 .
Commentary.
The explicit finite polynomial coefficients specify the numerator in the length variable.
Definition 1.3 (denCoeff).
∀ ( n : Nat ) , ( n = 0 ) → ( denCoeff n = 1 ) ∀ ( n : Nat ) , ( n = 1 ) → ( denCoeff n = − ( Polynomial . X : Polynomial Z )) ∀ ( n : Nat ) , ( n = 2 ) → ( denCoeff n = − 4 ) ∀ ( n : Nat ) , ( n = 3 ) → ( denCoeff n = 3 ⋅ ( Polynomial . X : Polynomial Z )) ∀ ( n : Nat ) , ( n = 4 ) → ( denCoeff n = 6 ) ∀ ( n : Nat ) , ( n = 5 ) → ( denCoeff n = − ( Polynomial . X : Polynomial Z ) 2 − 2 ⋅ ( Polynomial . X : Polynomial Z )) ∀ ( n : Nat ) , ( n = 6 ) → ( denCoeff n = − 4 ) ∀ ( n : Nat ) , ( n = 7 ) → ( denCoeff n = ( Polynomial . X : Polynomial Z ) 3 + 2 ⋅ ( Polynomial . X : Polynomial Z ) 2 − 2 ⋅ ( Polynomial . X : Polynomial Z )) ∀ ( n : Nat ) , ( n = 8 ) → ( denCoeff n = 1 ) ∀ ( n : Nat ) , ( n = 9 ) → ( denCoeff n = 2 ⋅ ( Polynomial . X : Polynomial Z ) 4 − 6 ⋅ ( Polynomial . X : Polynomial Z ) 3 + ( Polynomial . X : Polynomial Z ) 2 + 3 ⋅ ( Polynomial . X : Polynomial Z )) ∀ ( n : Nat ) , ( n = 11 ) → ( denCoeff n = ( Polynomial . X : Polynomial Z ) 5 − 7 ⋅ ( Polynomial . X : Polynomial Z ) 4 + 12 ⋅ ( Polynomial . X : Polynomial Z ) 3 − 5 ⋅ ( Polynomial . X : Polynomial Z ) 2 − ( Polynomial . X : Polynomial Z )) ∀ ( n : Nat ) , ( n = 13 ) → ( denCoeff n = − 2 ⋅ ( Polynomial . X : Polynomial Z ) 5 + 8 ⋅ ( Polynomial . X : Polynomial Z ) 4 − 10 ⋅ ( Polynomial . X : Polynomial Z ) 3 + 4 ⋅ ( Polynomial . X : Polynomial Z ) 2 ) ∀ ( n : Nat ) , ( n = 15 ) → ( denCoeff n = ( Polynomial . X : Polynomial Z ) 5 − 3 ⋅ ( Polynomial . X : Polynomial Z ) 4 + 3 ⋅ ( Polynomial . X : Polynomial Z ) 3 − ( Polynomial . X : Polynomial Z ) 2 ) ∀ ( n : Nat ) , ( ¬ ( n ∈ [ 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 11 , 13 , 15 ])) → ( denCoeff n = 0 )
Formalization. D5/S1/Words/AssociatedMersenne/DegreeGeneratingFunction.denCoeff (✓ std3).
Source. Repository-derived.
Acknowledgement. J. Wei and Y. Yang (2024). Associated Mersenne graphs . DOI: 10.48550/arXiv.2407.08237 . URL: https://arxiv.org/abs/2407.08237v1 .
Commentary.
The explicit finite polynomial coefficients specify the denominator with constant coefficient one.
Definition 1.4 (NUM).
NUM = ( PowerSeries . mk numCoeff )
Formalization. D5/S1/Words/AssociatedMersenne/DegreeGeneratingFunction.NUM (✓ std3).
Source. Repository-derived.
Acknowledgement. J. Wei and Y. Yang (2024). Associated Mersenne graphs . DOI: 10.48550/arXiv.2407.08237 . URL: https://arxiv.org/abs/2407.08237v1 .
Commentary.
The numerator coefficient list defines a power series with finite support in the length variable.
Definition 1.5 (DEN).
DEN = ( PowerSeries . mk denCoeff )
Formalization. D5/S1/Words/AssociatedMersenne/DegreeGeneratingFunction.DEN (✓ std3).
Source. Repository-derived.
Acknowledgement. J. Wei and Y. Yang (2024). Associated Mersenne graphs . DOI: 10.48550/arXiv.2407.08237 . URL: https://arxiv.org/abs/2407.08237v1 .
Commentary.
The denominator coefficient list defines a power series with finite support in the length variable.
Definition 1.6 (claim).
claim ⟺ ( degSeries ⋅ DEN = NUM )
Formalization. D5/S1/Words/AssociatedMersenne/DegreeGeneratingFunction.claim (✓ std3).
Source. Repository-derived.
Acknowledgement. J. Wei and Y. Yang (2024). Associated Mersenne graphs . DOI: 10.48550/arXiv.2407.08237 . URL: https://arxiv.org/abs/2407.08237v1 .
Commentary.
Wei and Yang, Question 6.2, arXiv v1, p. 18: “For given n and k, how many vertices of Associated Mersenne graph ℳₙ have degree k?” N n k counts labelled admissible Boolean words, without identifying rotations. The PowerSeries index is length and Polynomial.X records degree. The displayed formula clears the explicit denominator.
Theorem 1.7 (result).
claim
Proof. Machine-checked in Lean as D5/S1/Words/AssociatedMersenne/DegreeGeneratingFunction.result (✓ std3). ∎
Resolves. Problems/wei-yang-2024-associated-mersenne-degree-series (proved) by D5/S1/Words/AssociatedMersenne/DegreeGeneratingFunction.result.
Source. Repository-derived.
Acknowledgement. J. Wei and Y. Yang (2024). Associated Mersenne graphs . DOI: 10.48550/arXiv.2407.08237 . URL: https://arxiv.org/abs/2407.08237v1 .
Commentary.
The marked tuple bijection and pair-local flip classification give the degree statistic. The marked double count and finite transfer resolvent, with the exact singleton correction, yield the displayed denominator-cleared degree generating function for every length.
Truth anchor: D5/S1/Words/AssociatedMersenne/DegreeGeneratingFunction.DEN
Truth anchor: D5/S1/Words/AssociatedMersenne/DegreeGeneratingFunction.NUM
Truth anchor: D5/S1/Words/AssociatedMersenne/DegreeGeneratingFunction.claim
Truth anchor: D5/S1/Words/AssociatedMersenne/DegreeGeneratingFunction.degSeries
Truth anchor: D5/S1/Words/AssociatedMersenne/DegreeGeneratingFunction.denCoeff
Truth anchor: D5/S1/Words/AssociatedMersenne/DegreeGeneratingFunction.numCoeff
Truth anchor: D5/S1/Words/AssociatedMersenne/DegreeGeneratingFunction.result
Dependency: D5/S1/Words/AssociatedMersenne/TransferResolvent