On a balanced property of derangements

Electronic Journal of Combinatorics

Volumn 13, Issue 1 R, 2006, Pages 1-12

  Bóna, Miklós ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750927170     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1128     Document Type: Article

References (11)

1. M. Bóna, A Walk Through Combinatorics, World Scientific, second edition 2006.
2. M. Bóna, Combinatorics of Permutations, CRC Press, 2004.
3. M. Bóna, Introduction to Enumerative Combinatorics, MacGraw-Hill, 2007.
4. F. Brenti, Permutation enumeration, symmetric functions, and unimodality. Pacific J. Mathematics, 157 (1993), no. 1, 1-28.
5. F. Brenti, Combinatorics and Total positivity, J. Combin. Theory Ser. A 71 (1995), no. 2, 175-218.
6. E. R. Canfield, Asymptotic Normality in Binomial Type Enumeration, Doctoral Dissertation, University of California San Diego, 1975.
7. R. Chapman, An involution on derangements. 17th British Combinatorial Conference (Canterbury, 1999). Discrete Math. 231 (2001), no. 1-3, 121-122.
8. J. Désarmenien, M. Wachs, Descentes des dérangements et mots circulaires. Sém. Lotharing. Combin., 19, 13-21, 1984.
9. J. Désarmenien, M. Wachs, Descent classes on permutations. J. Combin. Theory A, 64 (1993), no. 2, 311-328.
10. I. Gessel, C. Reutenauer, Counting permutations with given cycle structure and descent set. J. Combin. Theory Ser. A, 64 (1993), 189-215.
11. B. D. McKay, J. Morse, H. Wilf, The distributions of the entries of Young tableaux, J. Combin. Theory Ser. A 97 (2002), no. 1, 117-128.