Probabilistic bounds on the coefficients of polynomials with only real zeros

Journal of Combinatorial Theory. Series A

Volumn 77, Issue 2, 1997, Pages 279-303

  Pitman, Jim ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031071299     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1997.2747     Document Type: Article

References (133)

1. 1. M. Aissen, I. J. Schoenberg, and A. M. Whitney, On the generating function of totally positive sequences I, J. Anal. Math. 2 (1952), 93-103.
2. 2. D. Aldous and J. Pitman. Brownian bridge asymptotics for random mappings, Random Struct. Algorithms 5 (1994), 487-512 .
3. 3. N. Alon and J. H. Spencer, "The Probabilistic Method," Wiley, New York, 1992.
4. 4. T. Ando, Totally positive matrices, Linear Algebra Appl. 90 (1987), 165-219.
5. 5. R. Arratia, A. D. Barbour, and S. Tavaré, Poisson process approximations for the Ewens sampling formula, Ann. Appl. Prob. 2 (1992), 519-535.
6. 6. R. Arratia and S. Tavaré, Independent process approximations for random combinatorial structures, Adv. in Math. (1994), 90-154.
7. 7. A. D. Barbour, Asymptotic expansions in the Poisson limit theorem, Ann. Probab. 15 (1987), 748-766.
8. 8. A. D. Barbour, Refined approximations for the Ewens sampling formula, Rand. Struct. Alg. 3 (1992), 267-276.
9. 9. A. D. Barbour, L. Holst, and S. Janson, "Poisson Approximation," Clarendon Press, Oxford, 1992.
10. 10. E. A. Bender, Central and local limit theorems applied to asymptotic enumeration, J. Combin. Theory Ser. A 15 (1973), 91-111.
11. 11. E. A. Bender, Asymptotic methods in enumeration, SIAM Rev. 16 (1974), 485-515.
12. 12. G. Bennett, Probability inequalities for the sum of independent random variables, J. Amer. Stat. Assoc. 57 (1962), 33-45.
13. 13. P. Billingsley, "Probability and Measure," 3rd ed., Wiley, New York, 1995.
14. 14. B. Bollabas, "Random Graphs," Academic Press, New York, 1985.
15. 15. F. Brenti, Unimodal, log-concave, and Pólya frequency sequences in combinatorics, Mem. Amer. Math. Soc. 413 (1989).
16. 16. F. Brenti, Combinatorics and total positivity, J. Combin. Theory Ser. A 71 (1995), 175-218.
17. 17. F. Brenti, The aplication of total positivity to combinatorics, and conversely, in "Total Positivity and Its Applications" (M. Gasca and C. A. Miccheli, Ed.), Mathematics and Its Applications, Vol. 359, pp. 451-473, Kluwer, Dordrecht, 1996.
18. 18. Z. Broder, The r-Stirling numbers, Discrete Math. 49 (1984), 241-259.
19. 19. L. D. Brown, I. M. Johnstone, and K. B. MacGibbon, Variation diminishing transformations: A direct approach to total positivity and its statistical applications, J. Amer. Stat. Assoc. 76 (1981), 824-832.
20. 20. E. R. Canfield, Central and local limit theorems for the coefficients of polynomials of binomial type, J. Combin. Theory Ser. A 23 (1977), 275-290.
21. 21. E. R. Canfield, Application of the Berry-Esseen inequality, J. Combin. Theory Ser. A 28 (1980), 17-25.
22. 22. L. Carlitz, D. C. Kurtz, R. Scoville, and O. P. Stackelberg, Asymptotic properties of Eulerian numbers, Z. Wahrsch. Verw. Geb. 23 (1972), 47-54.
23. 23. Ch. A. Charalambides and J. Singh, A review of the Stirling numbers, their generalizations and statistical applications, Commun. Statist. Theory Methods 17 (1988), 2533-2595.
24. 24. P. L. Chebyshev, Démonstration élémentaire d'une proposition générale de la théorie des probabilités, J. Reine und Angew. Math. 33 (1846), 259-267; P. L. Tchebychef, Oeuvres, (1899), 16-26.
25. 24. P. L. Chebyshev, Démonstration élémentaire d'une proposition générale de la théorie des probabilités, J. Reine und Angew. Math. 33 (1846), 259-267; P. L. Tchebychef, Oeuvres, (1899), 16-26.
26. 25. H. Chernoff. A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Stat. 23 (1952), 493-509.
27. 26. L. Comtet, "Advanced Combinatorics," Reidel, Boston, 1974 (translated from French).
28. 27. J. N. Darroch, On the distribution of the number of successes in independent trials, Ann. Math. Stat. 35 (1964), 1317-1321.
29. 28. F. N. David and D. E. Barton, "Combinatorial Chance," Griffins, London, 1962.
30. 29. P. Deheuvels, M. L. Puri, and S. S. Ralescu, Asymptotic expansions for sums of nonidentically distributed Bernoulli random variables, J. Multivariate Anal. 28 (1989), 282-303.
31. 30. P. Diaconis and B. Efron, Probabilistic-geometric theorems arising from the analysis of contingency tables, in "Contributions to the Theory and Applications of Statistics" (A. E. Gelfand, Ed.), pp. 103-125, Academic Press, New York, 1987.
32. 31. A. J. Dobson, A note on Stirling numbers of the second kind, J. Combin. Theory Ser. A 5 (1968), 212-214.
33. 32. P. Donnelly, T. G. Kurtz, and S. Tavaré, On the functional central limit theorem for the Ewens sampling formula, Ann. Appl. Prob. 1 (1991), 539-545.
34. 33. A. Edrei, Proof of a conjecture of Schoenberg on the generating function of totally positive sequences, Canad. J. Math. Soc. 5 (1953), 86-94.
35. 34. G. Englund, A remainder term estimate for the normal approximation in classical occupancy, Ann. Probab. 9 (1981), 684-692.
36. 35. P. Erdös, On a conjecture of Hammersley, J. London Math. Soc. 28 (1953), 232-236.
37. 36. W. J. Ewens, The sampling theory of selectively neutral alleles, Theoret. Popul. Biol. 3 (1972) 87-112.
38. 37. W. J. Ewens and S. Tavaré, The Ewens sampling formula, in "Multivariate Discrete Distributions" (N. S. Johnson, S. Kotz, N. Balakrishnan, Eds.), 1995.
39. 38. W. Feller, "An Introduction to Probability Theory and its Applications," Vol. 2, Wiley, New York, 1966.
40. 39. W. Feller, "An Introduction to Probability Theory and its Applications," Vol. 1, 3rd ed., Wiley, New York, 1968.
41. 40. P. Flajolet and M. Soria, Gaussian limiting distributions for the number of components in combinatorial structures, J. Combin. Theory Ser. A 153 (1990), 165-182.
42. 41. P. Flajolet and M. Soria, General combinatorial schemes: Gaussian limit distributions and exponential tails, Discrete Math. 114 (1993), 159-180.
43. 42. D. Foata, Distributions eulériennes et mahoniennes sur le groupe des permutations. In "Higher Combinatorics" (M. Aigner, Ed.), Reidel, Dordrecht, 1977.
44. 43. D. Foata and M. P. Schützenberger, "Théorie Géometrique des Polynômes Eulériens," Lecture Notes in Math., Vol. 138, Springer-Verlag, Berlin, 1970.
45. 44. D. Freedman, Another note on the Borel-Cantelli lemma and the strong law, with the Poisson approximation as a by-product, Ann. Probab. 1 (1973), 910-925.
46. 45. B. Fristedt, "The Structure of Partitions of Large Sets," Technical Report 86-154, Mathematics Dept., University of Minnesota, Minneapolis, Minnesota, 1987.
47. 46. Z. Gao and L. B. Richmond, Central and local limit theorems applied to asymptotic enumeration IV: Multivariate generating functions, J. Comput. and Appl. Math. 41 (1992), 177-186.
48. 47. L. J. Gleser, On the distribution of the number of successes in independent trials, Ann. Probab. 3 (1975), 182-188.
49. 48. C. D. Godsil, Hermite polynomials and a duality relation for matching polynomials, Combinatorica 1 (1981), 257-262.
50. 49. C. D. Godsil, Matching behaviour is asymptotically normal, Combinatorica 1 (1981), 369-376.
51. 50. C. D. Godsil and I. Gutman, On the theory of matching polynomials. J. Graph Theory 5 (1981), 137-144.
52. 51. V. Gončharov, On the field of combinatory analysis, Amer. Math. Soc. Transl. 19 (1962), 1-46.
53. 52. R. L. Graham, D. E. Knuth, and O. Patashnik, "Concrete Mathematics: A Foundation for Computer Science," 2nd ed., Addison-Wesley, Reading, Ma, 1989.
54. 53. J. Haigh, Random equivalence relations, J. Combin. Theory 13 (1972), 287-295, 1972.
55. 54. A. Hald, "A History of Probability and Statistics and their Applications before 1750," Wiley, New York, 1990.
56. 55. J. M. Hammersley, The sum of products of the natural numbers, Proc. London Math. Soc. (3) 1 (1951), 435-452.
57. 56. B. G. Hansen, On log-concave and log-convex infinitely divisible sequences and densities, Ann. Probab. 16 (1988), 1832-1839.
58. 57. G. H. Hardy, J. E. Littlewood, and G. Pólya, "Inequalities," 2nd ed., Cambridge Univ. Press, Cambridge, 1952.
59. 58. L. H. Harper, Stirling behavior is asymptotically normal, Ann. Math. Stat. 38 (1966), 410-414.
60. 59. B. Harris, M. Marden, and C. J. Park, The distribution of the number of empty cells in a generalized random allocation scheme, Ann. Discrete Math. 33 (1987), 77-90.
61. 60. B. Harris and C. J. Park, A note on the asymptotic normality of the distribution of the number of cells in occupancy problems. Ann. Inst. Statist. Math. (Tokyo) 23 (1971), 507-513.
62. 61. W. Hayman, A generalization of Stirling's formula, J. Reine Angew. Math. 196 (1956), 67-95.
63. 62. O. J. Heilmann and E. H. Lieb, Theory of monomer-dimer systems, Commun. Math. Phys. 25 (1972), 190-232.
64. 63. W. Hoeffding, Probability inequalities for sums of bounded random variables, J. Amer. Stat. Assoc. 58 (1963), 13-30.
65. 64. W. Hoeffding, On the distribution of the number of successes in independent trials, Ann. Math. Stat. 35 (1964), 713-721.
66. 65. L. Holst, On numbers related to partitions of unlike objects and occupancy problems, European J. Combin. 2 (1981), 231-237.
67. 66. R. J. Holt, R. M. Dudley, D. Y. Gao, and L. Pakula, Handbook and tables of classic probabilities, unpublished, 1994.
68. 67. H.-K. Hwang, Asymptotic expansions for the Stirling numbers of the first kind, J. Combin. Theory Ser. A 71 (1995), 343-351.
69. 68. E. K. Ifantis and P. N. Panagopoulos, On the zeros of a class of polynomials defined by a three term recurrence relation, J. Math. Anal. Appl. 182 (1994), 361-370.
70. 69. S. Janson, Large deviation inequalities for sums of indicator variables, preprint, 1994.
71. 70. K. Jogdeo and S. M. Samuels, Monotone convergence of binomial probabilities and a generalization of Ramanujan's equation, Ann. Math. Statist. 39 (1968), 1191-1195.
72. 71. P. Joyce and S. Tavaré, Cycles, permutations and the structure of the Yule process with immigration. Stochastic Process. Appl. 25 (1987), 309-314.
73. 72. J. Kahn, A normal law for matchings, preprint, Dept. Math, and RUTCOR, Rutgers University, 1996.
74. 73. A. Kamath, R. Motwani, K. Palem, and P. Spirakis, Tail bounds for occupancy and the satisfiability threshhold conjecture, Random Struct. Algorithms 7 (1995), 59-80.
75. 74. S. Karlin, "Total Positivity," Stanford Univ. Press, Stanford, 1968.
76. 75. J. Keilson, A threshold for log-concavity for probability generating functions and associated moment inequalities, Ann. Math. Statist. 43 (1972), 1702-1708.
77. 76. J. Keilson and H. Gerber, Some results for discrete unimodality. J. Amer. Statist. Assoc. 66 (1971), 386-389.
78. 77. V. F. Kolchin, B. A. Sevastyanov, and V. P. Christyakov, "Random Allocations," Winston, Washington, DC., 1978.
79. 78. V. F. Kolchin, "Random Mappings," Optimization Software, New York, 1986 (translation of Russian original).
80. 79. P. S. Laplace, "Théorie Analytique des Probabilités," 2nd ed., Paris, 1814.
81. 80. P. Lévy, Sur une propriété de la loi de Poisson relative aux petites probabilités, Soc. Math. de France, C. R. scéances de l'annee 1936, p. 29, 1937.
82. 81. P. Lévy, "Théorie de l'Addition des Variables Aléatoires," 2nd ed., Gauthier-Villars, Paris, 1954.
83. 82. E. H. Lieb, Concavity properties and a generating function for Stirling numbers, J. Combin. Theory Ser. A 5 (1968), 203-206.
84. 83. J. E. Littlewood. On the probability in the tail of a binomial distribution, Adv. Appl. Probab. 1 (1969), 43-72.
85. 84. A. W. Marshall and I. Olkin, "Inequalities-Theory of Majorization and its Applications," Academic Press, New York, 1979.
86. 85. J. R. McGregor, Asymptotic normality of the Munch numbers, Scand. J. Statist. 15 (1988), 299-301.
87. 86. B. D. McKay, On Littlewood's estimate for the binomial distribution, Adv. Appl. Probab. 21 (1989), 475-478.
88. 87. V. V. Menon, On the maximum of Stirling numbers of the second kind, J. Combin. Theory Ser. A 15 (1973), 11-24.
89. 88. P. A. P. Moran, Asymptotic analysis and local lattice central limit theorems, J. Appl. Probab. 16 (1979), 541-553.
90. 89. L. Moser and M. Wyman, Asymptotic development of the Stirling numbers of the first kind, J. London Math. Soc. (1958), 133-146.
91. 90. L. Mutafciev, Probability distributions and asymptotics for some characteristics of random mappings, in "Proc. 4th Pannonian Symp. on Math. Statist." (W. Grossman et al., Ed.), 1983, pp. 227-238.
92. 91. A. Nijenhuis, On permanents and zeros of rook polynomials, J. Combin. Theory Ser. A 21 (1976), 240-244.
93. 92. N. Obreschkov, "Verteilung und Berechnung der Nullstellen reeller Polynome," Hochschulbücher für Mathematik Bd. 55, Deutscher Verlag der Wissenschaften, Berlin, 1963.
94. 93. M. Okamoto, Some inequalities relating to the partial sum of binomial probabilities, Ann. Inst. Statist. Math. (Tokyo) 10 (1958), 29-35.
95. 94. C. J. Park, A note on the classical occupancy problem, Ann. Math. Statist. 43 (1972), 1698-1701.
96. 95. O. E. Percus and J. K. Percus, Probability bounds on the sum of independent nonidentically distributed binomial random variables, SIAM J. Appl. Math. 45 (1985), 621-640.
97. 96. V. V. Petrov, "Limit Theorems of Probability Theory: Sequences of Independent Random Variables," Clarendon Press, Oxford; Oxford Univ. Press, New York, 1995.
98. 97. J. Pitman, "Some Probabilistic Aspects of Set Partitions," Technical Report 452, Dept. Statistics, U.C. Berkeley, 1996; Amer. Math. Monthly, to appear.
99. 98. M. L. Platonov, "Combinatorial Numbers of a Class of Mappings and Their Applications," Nauka, Moscow, 1980. [Russian]
100. 99. S. D. Poisson, "Recherches sur la probabilité des jugements en matière criminelle et en matière civile," Bachelier, Paris, 1837.
101. 100. G. Poacute;lya and J. Schur, Über Zwei Arten von Faktorfolgen, J. Reine Angew. Math. 144 (1914), 89-133.
102. 101. G. Pólya and G. Szegö, "Problems and Theorems in Analysis II," Springer-Verlag, New York, 1976.
103. 102. M. P. Quine and J. Robinson, A Berry-Esseen bound for an occupancy problem, Ann. Probab. 10 (1982), 663-671.
104. 103. A. Rényi, Some remarks on the theory of trees, MTA Mat. Kut. Inst. Kozl. 4 (1959), 73-85.
105. 104. J. Riordan, Moment recurrence relations for the binomial Poisson and hypergeometric probability distributions, Ann. Math. Stat. 8 (1937), 103-111.
106. i/i! is asymptotically normal, Discrete Math. 49 (1984), 287-290.
107. 106. V. N. Sachkov, Random partitions of sets, Theory Probab. Appl. 19 (1973), 184-190.
108. 107. S. M. Samuels, On the number of successes in independent trials, Ann. Math. Statist. 36 (1965), 1272-1278.
109. 108. I. J. Schoenberg, On the zeros of the generating functions of multiply positive sequences and functions, Ann. Math. 62 (1955), 447-471.
110. 109. M. Shaked and J. G. Shanthikumar, Characterization of some first passage times using log-concavity and log-convexity as aging notions, Probab. Eng. Inform. Sci. 1 (1981), 279-291.
111. 110. M. Sibuya, Log-concavity of Stirling numbers and unimodality of Stirling distributions, Ann. Inst. Statist. Math. 40 (1988), 693-714.
112. 111. R. Simion, A multiindexed Sturm sequence of polynomials and unimodality of certain combinatorial sequences, J. Combin. Theory Ser. A 36 (1984), 15-22.
113. 112. E. V. Slud, Distribution inequalities for the binomial law, Ann. Probab. 5 (1977), 404-412.
114. 113. A. J. Stam, Cycles of random permutations, Ars Combin. 16 (1983), 43-48.
115. 114. A. J. Stam, Generation of a random partition of a set by an urn model, J. Combin. Theory Ser. A 35 (1983), 231-240.
116. 115. R. Stanley, Eulerian partitions of a unit hypercube, in "Higher Combinatorics" (M. Aigner, Ed.), Reidel, Dordrecht, 1977.
117. 116. R. Stanley, Log-concave and unimodal sequences in algebra, combinatorics and geometry. Ann. N. Y. Acad. Sci. 576 (1989), 500-534.
118. 117. R. Stanley, Graph colorings and related symmetric functions: Ideas and applications, preprint, Dept. Math., MIT, 1995.
119. 118. R. Stanley, A matrix for counting paths with acyclic digraphs, preprint, Dept. Math., MIT, 1995.
120. 119. J. M. Steele, Gibbs' measures on combinatorial objects and the central limit theorem for an exponential family of random trees, Probab. Eng. Inform. Sci. 1 (1987), 47-59.
121. 120. C. Stein, "Application of Newton's Identities to a Generalized Birthday Problem and to the Poisson Binomial Distribution," Technical Report 354, Dept. Statistics, Stanford University, 1990.
122. 121. V. E. Stepanov, Limit distributions of certain characteristics of random mappings, Theory Probab. Appl. 14 (1969), 612-626.
123. 122. F. W. Steutel, Log-concave and log-convex distributions, Encyclopedia Statist. Sci. 9 (1985), 247.
124. 123. G. Szekeres and F. E. Binet, On Borel fields over finite sets, Ann. Math. Stat. 28 (1957), 494-498.
125. 124. N. M. Temme. Asymptotic estimates for Stirling numbers, Stud. Appl. Math. 89 (1993), 233-243.
126. 125. E. G. Tsylova, Probabilistic methods for obtaining asymptotic formulas for generalized Stirling numbers, J. Math. Sci. 75 (1995), 1607-1614.
127. 126. W. Uhlmann, Vergleich der hypergeometrischen mit der Binomial-Verteilung, Metrika 10 (1966), 145-158.
128. 127. P. van Beek, An application of Fourier methods to the problem of sharpening the Berry-Esseen inequality, Z. Wahrsch. Verw. Gebiete 23 (1972), 187-196.
129. 128. V. A. Vatutin and V. G. Mikhailov, Limit theorems for the number of empty cells in an equiprobable scheme for group allocation of particles, Theory Probab. Appl. (Teory Verojatnost. Primenen.) 27 (1982), 734-743.
130. 129. G. Viennot, Combinatorial theory for general orthogonal polynomials with extensions and applications, in "Polynômes Orthogonaux et Applications," Lecture Notes in Math., Vol. 1171, pp. 139-157, Springer-Verlag, Berlin/New York, 1985.
131. 130. D. W. Walkup, Pólya sequences, binomial convolution and the union of random sets, J. Appl. Probab. 13 (1976), 76-85.
132. 131. H. Wilf, The asymptotic behaviour of the Stirling numbers of the first kind, J. Combin. Theory Ser. A 64 (1993), 344-349.
133. 132. S. G. You and Z. Ying, Asymptotics for a 2×2 table with fixed margins, preprint, Dept. Statistics, Rutgers Universtity, 1996.