A block decomposition algorithm for computing rook polynomials
| dc.creator | Mitchell, Abigail G. | |
| dc.date | 2004-06-30 | |
| dc.date.accessioned | 2026-07-07T05:09:52Z | |
| dc.date.available | 2026-07-07T05:09:52Z | |
| dc.description | Rook polynomials are a powerful tool in the theory of restricted permutations. It is known that the rook polynomial of any board can be computed recursively, using a cell decomposition technique of Riordan. In this paper, we give a new decomposition theorem, which yields a more efficient algorithm for computing the rook polynomial. We show that, in the worst case, this block decomposition algorithm is equivalent to Riordan's method. | |
| dc.description | 7 pages | |
| dc.identifier | https://arxiv.org/abs/math/0407004 | |
| dc.identifier | http://arxiv.org/abs/math/0407004 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/71745 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A05, 05A15 (Primary) | |
| dc.title | A block decomposition algorithm for computing rook polynomials | |
| dc.type | text |