Related papers: TASEP and Planar Binary Trees: A Combinatorial App…
The Catalan triangle, as well as a Fuss-Catalan triangle, enter a problem of counting particular tied arc diagrams. This setting allows us to prove some combinatorial properties of these triangles.
We characterise the bracketing identities satisfied by linear quasigroups with the help of certain equivalence relations on binary trees that are based on the left and right depths of the leaves modulo some integers. The numbers of…
We present a bijection from planar reduced trees to planar rooted hypertrees, which extends Knuth's rotation correspondence between planar binary trees and planar rooted trees. The operadic counterpart of the new bijection is explained.…
We study the combinatorics of the change of basis of three representations of the stationary state algebra of the two parameter simple asymmetric exclusion process. Each of the representations considered correspond to a different set of…
Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. A particular focus of research has been the…
We count the number of closed walks on a vertex in a regular tree using the Catalan's triangle and also the Borel's triangle, showing another combinatorial structure counted by these two array of numbers.
The dual of a map is a fundamental construction on combinatorial maps, but many other combinatorial objects also possess their notion of duality. For instance, the Tamari lattice is isomorphic to its order dual, which induces an involution…
Ge, Rusjan, and Zweifel (J. Stat. Phys. 59, 1265 (1990)) introduced a binary tree which represents all the periodic windows in the chaotic regime of iterated one-dimensional unimodal maps. We consider the scaling behavior in a modified tree…
We define a combinatorial object that can be associated with any conic-line arrangement with ordinary singularities, which we call the combinatorial Poincar\'e polynomial. We prove a Terao-type factorization statement on the splitting of…
We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…
The Totally Asymmetric Simple Exclusion Process (TASEP) is a non-equilibrium particle model on a finite one-dimensional lattice with open boundaries. In our earlier paper, we obtained a determinantal formula that computes the steady state…
We summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared…
In this paper, we exploit the combinatorics and geometry of triangulations of products of simplices to derive new results in the context of Catalan combinatorics of $\nu$-Tamari lattices. In our framework, the main role of "Catalan objects"…
The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize beta-description trees to cyclicly Gray code three classes of…
We introduce an inductively defined sequence of directed graphs and prove that the number of edges added at step $k$ is equal to the $k$th Catalan number. Furthermore, we establish an isomorphism between the set of edges adjoined at step…
We propose a simple graphical approach to steady state solutions of the cable equation for a general model of dendritic tree with tapering. A simple case of transient solutions is also briefly discussed.
The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…
Motivated by a computer experiment for the design of a rocket booster, this paper explores nonstationary modeling methodologies that couple stationary Gaussian processes with treed partitioning. Partitioning is a simple but effective method…
The inhomogeneous two-species TASEP on a ring is an exclusion process that describes particles of different species hopping clockwise on a ring with parameters giving the hopping rates for different species. We introduce a combinatorial…
A Catalan pair is a pair of binary relations (S,R) satisfying certain axioms. These objects are enumerated by the well-known Catalan numbers, and have been introduced with the aim of giving a common language to most of the structures…