Related papers: Super RSK-algorithms and super plactic monoid
Timed words are words where letters of the alphabet come with time stamps. We extend the definitions of semistandard tableaux, insertion, Knuth equivalence, and the plactic monoid to the setting of timed words. Using this, Greene's theorem…
We introduce a super version of the Littlewood--Richardson rule for super Schur functions over signed alphabets. We give in particular combinatorial interpretations of the super Littlewood--Richardson coefficients using the properties of…
A new tropical plactic algebra is introduced in which the Knuth relations are inferred from the underlying semiring arithmetics, encapsulating the ubiquitous plactic monoid $\mathcal{P}_n$. This algebra manifests a natural framework for…
The Robinson-Schensted-Knuth (RSK) correspondence is a bijective correspondence between two-rowed arrays of non-negative integers and pairs of same-shape semistandard tableaux. This correspondence satisfies the symmetry property, that is,…
We present the plactic algebra on an arbitrary alphabet set $A$ by row generators and column generators respectively. We give Gr\"{o}bner-Shirshov bases for such presentations. In the case of column generators, a finite Gr\"{o}bner-Shirshov…
This paper presents a combinatorial study of the super plactic monoid of type A, which is related to the representations of the general linear Lie superalgebra. We introduce the analogue of the Sch\"{u}tzenberger's jeu de taquin on the…
We consider the parastatistics algebra with both parabosonic and parafermionic operators and show that the states in the universal parastatistics Fock space are in bijection with the Super Semistandard Young Tableaux (SSYT). Using…
We study asymptotics of random shifted Young diagrams which correspond to a given sequence of reducible projective representations of the symmetric groups. We show limit results (Law of Large Numbers and Central Limit Theorem) for their…
This paper shows that every Plactic algebra of finite rank admits a finite Gr\"obner--Shirshov basis. The result is proved by using the combinatorial properties of Young tableaux to construct a finite complete rewriting system for the…
We consider the multivariate generating series $F_P$ of $P$-partitions in infinitely many variables $x_1, x_2 , \dots$. For some family of ranked posets $P$, it is natural to consider an analog $N_P$ with two infinite alphabets. When we…
We explain how genomic tableaux [Pechenik-Yong '15] are a semistandard complement to increasing tableaux [Thomas-Yong '09]. From this perspective, one inherits genomic versions of jeu de taquin, Knuth equivalence, infusion and Bender-Knuth…
In this note we develop a systematic combinatorial definition for constructed earlier supersymmetric polynomial families. These polynomial families generalize canonical Schur, Jack and Macdonald families so that the new polynomials depend…
The parastatistics algebra is a superalgebra with (even) parafermi and (odd) parabose creation and annihilation operators. The states in the parastatistics Fock-like space are shown to be in one-to-one correspondence with the Super…
Young tableaux are combinatorial objects whose construction can be achieved from words over a finite alphabet by row or column insertion as shown by Schensted sixty years ago. Recently Abram and Reutenauer studied the action the free monoid…
Through dualities on representations on tensor powers and symmetric powers respectively, the partition algebra and multiset partition algebra have been used to study long-standing questions in the representation theory of the symmetric…
We introduce a polyadic analog of supersymmetry by considering the polyadization procedure (proposed by the author) applied to the toy model of one-dimensional supersymmetric quantum mechanics. The supercharges are generalized to polyadic…
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…
We start developing a formalism which allows to construct supersymmetric theories systematically across space-time signatures. Our construction uses a complex form of the supersymmetry algebra, which is obtained by doubling the spinor…
The Robinson-Schensted-Knuth (RSK) algorithm maps an integer matrix to a pair of semi-standard Young tableaux (SSYTs) whose underlying shape has the same integer partition. We study the set of matrices associated with a given partition…
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…