Related papers: Enumeration of standard Young tableaux of shifted …
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 study a generalization of Pell's equation, whose coefficients are certain algebraic integers. Let $X_0=0$ and $X_n=\sqrt{2+X_{n-1}}$ for each $n\in \mathbb{Z}_{\ge 1}$. We study the $\mathbb{Z}[X_{n-1}]$-solutions of the equation…
We consider sequences of the type $A_n=6A_{n-1}-A_{n-2}, A_0=r, A_1=s$ ($r$ and $s$ integers) and show that all sequences that solve particular cases of the Pell generalized equation are expressible as a constant times one of four…
We consider families $\mathcal{P}_n$ of plane lattice paths enumerated by Guy, Krattenthaler, and Sagan (1992). We show by explicit bijection that these families are equinumerous with the set $\mathrm{SYT}(n+2,2,1^n)$ of standard Young…
We study shifted standard Young tableaux (SYT). The limiting surface of uniformly random shifted SYT of staircase shape is determined, with the integers in the SYT as heights. This implies via properties of the Edelman-Greene bijection…
This paper deals with those positive integers N such that, for given integers g and k with 1< k<g, the base-g digits of N and kN appear in reverse order. Such N are called (g, k) reverse multiples. Anne Ludington Young, in 1992, developed a…
We present a bijective proof of the hook-length formula for shifted standard tableaux of a fixed shape based on a modified jeu de taquin and the ideas of the bijective proof of the hook-length formula for ordinary standard tableaux by…
Using lattice path counting arguments, we reproduce a well known formula for the number of standard Young tableaux. We also produce an interesting new formula for tableaux of height $\leq 3$ using the Fourier methods of Ault and Kicey.
In this thesis we enumerate standard young tableaux (SYT) of certain truncated skew shapes, which we call battery shapes. This is motivated by a chess problem. In an enumerative chess problem, the set of moves in the solution is (usually)…
We give alternate proofs of the classical branching rules for highest weight representations of a complex reductive group $G$ restricted to a closed regular reductive subgroup $H$, where $(G,H)$ consist of the pairs $(GL(n+1),GL(n))$, $…
Let M_n stand for the Plancherel measure on Y_n, the set of Young diagrams with n boxes. A recent result of Stanley (arXiv:0807.0383) says that for certain functions G defined on the set Y of all Young diagrams, the average of G with…
We calculate all inequivalent irreducible representations of $\S_4$ by specifying the matrices for adjacent transpositions and indicating how to obtain general permutations in $\S_4$ from these transpositions. We employ standard Young…
In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux…
We give new bounds and asymptotic estimates on the number of standard Young tableaux of skew shape in a variety of special cases. Our approach is based on Naruse's hook-length formula. We also compare our bounds with the existing bounds on…
We provide simple necessary and sufficient conditions for the existence of a standard Young tableau of a given shape and major index $r$ mod $n$, for all $r$. Our result generalizes the $r=1$ case due essentially to (1974) and proves a…
We provide an algorithmic framework for the computation of explicit representing matrices for all irreducible representations of a generalized symmetric group $\Grin_n$, i.e., a wreath product of cyclic group of order $r$ with the symmetric…
We consider two questions of Wilf related to Standard Young Tableaux. We provide a partial answer to one question, and that will lead us to a more general answer to the other question. Our answers are purely combinatorial.
In this paper, we are interested in the asymptotic size of rows and columns of a random Young diagram under a natural deformation of the Plancherel measure coming from Hecke algebras. The first lines of such diagrams are typically of order…
Canon permutations are permutations of the multiset having $k$ copies of each integer between $1$ and $n$, with the property that the subsequences obtained by taking the $j$th copy of each entry, for each fixed $j$, are all the same. For…
We derive formulae for the number of set-valued standard tableaux of two-rowed shapes, keeping track of the total number of entries, the number of entries in the first row, and the number of entries in the second row. Key in the proofs is a…