A permutation identity supporting the Green–Liebeck code conjecture
For natural numbers , define whenever the indices are defined. Let be positive integers satisfying and . Permutation identity conjecture. For every integer with , one has
The paper presents this identity as useful for investigating the Green–Liebeck conjecture, but the supplied text gives no proof or resolution.
References
- Junyao Pan, “Two Identities”, arXiv:2104.10346 (2021).
Progress summary
A reader has posted a complete proof of the identity, but it has not been independently verified, so the problem is not settled.
The conjecture asks whether the displayed double-sum formula holds for every admissible positive integer and each with . Junyao Pan’s 2021 paper presents the identity in work on the Green–Liebeck conjecture, but the supplied paper text does not prove or resolve it.
Posted attempt
A complete proof was posted using a falling-factorial reformulation, a cyclic-word transfer matrix, and constant-term extraction. It claims the identity for all admissible and , but it is reader-written and has not been independently verified.
Current status (as of August 2026): A complete proof has been claimed but remains unverified; the permutation identity is not established or disproved.
Sources
Solutions 1
This solution needs a summarySee full solution
The identity holds for ALL admissible and every .
Write , let
and note that the hypotheses imply and . In falling-factorial notation, the proposed identity is
Set . Dividing (1) by and canceling factorials gives the equivalent identity
where
The quantity counts -element subsets of a labeled -cycle having exactly nonempty cyclic runs: choose the positive occupied-run lengths, the positive complementary-gap lengths, and a distinguished vertex, then divide by the possible distinguished runs.
Introduce formal variables , and put
Let denote the constant term in the Laurent expansion at . For ,
For , this constant term is zero: the Laurent series has maximal -degree .
The transfer matrix for binary cyclic words, recording occupied vertices by and occupied runs by , is
Its closed walks yield
Here the first two terms correspond to the all-zero and all-one words. The characteristic roots of are
as their sum is and their product is . Hence
Since , both
and
have strictly negative maximal -degree and therefore have zero constant term at infinity.
Multiplying (5) by and taking constant terms consequently gives
Extract the coefficient of . By (4), the left side is precisely the right side of (2); the right side is
This proves (2), and therefore the original permutation identity (1), for every .