| $4$ | [Grinsztajn2026] | From the pointwise estimate $D(C_n^3)\le 4n-P(n)-2$, where $P(n)=\max_{p^a\parallel n}p^a$. Since $P(n)\ge2$, this gives $C_{53}\le4$. |exact pinned row| $4$ | <a href="#Grinsztajn2026">[Grinsztajn2026]</a> | From the pointwise estimate $D(C_n^3)\le 4n-P(n)-2$, where $P(n)=\max_{p^a\parallel n}p^a$. Since $P(n)\ge2$, this gives $C_{53}\le4$. |value changed 2026-09-05
Cite this rowBounds Ledger — Davenport constant for $C_n^3$ (53a)
upper bound: $4$ (value changed 2026-09-05)
lower bound: $3$ (text edited 2026-08-24 — bound unchanged)
Mirrored from teorth/optimizationproblems@2c1968c. These are the last-listed rows of that constant's bounds table — a listing position, not a statement that this bound is the strongest or most recent. A snapshot at that sha, not a live read.
https://u00dxk2.github.io/bounds-ledger/c/53a.html