On sumfree subsets of hypercubes
Daniel J. Katz
Abstract
Daniel J. Katz
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. 1
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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. 1
Key concepts: Hypercube, Mathematics, Upper and lower bounds, Generalization, Combinatorics, Discrete mathematics, Mathematical analysis