Banaian, Esther; Butler, Steve; Cox, Christopher; Davis, Jeffrey; Landgraf, Jacob; Ponce, Scarlitte A generalization of Eulerian numbers via rook placements. (English) Zbl 1359.05007 Involve 10, No. 4, 691-705 (2017). Summary: We consider a generalization of Eulerian numbers which count the number of placements of \(cn\) rooks on an \(n\times n\) chessboard where there are exactly \(c\) rooks in each row and each column, and exactly \(k\) rooks below the main diagonal. The standard Eulerian numbers correspond to the case \(c=1\). We show that for any \(c\) the resulting numbers are symmetric and give generating functions of these numbers for small values of \(k\). Cited in 1 Document MSC: 05A15 Exact enumeration problems, generating functions Keywords:Eulerian numbers; juggling; recursion; multiplex PDFBibTeX XMLCite \textit{E. Banaian} et al., Involve 10, No. 4, 691--705 (2017; Zbl 1359.05007) Full Text: DOI arXiv Euclid