7 citations · 14 across the 7 of their papers we have counts for
6 papers · 1 filter
An insertion algorithm over staircase tableaux compatible with the ASEP's matrix ansatz
Patxi Laborde-Zubieta
Based on the matrix ansatz of Derrida, Evans, Hakim and Pasquier, we prensent a new way of computing the stationary probability of a state of the asym- metric simple exclusion proc…
Generating series of Periodic Parallelogram polyominoes
Jean Christophe Aval, Adrien Boussicault, Patxi Laborde-Zubieta +1
The aim of this work is the study of the class of periodic parallelogram polyominoes, and two of its variantes. These objets are related to 321-avoiding affine permutations. We fir…
Periodic Parallelogram Polyominoes
Adrien Boussicault, Patxi Laborde-Zubieta
A periodic parallelogram polyomino is a parallelogram polyomino such that we glue the first and the last column. In this work we extend a bijection between ordered trees and parall…
Non-ambiguous trees: new results and generalisation
Jean-Christophe Aval, Adrien Boussicault, Berenice Delcroix-Oger +2
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield…
Enumeration of Corners in Tree-like Tableaux
Alice L. L. Gao, Emily X. L. Gao, Patxi Laborde-Zubieta +1
In this paper, we confirm conjectures of Laborde-Zubieta on the enumeration of corners in tree-like tableaux and in symmetric tree-like tableaux. In the process, we also enumerate…
Enumeration of Corners in Tree-like Tableaux and a Conjectural (a,b)-analogue
Alice L. L. Gao, Emily X. L. Gao, Patxi Laborde-Zubieta +1
In this paper, we confirm a conjecture of Laborde-Zubieta on the enumeration of corners in tree-like tableaux. Our proof is based on Aval, Boussicault and Nadeau's bijection betwee…