Phase Transitions for Sparse Random Sets Under Linear Forms

Abstract

Let A ⊂eq \0,1,…,N\ be a random set in which each element is included independently with probability p=p(N). Fix an integer h ≥ 2 and a linear form L(x1,…,xh) := u1x1 + ·s + uhxh. We study the random image set align* L(A) = \ L(a1,…,ah) : ai ∈ A \, align* inside the feasible interval of values of L on \0,1,…,N\h, as well as the associated representation counts. Our results exhibit two distinct threshold scales. First, there is a global transition at p(N) N-(h-1)/h governing the size of L(A): below this scale collisions are rare and L(A) is sparse, while above it L(A) contains nearly all feasible values. We give sharp asymptotics for the size of L(A) in all regimes, including inside the critical window. Second, there is a local transition at p(N) N-(h-2)/(h-1) governing multiplicities: for typical values in the bulk, the number of essentially distinct representations is asymptotically Poisson below this scale, and Poisson behavior fails above it. For h ≥ 3 these scales are separated, yielding a regime in which L(A) is already globally close to full while local multiplicities remain approximately Poisson. Our framework subsumes the classical sumset and difference-set models, as well as generalized sumsets of the form sA-dA, as special cases. Notably, after correcting its formulation, our global theorem settles the 2009 threshold conjecture of Hegarty-Miller on the behavior of these random images.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…