English

Structure in additively nonsmoothing sets

Combinatorics 2011-04-15 v1

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 F3NF_3 ^N.

Cite

@article{arxiv.1104.2862,
  title  = {Structure in additively nonsmoothing sets},
  author = {Michael Bateman and Nets Hawk Katz},
  journal= {arXiv preprint arXiv:1104.2862},
  year   = {2011}
}

Comments

18 pages

R2 v1 2026-06-21T17:54:16.035Z