Representations of integers as the sum of k terms

DOI10.1002/rsa.3240010302zbMath0725.11007OpenAlexW2155360885WikidataQ60360141 ScholiaQ60360141MaRDI QIDQ5203086

Prasad Tetali, Paul Erdős

Publication date: 1990

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240010302

zbMATH Keywords

asymptotic basisrepresentations of integersSidon sequencesrandom constructions

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Representation functions (11B34)

Related Items (20)

Concentration of non‐Lipschitz functions and applications ⋮ On additive properties of general sequences ⋮ On the Random Greedy $F$-Free Hypergraph Process ⋮ Asymptotic results for a class of triangular arrays of multivariate random variables with Bernoulli distributed components ⋮ On Sidon sets and asymptotic bases ⋮ On the random greedy \(F\)-free hypergraph process ⋮ A lower bound for irredundant Ramsey numbers ⋮ An elementary heuristic for Hardy-Littlewood extended Goldbach's conjecture ⋮ Upper tails for arithmetic progressions in random subsets ⋮ Generalized Sidon sets of perfect powers ⋮ Bounds on Ramsey games via alterations ⋮ On the cycle space of a random graph ⋮ On Sidon sets which are asymptotic bases ⋮ On the concentration of multivariate polynomials with small expectation ⋮ Finite Representability of Integers as $2$-Sums ⋮ ON ASYMPTOTIC BASES WHICH HAVE DISTINCT SUBSET SUMS ⋮ On the minimal number of edges in color-critical graphs ⋮ An extension of the Erdős‐Tetali theorem ⋮ The Reverse H‐free Process for Strictly 2‐Balanced Graphs ⋮ On a refinement of Waring's problem

Cites Work

• Poisson approximation for large deviations

This page was built for publication: Representations of integers as the sum of k terms