Representations of integers as the sum of k terms
From MaRDI portal
Publication:5203086
DOI10.1002/RSA.3240010302zbMATH Open0725.11007DBLPjournals/rsa/ErdosT90OpenAlexW2155360885WikidataQ60360141 ScholiaQ60360141MaRDI QIDQ5203086FDOQ5203086
Authors: Prasad Tetali, P. 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
Recommendations
- On the number of representations of integers as the sum of k terms
- On the representation of integers as sums of distinct terms from a fixed set
- Representation of positive integers by summands of a certain form
- On the Representations of an Integer as the Sum of Products of Integers
- Representations of Positive Integers as Sums of Arithmetic Progressions
- On the Representation of an Integer as the Sum of k k -th Powers
- The Representation of Some Integers as a Subset Sum
- scientific article; zbMATH DE number 5505981
Cites Work
Cited In (33)
- A lower bound for irredundant Ramsey numbers
- An extension of the Erdős-Tetali theorem
- On the representation of 1,2,..., n by sums
- Representations of Numbers as $\sum_{k=-n}^n \varepsilon_k k$ :A Saddle Point Approach
- On the cycle space of a random graph
- On the representation of integers as sums of distinct terms from a fixed set
- On Sidon sets and asymptotic bases
- On asymptotic bases which have distinct subset sums
- Representations of Positive Integers as Sums of Arithmetic Progressions
- Finite representability of integers as 2-sums
- On a refinement of Waring's problem
- Answer to a Question by Burr and Erdős on Restricted Addition, and Related Results
- Additive bases with many representations
- Asymptotic results for a class of triangular arrays of multivariate random variables with Bernoulli distributed components
- Title not available (Why is that?)
- On the random greedy \(F\)-free hypergraph process
- On the random greedy \(F\)-free hypergraph process
- Upper tails for arithmetic progressions in random subsets
- On the minimal number of edges in color-critical graphs
- Generalized Sidon sets of perfect powers
- Logarithmic representability of integers as \(k\)-sums
- On Sidon sets which are asymptotic bases
- An elementary heuristic for Hardy-Littlewood extended Goldbach's conjecture
- On the order of subsets of asymptotic bases
- Bounds on Ramsey games via alterations
- Title not available (Why is that?)
- Concentration of non‐Lipschitz functions and applications
- On additive properties of general sequences
- Title not available (Why is that?)
- Integer Sum Sets Containing Long Arithmetic Progressions
- The reverse \(H\)-free process for strictly 2-balanced graphs
- Title not available (Why is that?)
- On the concentration of multivariate polynomials with small expectation
This page was built for publication: Representations of integers as the sum of k terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203086)