A generalization of Eulerian numbers via rook placements

DOI10.2140/INVOLVE.2017.10.691zbMATH Open1359.05007arXiv1508.03673OpenAlexW3101815594MaRDI QIDQ520449FDOQ520449

Yong-Cai Geng, Sumit K. Garg

Publication date: 3 April 2017

Published in: Involve (Search for Journal in Brave)

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$.

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

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

zbMATH Keywords

multiplexEulerian numbersrecursionjuggling

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Cited In (6)

• Rook theory, generalized {S}tirling numbers and {\((p,q)\)}-analogues
• Rook placements and cellular decomposition of partition varieties
• Diagonal checker-jumping and Eulerian numbers for color-signed permutations
• Title not available (Why is that?)
• Elliptic rook and file numbers
• Title not available (Why is that?)

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)