arXiv (OAI Expanded)
open access
Estimating the asymptotics of integer partitions in intermediate dimensions ($d = 3,4,5,6$)
It was recently shown by Yeliussizov \cite{Yeliussizov} that integer partitions in dimensions $d \geq 7$ asymptotically grow strictly faster than MacMahon numbers. As MacMahon numbers match with integer partitions in dimensions $d = 1,2$, the comparison of asymptotics of integer partitions with MacM
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
- Estimating the asymptotics of integer partitions in intermediate dimensions ($d = 3,4,5,6$)#925403
- Constraints on the Universe as a Numerical Simulation#700057
- On the ACC for Minimal Log Discrepancies for Bounded Generalized Sub-Pairs#1034331
- An improved volume bound under Ricci and scalar curvature lower bounds#821987
- Number of annual increments and density of core fragments#281669
Record · ID 921167
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