A generalization of Eulerian numbers via rook placements

DOI10.2140/INVOLVE.2017.10.691MaRDI QIDQ520449zbMATHOpenAlexFDO

Authors Yong-Cai Geng, Sumit K. Garg

Publication date 3 April 2017

Published in Involve (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1508.03673

zbMATH Keywords

multiplexEulerian numbersrecursionjuggling

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Abstract: We consider a generalization of Eulerian numbers which count the number of placements of $cn$ "rooks" on an $nimesn$ board 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$.

Recommendations

• Rook polynomials in three and higher dimensions
• Generalized rook polynomials
• \(m\)-rook numbers and a generalization of a formula of Frobenius to \(C_m \wr \mathcal S_n\)
• The rook numbers of Ferrers boards and the related restricted permutation numbers
• \(m\)-level rook placements

Cited in

(6)

• Rook theory, generalized {S}tirling numbers and {\((p,q)\)}-analogues
• Basic retracts and counting of lattices
• Diagonal checker-jumping and Eulerian numbers for color-signed permutations
• scientific article; zbMATH DE number 7203490 (Why is no real title available?)
• Elliptic rook and file numbers
• Rook placements and cellular decomposition of partition varieties

This page was built for publication: A generalization of Eulerian numbers via rook placements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520449)