Structure in additively nonsmoothing sets

MaRDI QIDQ6224807zbMATH OpenFDO

Authors Michael Bateman, Nets Hawk Katz

Publication date 14 April 2011

Mathematics Subject Classification ID

Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Abstract: Sets with many additive quadruples are guaranteed to have many additive octuples, by H"{o}lder's inequality. Sets with not many more than this are said to be additively nonsmoothing. We give a new proof of a structural theorem for nonsmoothing sets that originally appeared in work of the authors (cite{BK}) on the size of cap sets in $F_3^N$.

This page was built for publication: Structure in additively nonsmoothing sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6224807)