Related papers: The structure of alternative tableaux
We show new bijective proofs of previously known formulas for the number of regions of some deformations of the braid arrangement, by means of a bijection between the no-broken-circuit sets of the corresponding integral gain graphs and some…
Propp recently introduced regions in the hexagonal grid called benzels and stated several enumerative conjectures about the tilings of benzels using two types of prototiles called stones and bones. We resolve two of his conjectures and…
The theory of unified product and extending structures for alternative and pre-alternative algebras are developed. It is proved that the extending structures of these algebras can be classified by using some non-abelian cohomology and…
We extend and generalize many of the enumerative results concerning West's stack-sorting map $s$. First, we prove a useful theorem that allows one to efficiently compute $|s^{-1}(\pi)|$ for any permutation $\pi$, answering a question of…
In this paper, we introduce the rhombic alternative tableaux, whose weight generating functions provide combinatorial formulae to compute the steady state probabilities of the two-species ASEP. In the ASEP, there are two species of…
The combinatorics of certain osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. More specifically, the paths being considered have fixed start and end points on respectively the lower and right…
Staircase tableaux are combinatorial objects which appear as key tools in the study of the PASEP physical model. The aim of this work is to show how the discovery of a tree structure in staircase tableaux is a significant feature to derive…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
This paper establishes connections between EW-tableaux and parallelogram polyominoes by using recent research regarding the sandpile model on the complete bipartite graph. This paper presents and proves a direct bijection between…
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…
In a recent series of communications we have shown that the reordering problem of bosons leads to certain combinatorial structures. These structures may be associated with a certain graphical description. In this paper, we show that there…
We give bijective results between several variants of lattice paths of length $2n$ (or $2n-2$) and integer compositions of n, all enumerated by the seemingly innocuous formula $4^{n-1}$. These associations lead us to make new connections…
We give some results about a bijection associating each permutation with a subexcedant function. This function is related to a particular decomposition of the permutation as a product of transpositions and therefore it has been called…
Recently the authors introduced lecture hall tableaux in their study of multivariate little $q$-Jacobi polynomials. In this paper, we enumerate bounded lecture hall tableaux. We show that their enumeration is closely related to standard and…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
Recently, in papers by Knutson, Tao and Woodward, Henriques and Kamnitzer, Pak and Vallejo have been constructed several interesting bijections of associativity and commutativity. In the first two papers bijections relate special sets of…
We recast the classical notion of standard tableaux in an alcove-geometric setting and extend these classical ideas to all reduced paths in our geometry. This broader path-perspective is essential for implementing the higher categorical…
In this paper we establish an order statistics model of Young tableaux. Multiple integration over nested simplexes is applied to the enumeration of Young tableaux. A brief proof of Frobenius-Young's and Aitken's formulas is given. Partially…
We introduce a shifted analogue of the ribbon tableaux defined by James and Kerber. For any positive integer $k$, we give a bijection between the $k$-ribbon fillings of a shifted shape and regular fillings of a $\lfloor k/2\rfloor$-tuple of…
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…