arXiv (All)
open access
Counterexamples to the Minimum Period Conjecture for Restricted Partition Functions
For a finite sequence of positive integers $\boldsymbol{a}=(a_1,\dots,a_n)$, the restricted partition function $q_{\boldsymbol{a}}(k)$ denote the number of nonnegative integer solutions to the equation $a_1x_1+a_2x_2+\cdots +a_nx_n=k$. It is proved to be a quasi-polynomial of degree $n-1$. Write $q_
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
- Two Companion $q$-Series Identities and Their Combinatorics#1354638
- Maximum number of zeroes of polynomials on weighted projective spaces over a finite field#1312767
- A Proof of a Conjecture on Fixed Perimeter Partitions#635983
- A Proof of a Conjecture on Fixed Perimeter Partitions#633634
- Algebraic Structures on Sets of Partitions#1109643
Record · ID 1387141
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