English
Related papers

Related papers: m-Level rook placements

200 papers

In 2006, Briggs and Remmel gave a factorization theorem for $m$-level rook placements on singleton boards, a special subset of Ferrers boards. Subsequently, Barrese, Loehr, Remmel, and Sagan defined the $m$-weighted file placements to give…

Combinatorics · Mathematics 2023-12-19 Kenneth Barrese

Suppose the rows of a board are partitioned into sets of m rows called levels. An m-level rook placement is a subset of the board where no two squares are in the same column or the same level. We construct explicit bijections to prove three…

Combinatorics · Mathematics 2015-08-26 Kenneth Barrese , Nicholas Loehr , Jeffrey Remmel , Bruce E. Sagan

Two boards are rook equivalent if they have the same number of non-attacking rook placements for any number of rooks. Define a rook equivalence graph of an equivalence set of Ferrers boards by specifying that two boards are connected by an…

Combinatorics · Mathematics 2019-01-08 Kenneth Barrese

Utilizing elliptic weights, we construct an elliptic analogue of rook numbers for Ferrers boards. Our elliptic rook numbers generalize Garsia and Remmel's q-rook numbers by two additional independent parameters a and b, and a nome p. These…

Combinatorics · Mathematics 2019-02-22 Michael J. Schlosser , Meesue Yoo

In [2] we introduced a new notion of Wilf equivalence of integer partitions and proved that rook equivalence implies Wilf equivalence. In the present paper we prove the converse and thereby establish a new criterion for rook equivalence. We…

Combinatorics · Mathematics 2018-08-14 Jonathan Bloom , Dan Saracino

An {\em $m\times n$ row-column factorial design} is an arrangement of the elements of a factorial design into a rectangular array. Such an array is used in experimental design, where the rows and columns can act as blocking factors. If for…

Statistics Theory · Mathematics 2021-01-18 Fahim Rahim , Nicholas Cavenagh

Matrices over a finite field having fixed rank and restricted support are a natural $q$-analogue of rook placements on a board. We develop this $q$-rook theory by defining a corresponding analogue of the hit numbers. Using tools from coding…

Combinatorics · Mathematics 2021-03-30 Joel Brewster Lewis , Alejandro H. Morales

A natural construction due to K. Ding yields Schubert varieties from Ferrers boards. The poset structure of the Schubert cells in these varieties is equal to the poset of maximal rook placements on the Ferrers board under the Bruhat order.…

Combinatorics · Mathematics 2007-05-23 Mike Develin

We construct elliptic extensions of the alpha-parameter rook model introduced by Goldman and Haglund and of the rook model for matchings of Haglund and Remmel. In particular, we extend the product formulas of these models to the elliptic…

Combinatorics · Mathematics 2019-02-22 Michael J. Schlosser , Meesue Yoo

In this paper we introduce $p-$Ferrer diagram, note that $1-$ Ferrer diagram are the usual Ferrer diagrams or Ferrer board, and corresponds to planar partitions. To any $p-$Ferrer diagram we associate a $p-$Ferrer ideal. We prove that…

Commutative Algebra · Mathematics 2009-09-29 Marcel Morales

Let $F_n$ denote the $n^{th}$ Fibonacci number relative to the initial conditions $F_0=0$ and $F_1=1$. Bach, Paudyal, and Remmel introduced Fibonacci analogues of the Stirling numbers called Fibo-Stirling numbers of the first and second…

Combinatorics · Mathematics 2017-01-27 Quang T. Bach , Roshil Paudyal , Jeffrey B. Remmel

Connections between $q$-rook polynomials and matrices over finite fields are exploited to derive a new statistic for Garsia and Remmel's $q$-hit polynomial. Both this new statistic $mat$ and another statistic for the $q$-hit polynomial…

Combinatorics · Mathematics 2016-09-07 James Haglund

We derive a combinatorial equilibrium for bounded juggling patterns with a random, $q$-geometric throw distribution. The dynamics are analyzed via rook placements on staircase Ferrers boards, which leads to a steady-state distribution…

Combinatorics · Mathematics 2015-03-03 Alexander Engström , Lasse Leskelä , Harri Varpanen

Successive ranks of a partition, which were introduced by Atkin, are the difference of the $i$th row and the $i$th column in the Ferrers graph. Recently, in the study of singular overpartitions, Andrews revisited successive ranks and parity…

Combinatorics · Mathematics 2017-03-23 Seunghyun Seo , Ae Ja Yee

Rook polynomials have been studied extensively since 1946, principally as a method for enumerating restricted permutations. However, they have also been shown to have many fruitful connections with other areas of mathematics, including…

Combinatorics · Mathematics 2007-05-23 Abigail G. Mitchell

We study the simplicial complex that arises from non-attacking rook placements on a subclass of Ferrers boards that have $a_i$ rows of length $i$ where $a_i>0$ and $i\leq n$ for some positive integer $n$. In particular, we will investigate…

Combinatorics · Mathematics 2012-09-27 Eric Clark , Matthew Zeckner

Rook theory has been investigated by many people since its introduction by Kaplansky and Riordan in 1946. Goldman, Joichi and White in 1975 showed that the sum over $k$ of the product of the $(n-k)$-th rook numbers multiplied by the $k$-th…

Combinatorics · Mathematics 2016-08-22 Michael J. Schlosser , Meesue Yoo

We introduce rook-Eulerian polynomials, a generalization of the classical Eulerian polynomials arising from complete rook placements on Ferrers boards, and prove that they are real-rooted. We show that a natural context in which to…

Combinatorics · Mathematics 2025-02-11 Per Alexandersson , Aryaman Jal , Maena Quemener

We explore the novel connection between rook placements on collections of cells, also known as pruned chessboards, and the algebraic properties of ideals generated by $2$-minors. We design an algorithm to compute the switching rook…

Commutative Algebra · Mathematics 2025-12-01 Francesco Navarra , Ayesha Asloob Qureshi , Giancarlo Rinaldo

We investigate the coefficients generated by expressing the falling factorial $(xy)_k$ as a linear combination of falling factorial products $(x)_l (y)_m$ for $l,m =1,...,k$. Algebraic and combinatoric properties of these coefficients are…

Combinatorics · Mathematics 2009-12-01 Brad Osgood , William Wu
‹ Prev 1 2 3 10 Next ›