Related papers: Rational Dyck paths and decompositions

We consider posets of lattice paths (endowed with a natural order) and begin the study of such structures. We give an algebraic condition to recognize which ones of these posets are lattices. Next we study the class of Dyck lattices (i.e.,…

We present a simple algorithm for inverting the sweep map on rational $(m,n)$-Dyck paths for a co-prime pair $(m,n)$ of positive integers. This work is inspired by Thomas-Williams work on the modular sweep map. A simple proof of the…

Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on reasoning frameworks for path expressions where node…

Within this research, two combinatorial bijections using Young diagrams were studied. The first is a special case of a bijective correspondence between two classes of combinatorial objects. Its proof, based on Young diagrams, establishes…

We study the two statistics, the inversion number and the major index, on Catalan combinatorial objects such as $r$-Dyck paths, $r$-Stirling permutations, non-crossing partitions, Dyck tilings, and symmetric Dyck paths. We show that they…

We discuss the combinatorics of decorated Dyck paths and decorated parallelogram polyominoes, extending to the decorated case the main results of both [Haglund 2004] and [Aval et al. 2014]. This settles in particular the cases…

This paper considers the problem of invoking auxiliary, unobservable variables to facilitate the structuring of causal tree models for a given set of continuous variables. Paralleling the treatment of bi-valued variables in [Pearl 1986], we…

In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled…

We study tree-to-tree transformations that can be defined in first-order logic or monadic second-order logic. We prove a decomposition theorem, which shows that every transformation can be obtained from prime transformations, such as…

Periodic trees are combinatorial structures which are in bijection with cluster tilting objects in cluster categories of affine type $\tilde{A}_{n-1}$. The internal edges of the tree encode the $c$-vectors corresponding to the cluster…

Tree-child networks are an important class of phylogenetic network used to model reticulate evolutionary processes. These networks have attracted increasing attention from researchers with interests in both combinatorics and algorithms. A…

To any real rational function with generic ramification points we assign a combinatorial object, called a garden, which consists of a weighted labeled directed planar chord diagram and of a set of weighted rooted trees each corresponding to…

A permutation can be locally classified according to the four local types: peaks, valleys, double rises and double falls. The corresponding classification of binary increasing trees uses four different types of nodes. Flajolet demonstrated…

We study a class of observables in four-dimensional superconformal Yang--Mills theories which, in the planar limit at finite 't Hooft coupling, can be expressed as determinants of semi-infinite matrices built from Bessel functions. This…

The canonical tree-decomposition theorem, given by Robertson and Seymour in their seminal graph minors series, turns out to be one of the most important tool in structural and algorithmic graph theory. In this paper, we provide the…

In this paper we define novel topological invariants of doubly periodic tangles (DP tangles). DP tangles are embeddings of curves in the thickened plane with translational symmetries in two independent directions. We first organize the…

In this paper, we give a decomposition of triply rooted trees into three doubly rooted trees. This leads to a combinatorial interpretation of an identity conjectured by Lacasse in the study of the PAC-Bayesian machine learning theory, and…

We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…

We determine the Newton trees of the rational polynomials of simple type, thus filling a gap in the proof of the classification of these polynomials given by Neumann and Norbury.

We prove that all quiver Grassmannians for exceptional representations of a generalized Kronecker quiver admit a cell decomposition. In the process, we introduce a class of regular representations which arise as quotients of consecutive…