New lower bounds on g_3(n) via central trinomial coefficients and general exponential lower bounds for g_k(n) (k≥4), paired with upper exponential rates from digit constructions on nearly-regular graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Arithmetic Progression-Free Subset-Sum Sets
New lower bounds on g_3(n) via central trinomial coefficients and general exponential lower bounds for g_k(n) (k≥4), paired with upper exponential rates from digit constructions on nearly-regular graphs.