TOPICS
Search

Admissible Set


An admissible set in the additive sense of Erdős et al. (1991) is a finite set A of positive integers such that two subsets of A with the same sum always have the same cardinal number. This allows different subsets of equal size to have equal sums. For example, {3,4,5,6} is admissible even though 3+6=4+5. The condition differs from requiring all subset sums to be distinct.

The Erdős-Nicolas-Sárközy conjecture concerns the number of these sets contained in {1,...,N}.


See also

Erdos-Nicolas-Sarkozy Conjecture

Explore with Wolfram|Alpha

References

Erdős, P.; Nicolas, J.-L.; and Sárközy, A. "Sommes de sous-ensembles." J. Théor. Nombres Bordeaux 3, 55-72, 1991.Wang, G. and Yang, W. "Counting Admissible Sets of Integers: A Proof of the Erdős-Nicolas-Sárközy Conjecture." 25 Oct 2026. https://arxiv.org/abs/2610.34372.

Cite this as:

Weisstein, Eric W. "Admissible Set." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/AdmissibleSet.html

Subject classifications