Related papers: Counting Descents in Standard Young Tableaux
We consider a few special cases of the more general question: How many permutations $\pi\in\mathcal{S}_n$ have the property that $\pi^2$ has $j$ descents for some $j$? In this paper, we first enumerate Grassmannian permutations $\pi$ by the…
We deduce decompositions of natural representations of general linear groups and symmetric groups from combinatorial bijections involving tableaux. These include some of Howe's dualities, Gelfand models, the Schur-Weyl decomposition of…
Standard tableaux of skew shape are fundamental objects in enumerative and algebraic combinatorics and no product formula for the number is known. In 2014, Naruse gave a formula (NHLF) as a positive sum over excited diagrams of products of…
Three-dimensional random tessellations that are stable under iteration (STIT tessellations) are considered. They arise as a result of subsequent cell division, which implies that their cells are not face-to-face. The edges of the…
In this article, we investigate the convergence behavior of two classes of gathering protocols with fixed circulant topologies using tools from dynamical systems. Given a fixed number of mobile entities moving in the Euclidean plane, we…
Lusztig's fake degree is the generating polynomial for the major index of standard Young tableaux of a given shape. Results of Springer and James & Kerber imply that, mysteriously, its evaluation at a $k$-th primitive root of unity yields…
We derive a formula for the entries in the change-of-basis matrix between Young's seminormal and natural representations of the symmetric group. These entries are determined as sums over weighted paths in the weak Bruhat graph on standard…
Double circulant matrices are introduced and studied. A formula to compute the rank r of a double circulant matrix is exhibited; and it is shown that any consecutive r rows of the double circulant matrix are linearly independent. As a…
We survey here the construction and the basic properties of descendent invariants in the theory of stable pairs on nonsingular projective 3-folds. The main topics covered are the rationality of the generating series, the functional…
The Naruse hook-length formula is a recent general formula for the number of standard Young tableaux of skew shapes, given as a positive sum over excited diagrams of products of hook-lengths. In 2015 we gave two different $q$-analogues of…
We prove that in every cover of a Young diagram with $\binom{2k}{k}$ steps with generalized rectangles there is a row or a column in the diagram that is used by at least $k+1$ rectangles. We show that this is best-possible by partitioning…
Multi-way tables with specified marginals arise in a variety of applications in statistics and operations research. We provide a comprehensive complexity classification of three fundamental computational problems on tables: existence,…
The Young--Fibonacci graph is the Hasse diagram of one of the two (along with the Young lattice) 1-differential graded modular lattices. This explains the interest to path enumeration problems in this graph. We obtain a formula for the…
A leaf of a plane tree is called an old leaf if it is the leftmost child of its parent, and it is called a young leaf otherwise. In this paper we enumerate plane trees with a given number of old leaves and young leaves. The formula is…
We study the problem of transforming a multi-way contingency table into an equivalent table with uniform margins and same dependence structure. Such a problem relates to recent developments in copula modeling for discrete random vectors.…
We study linear series on a general curve of genus g, whose images are exceptional with respect to their secant planes. Each such exceptional secant plane is algebraically encoded by an included linear series, whose number of base points…
We present, to the best of the authors' knowledge, all known results for the (planar) crossing numbers of specific graphs and graph families. The results are separated into various categories; specifically, results for general graph…
Lascoux and Sch\"utzenberger introduced a notion of key associated to any Young tableau. More recently Lascoux defined the key of an alternating sign matrix by recursively removing all -1's in such matrices. But alternating sign matrices…
We present a tableau calculus for reasoning in fragments of natural language. We focus on the problem of pronoun resolution and the way in which it complicates automated theorem proving for natural language processing. A method for…
Given a partition $\lambda$ of a number $k$, it is known that by adding a long line of length $n-k$, the dimension of the associated representation of $S_{n}$ is an integer-valued polynomial of degree $k$ in $n$. We show that its expansion…