相关论文: The inverse rook problem on Ferrers boards

In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe…

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…

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.…

The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…

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…

The inverse problem of Galois Theory was developed in the early 1800 s as an approach to understand polynomials and their roots. The inverse Galois problem states whether any finite group can be realized as a Galois group over Q (field of…

This paper studies increasing trees on $n$ labeled vertices, in which labels increase from the root to the leaves. It is known that the number of binary increasing trees coincides with the number of alternating permutations (Euler numbers).…

The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

The rook polynomial is a generating function that enumerates the number of ways to place rooks, with no two in the same row or column, on a collection of cells regarded as a pruned chessboard. In combinatorial commutative algebra, special…

The Heisenberg-Weyl algebra, which underlies virtually all physical representations of Quantum Theory, is considered from the combinatorial point of view. We provide a concrete model of the algebra in terms of paths on a lattice with some…

We study the row-space partition and the pivot partition on the matrix space $\mathbb{F}_q^{n \times m}$. We show that both these partitions are reflexive and that the row-space partition is self-dual. Moreover, using various combinatorial…

We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks…

A canonical system is a kind of first-order system of ordinary differential equations on an interval of the real line parametrized by complex numbers. It is known that any solution of a canonical system generates an entire function of the…

The rook graph is a graph whose edges represent all the possible legal moves of the rook chess piece on a chessboard. The problem we consider is the following. Given any set $M$ containing pairs of cells such that each cell of the $m_1…

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

Pancake flipping, a famous open problem in computer science, can be formalised as the problem of sorting a permutation of positive integers using as few prefix reversals as possible. In that context, a prefix reversal of length k reverses…

We study the inverse problem in the theory of (standard) orthogonal polynomials involving two polynomials families $(P_n)_n$ and $(Q_n)_n$ which are connected by a linear algebraic structure such as $$P_n(x)+\sum_{i=1}^N…

Suppose that some harmonic analysis arguments have been invoked to show that the indicator function of a set of residue classes modulo some integer has a large Fourier coefficient. To get information about the structure of the set of…

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…