arXiv (All)
open access
A proof of the Auluck-Chowla-Gupta Conjecture
Let p(n,k) denote the number of partitions of n into exactly k parts. In 1942 Auluck, Chowla and Gupta conjectured that for every n the sequence p(n,1), p(n,2), ..., p(n,n) is unimodal. Szekeres proved this for all sufficiently large n, but with a threshold that was never made explicit. We prove the
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
- Proofs of some OEIS conjectures on Wythoff sums, Fibonacci and Lucas words#1200493
- A Bad Example for Jain’s Iterative Rounding Theorem for the Cover Small Cuts Problem / Miles Simmons, Ishan Bansal, Joe Cheriyan#1188627
- Chvátal's conjecture: a proof from The Book#1065007
- On a uniform bound for exponential sums modulo $p^m$ for Deligne polynomials#1129024
- An oral history of FPSAC#1345059
Record · ID 1324685
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