On the concentration of multivariate polynomials with small expectation

Random Structures and Algorithms

Volumn 16, Issue 4, 2000, Pages 344-363

  Vu, Van H ^a,b  

^a MICROSOFT RESEARCH   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034215936     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/1098-2418(200007)16:4<344::AID-RSA4>3.0.CO;2-5     Document Type: Article

References (24)

1. N. Alon and J. Spencer, The probabilistic method, Wiley, New York, 1992.
2. J.H. Kim and V.H. Vu, Small complete arcs on projective planes, submitted for publication.
3. V.H. Vu, Average smoothness: concentration of multi-variate polynomials and its applications, manuscript.
4. S. Janson, Poisson approximation for large deviations, Random Struct Algorithms 1 (1990), 221-230.
5. M. Talagrand, A new look at independence, Ann Probab 24(1) (1996), 1-34.
6. J.H. Kim and V.H. Vu, Concentration of polynomials and its applications, Combinatorica, to appear.
7. V.H. Vu, On the list chromatic number of locally sparse graphs, manuscript.
8. V.H. Vu, On some degree conditions which guarantee the upper bound of chromatic (choice) number of random graphs, J Graph Theory 31 (1999), 201-226.
9. V.H. Vu, New bounds on nearly perfect matching in hypergraphs: higher codegrees do help, Random Struct Algorithms, to appear.
10. S. Janson, T. Łuczak, and A. Ruciński, "An exponential bound for the probability of nonexistence of a specified subgraph in a random graph," Random graphs 87 M. Karoński, J. Jaworski, and A. Ruciński (Editors), Wiley, New York, 1990, pp. 73-87.
11. P. Erdos and R. Rado, Intersection theorems for systems of sets, J London Math Soc 35 (1960), 85-90.
12. D. Grable, A large deviation inequality for functions of independent, multiway choices, Combinatorics Probab Comput 7 (1998), 57-63.
13. J. Spencer, Counting extensions, J Combin Theory Ser A 55 (1990), 247-255.
14. H. Halberstam and K.F. Roth, Sequences, Springer-Verlag, New York, 1983.
15. P. Erdos and P. Tetali, Representations of integers as sum of k terms, Random Struct and Algorithms 1 (1990), 245-261.
16. 1/3 squares, Proc Am Math Soc 79 (1980), 203-205.
17. P. Erdos and M. Nathanson, Largange's theorem and thin subsequences of squares, Contribution to probability, J. Gani and V.K. Rohatgi (Editors), Academic Press, New York, 1981, pp. 3-9.
18. J. Spencer, Four squares with few squares, Number theory, New York Seminar 1991-1995, D.V. Chudnovsky, G.V. Chudnovsky, and M. Nathason (Eds.), Springer-Verlag, Berlin/New York, pp. 295-297.
19. J. Zöllner, Der vier-quadrate-satz und ein problem von Erdos and Nathanson, Ph.D thesis, Johannes Gutenberg-Universität, Mainz, 1984.
20. J. Zöllner, Über eine vermutung von Choi, Erdos and Nathanson, Acta Arith 45 (1985), 211-213.
21. E. Wirsing, Thin subbases, Analysis 6 (1986), 285-308.
22. M. Nathanson, Waring's problem for sets of density zero, Analytic number theory, M. Knopp (Editor), Lecture Notes in Mathematics, Springer-Verlag, Berlin/New York, 1980, Vol. 899.
23. V.H. Vu, On a refinement of Waring's problem, Duke Math J, to appear.
24. R.C. Vaugan, The Hardy-Littlewood method, Cambridge Univ. Press, 1981.