Bijections for Faces of the Shi and Catalan Arrangements

In 1986, Shi derived the famous formula $(n+1)^{n-1}$ for the number of regions of the Shi arrangement, a hyperplane arrangement in ${R}^n$. There are at least two different bijective explanations of this formula, one by Pak and Stanley, another by Athanasiadis and Linusson. In 1996, Athanasiadis used the finite field method to derive a formula for the number of $k$-dimensional faces of the Shi arrangement for any $k$. Until now, the formula of Athanasiadis did not have a bijective explanation. In this paper, we extend a bijection for regions defined by Bernardi to obtain a bijection between the $k$-dimensional faces of the Shi arrangement for any $k$ and a set of decorated binary trees. Furthermore, we show how these trees can be converted to a simple set of functions of the form $f: [n-1] \to [n+1]$ together with a marked subset of $\text{Im}(f)$. This correspondence gives the first bijective proof of the formula of Athanasiadis. In the process, we also obtain a bijection and counting formula for the faces of the Catalan arrangement. All of our results generalize to both extended arrangements.

On Andrews’ Partitions with Parts Separated by Parity

In this paper, we present a generalization of one of the theorems in [Andrews, G.E. Partitions with parts separated by parity. Ann. Comb. 2019, 23, 241–248], and give its bijective proof. Further variations of related partition functions are studied resulting in a number of interesting identities.

A Bijective Proof of the ASM Theorem Part II: ASM Enumeration and ASM–DPP Relation

This paper is the 2nd in a series of planned papers that provide 1st bijective proofs of alternating sign matrix (ASM) results. Based on the main result from the 1st paper, we construct a bijective proof of the enumeration formula for ASMs and of the fact that ASMs are equinumerous with descending plane partitions. We are also able to refine these bijections by including the position of the unique $1$ in the top row of the matrix. Our constructions rely on signed sets and related notions. The starting point for these constructions were known “computational” proofs, but the combinatorial point of view led to several drastic modifications. We also provide computer code where all of our constructions have been implemented.

A Bijective Proof of the ASM Theorem, Part I: The Operator Formula

Alternating sign matrices are known to be equinumerous with descending plane partitions, totally symmetric self-complementary plane partitions and alternating sign triangles, but no bijective proof for any of these equivalences has been found so far. In this paper we provide the first bijective proof of the operator formula for monotone triangles, which has been the main tool for several non-combinatorial proofs of such equivalences. In this proof, signed sets and sijections (signed bijections) play a fundamental role.

A bijective proof of Macdonald's reduced word formula

International audience We describe a bijective proof of Macdonald's reduced word identity using pipe dreams and Little's bumping algorithm. The proof extends to a principal specialization of the identity due to Fomin and Stanley. Our bijective tools also allow us to address a problem posed by Fomin and Kirillov from 1997, using work of Wachs, Lenart and Serrano- Stump.

Rhombic alternative tableaux, assemblees of permutations, and the ASEP

International audience In this paper, we introduce therhombic alternative tableaux, whose weight generating functions providecombinatorial formulae to compute the steady state probabilities of the two-species ASEP. In the ASEP, there aretwo species of particles, oneheavyand onelight, on a one-dimensional finite lattice with open boundaries, and theparametersα,β, andqdescribe the hopping probabilities. The rhombic alternative tableaux are enumerated by theLah numbers, which also enumerate certainassembl ́ees of permutations. We describe a bijection between the rhombicalternative tableaux and these assembl ́ees. We also provide an insertion algorithm that gives a weight generatingfunction for the assemb ́ees. Combined, these results give a bijective proof for the weight generating function for therhombic alternative tableaux.