arXiv (All)
open access
The Quadratic Easy Coefficients Conjecture via Finite-Type Shifts and Zeta Functions
We prove the Quadratic Easy Coefficients Conjecture stated as Conjecture 1 in T. W. Cusick, \emph{Recursions for quadratic rotation symmetric functions weights}, Discrete Applied Mathematics 378 (2026), 93--101. For an arbitrary finite sum of quadratic monomial rotation symmetric Boolean functions,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231#1156455
- Inversion-descent enumerators of $\underline{32}1$-avoiding permutations#799482
- Inversion-descent enumerators of $\underline{32}1$-avoiding permutations#798059
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231#1109623
- Bivariate local permutation polynomials, their companions, and related enumeration results#684208
Record · ID 821336
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive