On a refinement of Waring's problem

DOI10.1215/S0012-7094-00-10516-9zbMath1013.11063OpenAlexW1972552619WikidataQ60360139 ScholiaQ60360139MaRDI QIDQ1847774

Van H. Vu

Publication date: 27 October 2002

Published in: Duke Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/s0012-7094-00-10516-9

zbMATH Keywords

circle methodthin basisconcentrationadditive basis

Mathematics Subject Classification ID

Waring's problem and variants (11P05) Applications of the Hardy-Littlewood method (11P55) Combinatorial probability (60C05) Additive bases, including sumsets (11B13) Representation problems (11D85)

Related Items (12)

Concentration of non‐Lipschitz functions and applications ⋮ A light-weight version of Waring's problem ⋮ A generalization of a theorem of Erdős–Rényi to m-fold sums and differences ⋮ An elementary heuristic for Hardy-Littlewood extended Goldbach's conjecture ⋮ Generalized Sidon sets of perfect powers ⋮ On Vu's thin basis theorem in Waring's problem ⋮ A REFINED WARING PROBLEM FOR FINITE SIMPLE GROUPS ⋮ Generalization of a theorem of Erdős and Rényi on Sidon sequences ⋮ Dense sets of integers with prescribed representation functions ⋮ An extension of the Erdős‐Tetali theorem ⋮ Uniform bounds in Waring's problem over some diagonal forms ⋮ Efficient congruencing in ellipsephic sets: the general case

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A just basis
• Le geometrie di Galois
• Small complete arcs in projective planes
• Ein Satz über trigonometrische Polynome und seine Anwendung in der Theorie der Fourier-Reihen
• A new look at independence
• Additive properties of random sequences of positive integers
• Intersection Theorems for Systems of Sets
• Über eine Vermutung von Choi, Erdös und Nathanson
• THIN SUBBASES
• Lagrange's Theorem with N 1/3 Squares
• Poisson approximation for large deviations
• On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
• New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
• On the concentration of multivariate polynomials with small expectation
• Representations of integers as the sum of k terms
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems
• Concentration of multivariate polynomials and its applications

This page was built for publication: On a refinement of Waring's problem