Related papers: Combinatorics of patience sorting monoids
Lascoux polynomials generalize Grassmannian stable Grothendieck polynomials and may be viewed as K-theoretic analogs of key polynomials. The latter two polynomials have combinatorial formulas involving tableaux: Lascoux and…
We study a two-species PASEP, in which there are two types of particles, "heavy" and "light," hopping right and left on a one-dimensional lattice of $n$ cells with open boundaries. In this process, only the "heavy" particles can enter on…
The Darwin-Fowler method in combination with the steepest descent approach is a common tool in the asymptotic description of many models arising from statistical physics. In this work, we focus rather on the non-asymptotic behavior of the…
We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and height over the two-letter alphabet $\{0,1\}$. We give…
We prove that the well-known condition of being a balanced labeling can be characterized in terms of the sliding algorithm on tower diagrams. The characterization involves a generalization of authors' Rothification algorithm. Using the…
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 consider a bivariate polynomial that generalizes both the length and reflection length generating functions in a finite Coxeter group. In seeking a combinatorial description of the coefficients, we are led to the study of a new Mahonian…
We present explicit formulas for the Macdonald polynomials of types $C_n$ and $D_n$ in the one-row case. In view of the combinatorial structure, we call them "tableau formulas". For the construction of the tableau formulas, we apply some…
Let $X_1,\ldots, X_{d+2}$ be random points in $\mathbb R^d$. The classical Sylvester problem asks to determine the probability that the convex hull of these points, denoted by $P:= [X_1,\ldots, X_{d+2}]$, is a simplex. In the present paper,…
We provide a new branching rule from the general linear group $GL_{2n}(\mathbb{C})$ to the symplectic group $Sp_{2n}(\mathbb{C})$ by establishing a simple algorithm which gives rise to a bijection from the set of semistandard tableaux of a…
Kashiwara's crystal graphs have a natural monoid structure that arises by identifying words labelling vertices that appear in the same position of isomorphic components. The celebrated plactic monoid (the monoid of Young tableaux), arises…
We use a probabilistic method to produce some combinatorial inequalities by considering pattern containment in permutations and words.
Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic…
We investigate the monoid of transformations that are induced by sequences of writing to and reading from a queue storage. We describe this monoid by means of a confluent and terminating semi-Thue system and study some of its basic…
We describe new types of normal forms for braid monoids, Artin-Tits monoids, and, more generally, for all monoids in which divisibility has some convenient lattice properties (``locally Garside monoids''). We show that, in the case of…
Solving symbolic reasoning problems that require compositionality and systematicity is considered one of the key ingredients of human intelligence. However, symbolic reasoning is still a great challenge for deep learning models, which often…
Large bilingual parallel texts (also known as bitexts) are usually stored in a compressed form, and previous work has shown that they can be more efficiently compressed if the fact that the two texts are mutual translations is exploited.…
We show that the combinatorial numbers known as {\em Bell numbers} are generic in quantum physics. This is because they arise in the procedure known as {\em Normal ordering} of bosons, a procedure which is involved in the evaluation of…
This paper gives a general algorithm for computing the character table of any Renner monoid Hecke algebra, by adapting and generalizing techniques of Solomon used to study the rook monoid. The character table of the Hecke algebra of the…
Combinatorial transition matrices arise frequently in the theory of symmetric functions and their generalizations. The entries of such matrices often count signed, weighted combinatorial structures such as semistandard tableaux, rim-hook…