The inverse rook problem on Ferrers boards
msra(2004)
摘要
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 graph theory, hypergeometric series, and algebraic geometry. It is
known that the rook polynomial of any board can be computed recursively.
The naturally arising inverse question -- given a polynomial, what board (if
any) is associated with it? -- remains open. In this paper, we solve the
inverse problem completely for the class of Ferrers boards, and show that the
increasing Ferrers board constructed from a polynomial is unique.
更多查看译文
关键词
rook theory,restricted permutation.,. rook polynomial,graph theory,inverse problem,hypergeometric series,algebraic geometry
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要