Related papers: TASEP and Planar Binary Trees: A Combinatorial App…
In the paper, we focus on the connectedness of planar self-affine sets $T(A,{\mathcal{D}})$ generated by an integer expanding matrix $A$ with $|\det (A)|=3$ and a collinear digit set ${\mathcal{D}}=\{0,1,b\}v$, where $b>1$ and $v\in…
This paper studies the convex isotonic regression with generalized order restrictions induced by a directed tree. The proposed model covers various intriguing optimization problems with shape or order restrictions, including the generalized…
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 yields a new formula for the number of NATs. We also obtain…
Tree-like tableaux are objects in bijection with alternative or permutation tableaux. They have been the subject of a fruitful combinatorial study for the past few years. In the present work, we define and study a new subclass of tree-like…
We identify the algorithm for constructing steady states of the $n$-species totally asymmetric simple exclusion process (TASEP) on $L$ site periodic chain by Ferrari and Martin with a composition of combinatorial $R$ for the quantum affine…
Lattice paths effectively model phenomena in chemistry, physics and probability theory. Asymptotic enumeration of lattice paths is linked with entropy in the physical systems being modeled. Lattice paths restricted to different regions of…
We develop a modified version of the totally asymmetric simple exclusion process (TASEP) and use it to reproduce flow on an escalator with two distinct lanes of pedestrian traffic. The model is used to compare strategies with two standing…
We show that the set of balanced binary trees is closed by interval in the Tamari lattice. We establish that the intervals [T, T'] where T and T' are balanced binary trees are isomorphic as posets to a hypercube. We introduce synchronous…
The Hadamard state condition is used to analyze the local constraints on the two-point function of a quantum field conformally coupled to a background geometry. Using these constraints we develop a scalar tensor theory which controls the…
The totally asymmetric simple exclusion process (TASEP) is a stochastic model for the unidirectional dynamics of interacting particles on a $1$D-lattice that is much used in systems biology and statistical physics. Its master equation…
We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…
Some combinatorial properties of fixed boundary rhombus random tilings with octagonal symmetry are studied. A geometrical analysis of their configuration space is given as well as a description in terms of discrete dynamical systems, thus…
We study the position of the computable setting in the "common theory of locality" developed in arXiv:2106.02066 and arXiv:2204.09329 for local problems on $\Delta$-regular trees, $\Delta \in \omega$. We show that such a problem admits a…
In many learning tasks, structural models usually lead to better interpretability and higher generalization performance. In recent years, however, the simple structural models such as lasso are frequently proved to be insufficient.…
We introduce a new one-person game similar to the Sudoku game. It is based on combinatorial objects called planar binary rooted trees. It is related to the four color conjecture. Its mathematical analysis makes use of the Tamari poset,…
Given a set $P$ of $n$ red and blue points in the plane, a \emph{planar bichromatic spanning tree} of $P$ is a spanning tree of $P$, such that each edge connects between a red and a blue point, and no two edges intersect. In the bottleneck…
Simple cardinality refers to counting nonzero elements of an independent variable satisfying certain properties. Composite cardinality is a simple counting process composited with an affine mapping, and is therefore more complicated than…
In this paper, we study tree--like tableaux and some of their probabilistic properties. Tree--like tableaux are in bijection with other combinatorial structures, including permutation tableaux, and have a connection to the partially…
This is a new version of the paper, which uses the same methods as in the previous version, but the model is now different. We study two complex scalar fields coupled through a quadratic interaction in 2+1 dimensions. We use the method of…
The partially asymmetric exclusion process (PASEP) is an important model from statistical mechanics which describes a system of interacting particles hopping left and right on a one-dimensional lattice of $n$ sites. It is partially…