Proceedings of the American Mathematical Society · 1975 · 94 citations · 5 references
Natural SciencesComputer ScienceMathematicsAlgebraAlgorithmsTheory Of ComputationAlgebraic CombinatoricsCombinatorial Number TheoryComputational AlgebraEnumerative CombinatoricsFerrers DiagramsRook Polynomial TheoryRook TheorySimple Algorithm
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.
5
<i>An Introduction to Combinatorial Analysis</i>
John Riordan, Till Teichmann · Physics Today · 1959 · 503 citations
Solomon W. Golomb, L. D. Baumert · Journal of the ACM · 1965 · 485 citations · Full text
The Number of Partitions of a Set
Gian‐Carlo Rota · American Mathematical Monthly · 1964 · 414 citations
The Number of Partitions of a Set
Gian‐Carlo Rota · American Mathematical Monthly · 1964 · 183 citations