arXiv (All)
open access
The Davenport constant of low-dimensional boxes
In this paper, we study the maximal length of a minimal zero-sum sequence over $\left[\!\left[ -m,m \right]\!\right]^d$ having a support of size $d+1$. When $d=2$, we find the exact value of this maximal length for all $m \ge 2$, as well as the exact structure of all extremal sequences for this prob
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
- Ordinary lines, point degrees, and matroid density#1356751
- A Sharp Basis-Mass Inequality for Binary Matroids without a Fano Minor#1325266
- On the size of the maximum of incomplete Kloosterman sums#452189
- Moment obstructions and continuum-to-discrete bounds for checkerboard no-three-in-line sets#1000297
- Generalized Hamming Weights of AJ-Gorenstein One-Point Codes#790266
Record · ID 1328152
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