On sumfree subsets of hypercubes
classification
🧮 math.NT
math.CO
keywords
boundconsiderlargelowersetssumfreeupperanalogue
read the original abstract
We consider the possible sizes of large sumfree sets contained in the discrete hypercube $\{1,...,n\}^k$, and we determine upper and lower bounds for the maximal size as $n$ becomes large. We also discuss a continuous analogue in which our lower bound remains valid and our upper bound can be strengthened, and we consider the generalization of both problems to $l$-fold-sumfree sets.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.