arXiv (All)
open access
Exact diameter compression for four-point sumset cardinalities
The least interval diameter needed to realize every attainable cardinality of an $h$-fold sumset of a four-element integer set is $\binom{h+2}{2}+(h\bmod2)$ for $2\le h\le10$ and $d_h=(h-3)(h-1)$ for $h\ge11$. We prove the formula uniformly for $h\ge17$ and use complete finite searches, with a relat
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
- The Davenport constant of low-dimensional boxes#1328152
- Maximum number of spanning trees in bipartite graphs with a given diameter#1109503
- Wild number for spanning trees in complete and complete bipartite graphs#1357797
- Minimum enclosing Bregman balls made easy#925214
- Minimum enclosing Bregman balls made easy#920979
Record · ID 1186530
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