相关论文: Involutions on standard Young tableaux and divisor…
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Science, these notions allow us to give a unified view of a…
We give direct bijective proofs of the symmetry of the distributions of the number of ascents and descents over standard Young tableaux of shape $\lambda$, where $\lambda$ is a rectangle $(n,n,\dots,n)$ or a truncated staircase…
Web graphs form a family of planar directed graphs with boundary that can be used to model quantum $\mathfrak{sl}_n$-invariant vectors. Standard Young tableaux on an $n \times k$ rectangle naturally index a basis for $\mathfrak{sl}_n$ web…
We present a bijection between the set of standard Young tableaux of staircase minus rectangle shape, and the set of marked shifted standard Young tableaux of a certain shifted shape. Numerically, this result is due to DeWitt (2012).…
The pattern-avoiding fillings of Young diagrams we study arose from Postnikov's work on positive Grassman cells. They are called Le-diagrams, and are in bijection with decorated permutations. Other closely-related diagrams are interpreted…
Edelman and Greene constructed a bijection between the set of standard Young tableaux and the set of balanced Young tableaux of the same shape. Fomin, Greene, Reiner and Shimozono introduced the notion of balanced Rothe tableaux of a…
We develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in fact give three definitions of the dual: a graph-theoretic…
A fundamental identity in the representation theory of the partition algebra is $n^k = \sum_{\lambda} f^\lambda m_k^\lambda$ for $n \geq 2k$, where $\lambda$ ranges over integer partitions of $n$, $f^\lambda$ is the number of standard Young…
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…
We present an elegant bijection between standard Young tableaux with 2n cells and at most two rows, and pairs of standard Young tableaux of the same shape, with n+1 cells, where only the top row can have more than one cell.
In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…
We define an inversion statistic on standard Young tableaux. We prove that this statistic has the same distribution over SYT(\lambda) as the major index statistic by exhibiting a bijection on SYT(\lambda) in the spirit of the Foata map on…
Combinatorial spiders are a model for the invariant space of the tensor product of representations. The basic objects, webs, are certain directed planar graphs with boundary; algebraic operations on representations correspond to…
We present combinatorial bijections and identities between certain skew Young tableaux, Dyck paths, triangulations, and dissections.
This paper deals with the distribution of descent number in standard Young tableaux of certain shapes. A simple explicit formula is presented for the number of tableaux of any shape with two rows, with any specified number of descents. For…
We study various binomial and monomial ideals arising in the theory of divisors, orientations, and matroids on graphs. We use ideas from potential theory on graphs and from the theory of Delaunay decompositions for lattices to describe…
Let $\mathcal{T}_3$ be the three-rowed strip. Recently Regev conjectured that the number of standard Young tableaux with $n-3$ entries in the "skew three-rowed strip" $\mathcal{T}_3 / (2,1,0)$ is $m_{n-1}-m_{n-3}$, a difference of two…
We introduce balanced shifted tableaux, as an analogue of balanced tableaux of Edelman and Greene, from the perspective of root systems of type B and C. We show that they are equinumerous to standard Young tableaux of the corresponding…
In this paper we give a bijective proof for a relation between uni- bi- and tricellular maps of certain topological genus. While this relation can formally be obtained using Matrix-theory as a result of the Schwinger-Dyson equation, we here…
We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…