Limiting proportions of sum-dominant, difference-dominant, and balanced sets

From papers

Let PP be any arithmetic progression with length nn. Define the proportions

ρ=limn2n#{SP:S is difference-dominant},\rho_- = \lim_{n\to\infty}2^{-n}\#\{S\subseteq P:S\text{ is difference-dominant}\}, ρ+=limn2n#{SP:S is sum-dominant},\rho_+ = \lim_{n\to\infty}2^{-n}\#\{S\subseteq P:S\text{ is sum-dominant}\},

and

ρ==limn2n#{SP:S is sum-difference-balanced}.\rho_= = \lim_{n\to\infty}2^{-n}\#\{S\subseteq P:S\text{ is sum-difference-balanced}\}.

Limiting-proportion conjecture. The three limiting proportions all exist and are positive.

The preceding theorem establishes positive lower bounds for the corresponding proportions for every sufficiently large nn, so only the existence of the limits is conjectural. The claim concerns the asymptotic distribution of the three types of subsets of an arithmetic progression.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Greg Martin and Kevin O'Bryant, “Many sets have more sums than differences”, arXiv:math/0608131 (2006).

Solutions 0

No solutions have been posted yet.