Related papers: $k$-Ribbon Fibonacci Tableaux
Richardson tableaux are a remarkable subfamily of standard Young tableaux introduced by Karp and Precup in order to index the irreducible components of Springer fibers equal to Richardson varieties. We show that the set of insertion…
One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…
There is a natural bijection between permutations obtainable using a stack (those avoiding the pattern 312) and permutations obtainable using a queue (those avoiding 321). This bijection is equivalent to one described by Simion and Schmidt…
An algebraic iterative formula for the spin Kostka-Foulkes polynomial $K^-_{\xi\mu}(t)$ is given using vertex operator realizations of Hall-Littlewood symmetric functions and Schur's Q-functions. Based on the operational formula, more…
Using the expansion of the inverse of the Kostka matrix in terms of tabloids as presented by Egecioglu and Remmel, we show that the fusion coefficients can be expressed as an alternating sum over cylindric tableaux. Cylindric tableaux are…
Rubik's Cube is one of the most famous combinatorial puzzles involving nearly $4.3 \times 10^{19}$ possible configurations. Its mathematical description is expressed by the Rubik's group, whose elements define how its layers rotate. We…
We propose a novel algorithm for calculating multi-baryon correlation functions on the lattice. By considering the permutation of quarks (Wick contractions) and color/spinor contractions simultaneously, we construct a unified index list for…
The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the…
In earlier work with C.~Monical, we introduced the notion of a K-crystal, with applications to K-theoretic Schubert calculus and the study of Lascoux polynomials. We conjectured that such a K-crystal structure existed on the set of…
Let $P$ be a $k$-colored set of $n$ points in the plane, $4 \leq k \leq n$. We study the problem of deciding if $P$ contains a subset of four points of different colors such that its Rectilinear Convex Hull has positive area. We show this…
The Dumont differential system on the Jacobi elliptic functions was introduced by Dumont (Math Comp, 1979, 33: 1293--1297) and was extensively studied by Dumont, Viennot, Flajolet and so on. In this paper, we first present a labeling scheme…
We introduce a lifting of West's stack-sorting map $s$ to partition diagrams, which are combinatorial objects indexing bases of partition algebras. Our lifting $\mathscr{S}$ of $s$ is such that $\mathscr{S}$ behaves in the same way as $s$…
q-Supernomial coefficients are generalizations of the q-binomial coefficients. They can be defined as the coefficients of the Hall-Littlewood symmetric function in a product of the complete symmetric functions or the elementary symmetric…
We study signed differential posets, a signed version of differential posets. These posets satisfy enumerative identities which are signed analogues of those satisfied by differential posets. Our main motivations are the sign-imbalance…
The numbers $f_\lambda$ of standard tableaux of shape $\lambda\vdash n$ satisfy 2 fundamental recursions: $f_\lambda = \sum f_{\lambda^-}$ and $(n + 1)f_\lambda=\sum f_{\lambda^+}$, where $\lambda^-$ and $\lambda^+$ run over all shapes…
We prove K-theoretic and shifted K-theoretic analogues of the bijection of Stanton and White between domino tableaux and pairs of semistandard tableaux. As a result, we obtain product formulas for pairs of stable Grothendieck polynomials…
Patience Sorting is a combinatorial algorithm that can be viewed as an iterated, non-recursive form of the Schensted Insertion Algorithm. In recent work the authors have shown that Patience Sorting provides an algorithmic description for…
This paper establishes an analogue of the Robinson--Schensted correspondence for cylindric tableaux. In particular, for any pair of positive integers $(d,L)$, we construct a bijection between permutations that avoid the patterns $d\cdots 1…
We present a combinatorial model, called \emph{perforated tableaux}, to study $A_{n-1}$ crystals, unifying several previously studied combinatorial models. We identify nodes in the $k$-fold tensor product of the standard crystal with length…
This article studies some new insertion algorithms that associate pairs of shifted tableaux to finite integer sequences in which certain terms may be primed. When primes are ignored in the input word these algorithms reduce to known…