Source authenticated

Chen-Gendron Spin-Parity Identity for k-Differentials

For odd $k$ with $\gcd(n,k) = \gcd(n+1,k) = 1$, is $N_k(n) \equiv \lfloor (k+1)/4 \rfloor \pmod 2$, where $N_k(n)$ counts pairs $1 \le b_i \le (k-1)/2$ with $b_1 + b_2 \ge (k+1)/2$ and $b_2 \equiv n b_1 \pmod k$? Conjectured by Chen and Gendron; its proof removes a conditional step in the genus-zero and genus-one spin-parity classification.

Exact FrontierDelta

Prior state unknownproved

Scope and record

Occurred: Feb 3, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: lean-checked. Publication: preprint. AI contribution: ai-discovered. Imported under CC BY 4.0.

Canonical aliases: Chen-Gendron Spin-Parity Identity for k-Differentials · Spin parity identity

Confidence: Not scored

Registry verification: lean checked · preprint · resolved

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

AxiomProver
model · ai model contributor

Lineage and corrections

This event attributed to AxiomProver

Act on this frontier

Verify, challenge, or extend the result.