James T. Joichi

Rook theory. I. Rook equivalence of Ferrers boards

We introduce a new tool, the factorial polynomials, to study rook equivalence of Ferrers boards. We provide a set of invariants for rook equivalence as well as a very simple algorithm for deciding rook equivalence of Ferrers boards. We then count the number of Ferrers boards rook equivalent to a given Ferrers board. Introduction. Let N denote the set of positive integers. A board is a finite subset of N x N. Intuitively, a board is an array of squares or cells arranged in rows and columns, i.e., a board is a subset of the set of squares of an n x n chessboard. We shall frequently utilize this intuitive terminology. We consider two boards to be the same board if one is a translate of the other, i.e., boards B and B are the same if there exist integers a and b such that B {(i + a, j + b): (i, j) € B\. Thus, only the geometric configuration or the relative positions of the cells is of significance. For a board B, \B\ denotes the number of cells in B, Let r, be the number of ways of placing k nontaking rooks (no two in the same row or column) on the board B, i.e., the number of /^-subsets of the set B such that no two elements of a ^-subset have the same first component or the same second component. When no confusion can arise we suppress the B and write r, . The rook vector of a board B is defined to be the vector r(B) = (rQ, rj, r2, . . . ) where rQ = 1. Note that from some point on all the r.s are zero, in particular r. = 0 for i > \B\. Two boards are called rook equivalent if they have the same rook vector. A board B is a Ferrers board if there exists a nondecreasing finite sequence of positive integers h j, h2, . . . , h such that B = {(i, /): i < c and j < h.\. Intuitively, a Ferrers board is a board made up of adjacent solid columns of cells with a common lower edge and such that the height of the columns from left to right forms a nondecreasing sequence. If the heights of the columns form a strictly increasing sequence, then we call the board an increasing Ferrers board. Examples of a Ferrers board and an increasing Ferrers board are given in Figures 1(a) and 1(b), respectively. Received by the editors August 21, 1974. AMS (MOS) subject classifications (1970). Primary 05A10, 05A15, 05A19.

Combinatorial Gray Codes

We consider families

Rook theory III. Rook polynomials and the chromatic structure of graphs

\{ {\bf C}(n,k):O \leqq k \leqq n\}

ROOK THEORY. II: BOARDS OF BINOMIAL TYPE

where each

Rook theory. V rook polynomials, Möbius inversion and the umbral calculus

{\bf C}(n,k)

An involution for Jacobi's identity

is a set of combinatorial objects,

More monotonicity theorems for partitions

C(n,k) = |{\bf C}(n,k)|

Hecke-Rogers, Andrews identities; combinatorial proofs

satisfies a recursion

Bijective proofs of basic hypergeometric series identities

C(n,k)= a_{n,k}C(n - 1,k - 1) + b_{n,k} C(n - 1,k)

Rook Theory—IV. Orthogonal Sequences of Rook Polynomials

, and each object in