Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0905.3081

Canopy of binary trees, Catalan tableaux and the asymmetric exclusion process

Xavier Gérard Viennot
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 certain Ferrers (or Young) diagrams filled with some 0's and 1's, satisfying a certain hook condition, and are enumerated by the Catalan numbers. They form a subclass of the permutation tableaux, enumerated by n!, introduced by Postnikov in his study of totally non negative Grassmannians and networks. Secondly we relate this new Catalan bijection with the totally asymmetric exclusion process (TASEP), a very rich and well studied 1D gas model in statistical mechanics of nonequilibrium systems. We continue some combinatorial understanding of that model, in the spirit of works by Shapiro, Zeilberger and more recently by Brak, Essam, Rechnitzer, Corteel, Williams, Duchi and Schaeffer. Emphasis is made on the non-classical notion of canopy of a binary tree, analog of the classical up-down sequence of a permutation.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xavier Gérard Viennot. 2009-05-19. Canopy of binary trees, Catalan tableaux and the asymmetric exclusion process. https://arxiv.org/abs/0905.3081

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗