Durfee polynomials

Electronic Journal of Combinatorics

Volumn 5, Issue 1, 1998, Pages

  Canfield, E Rodney ^a   Corteel, Sylvie ^b   Savagey, Carla D ^c  

^a University of Georgia ^*  (United States)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^c North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4243550327     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1370     Document Type: Article

References (20)

1. M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions, National Bureau of Standards, 1972.
2. M. Benoumhani, Sur une proprieté des polynômes a racines réelles négatives, J. de Math. Pures et Appliquées 75 (1996) 85-105.
3. F. Brenti, Log-concave and unimodal sequences in algebra, combinatorics, and geometry: an update, Jerusalem combinatorics '93, Contemp. Math., 178, Amer. Math. Soc., Providence, RI (1994) 71-89.
4. E. R. Canfield, From recursions to asymptotics: on Szekeres' formula for the number of partitions, Electron. J. Combin., 4(2) (1997) R6.
5. L. Comtet, Advanced Combinatorics, D. Reidel, 1974.
6. S. Corteel, Computer methods applied to two problems about integer partitions, M. S. Thesis, Department of Computer Science, North Carolina State University, 1997.
7. J. Darroch, On the distribution of the number of successes in independent trials, Ann. Math. Statist., 35 (1964) 1317-1321.
8. N. G. de Bruijn, Asymptotic Methods in Analysis, North-Holland, Amsterdam 1958; also published by Dover, 1981.
9. P. Erdös, On an elementary proof of some asymptotic formulas in the theory of partitions, Annals of Math.(2) 43 (1942) 437-450.
10. H. Gupta, The rank-vector of a partition, Fibonacci Quarterly 16, no. 6 (1978) 548-552.
11. L. H. Harper, Stirling behavior is asymptotically normal, Ann. Math. Stat. 38 (1967) 410-414.
12. Husimi, K., Partitio numerorum as occurring in a problem of nuclear physics, Proceedings of the Physico-Mathematical Society of Japan 20 (1938), 912-925.
13. Kessler, I. and Livingston, M., The expected number of parts in a partition of n, Monatshefte für Mathematik 81 (1976), 203-212.
14. J. H. Loxton, Partition identities and the dilogarithm, in Structural Properties of Polylogarithms (L. Lewin ed.), American Mathematical Society, 1991 pages 287-299.
15. S. M. Luthra, On the average number of summands in a partition of n. Proceedings of the National Institute of Sciences of India, part A: physical sciences, 23 (1957) 483-498.
16. J. M. Nolan, C. D. Savage, and H. S. Wilf, Basis partitions, Discrete Math., to appear.
17. J. Pitman, Probabilistic bounds on the coefficients of polynomials with only real zeros, J. Combin. Theory Ser. A 77 (1997), no. 2, 279-303.
18. B. Richmond and G. Szekeres, Some formulas related to dilogarithms, the zeta function, and the Andrews-Gordon identities, J. Austr. Math. Soc. 31 (1981) 362-373.
19. R. Stanley, Log-concave and unimodal sequences in algebra, combinatorics, and geometry, Graph theory and its applications: East and West (Jinan, 1986), Ann. New York Acad. Sci., 576 (1989) 500-535.
20. G. Szekeres, Some asymptotic formulae in the theory of partitions (II), Quart. J. of Math. (Oxford) (2) 4 (1953) 96-111.