Related papers: Rhombic alternative tableaux and assembl\'ees of p…
We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a…
Alternating sign matrices (ASMs) are square matrices with entries 0, 1, or -1 whose rows and columns sum to 1 and whose nonzero entries alternate in sign. We present a unifying perspective on ASMs and other combinatorial objects by studying…
We introduce an algebra of elliptic commuting variables involving a base $q$, nome $p$, and $2r$ noncommuting variables. This algebra, which for $r=1$ reduces to an algebra considered earlier by the author, is an elliptic extension of the…
We define a new disordered asymmetric simple exclusion process (ASEP) with two species of particles, first-class particles labelled $\bullet$ and second-class particles labelled ${\scriptstyle \Box}$, on a two-dimensional toroidal lattice.…
We present a determinantal formula for the steady state probability of each state of the TASEP (Totally Asymmetric Simple Exclusion Process) with open boundaries, a 1D particle model that has been studied extensively and displays rich…
The asymmetric simple exclusion process (ASEP) is a model for translation in protein synthesis and traffic flow; it can be defined as a Markov chain describing particles hopping on a one-dimensional lattice. In this article I give an…
In this article we give a combinatorial formula for a certain class of Koornwinder polynomials, also known as Macdonald polynomials of type $\tilde{C}$. In particular, we give a combinatorial formula for the Koornwinder polynomials…
This is a study on pattern Hopf algebras in combinatorial structures. We introduce the notion of combinatorial presheaf, by adapting the algebraic framework of species to the study of substructures in combinatorics. Afterwards, we consider…
In combinatorial representation theory, Kostant's weight multiplicity formula $m(\lambda,\mu)$ is a tool that provides a means of determining the multiplicity of a weight $\mu$ in the adjoint representation of a simple Lie algebra…
We study the one dimensional partially asymmetric simple exclusion process (ASEP) with open boundaries, that describes a system of hard-core particles hopping stochastically on a chain coupled to reservoirs at both ends. Derrida, Evans,…
Alternating sign matrices (ASMs) are square matrices with entries 0, 1, or -1 whose rows and columns sum to 1 and whose nonzero entries alternate in sign. We put ASMs into a larger context by studying the order ideals of subposets of a…
In this paper, we define some weighted sums of the alternating multiple $T$-values (AMTVs), and study several duality formulas for them by using the tools developed in our previous papers. Then we introduce the alternating version of the…
A general lattice theoretic construction of Reading constructs Hopf subalgebras of the Malvenuto-Reutenauer Hopf algebra (MR) of permutations. The products and coproducts of these Hopf subalgebras are defined extrinsically in terms of the…
Permutation tableaux are combinatorial objects related with permutations and various statistics on them. They appeared in connection with total positivity in Grassmannians, and stationary probabilities in a PASEP model. In particular they…
Motivated by work of Buch on set-valued tableaux in relation to the K-theory of the Grassmannian, we study six combinatorial Hopf algebras. These Hopf algebras can be thought of as K-theoretic analogues of the by now classical ``square'' of…
We use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1,2,...,n}. These classes include the following: (1) both w and w^{-1} are alternating, (2) w has certain special shapes, such as…
We introduce permutrees, a unified model for permutations, binary trees, Cambrian trees and binary sequences. On the combinatorial side, we study the rotation lattices on permutrees and their lattice homomorphisms, unifying the weak order,…
In this paper the totally asymmetric exclusion process (TASEP) with parallel update on an open lattice of size $L$ is considered in the maximum-current region. A formal expression for the generating function for the weight of configurations…
The purpose of this paper is twofold. First we answer to a question asked by Steingrimsson and Williams about certain permutation tableaux: we construct a bijection between binary trees and the so-called Catalan tableaux. These tableaux are…
This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…