Related papers: MIN-turns and MAX-turns in k-Dyck paths: a pure ge…
A modified version of the Dijkstra algorithm using an inventive contraction hierarchy is proposed. The algorithm considers a directed acyclic graph with a conical or semi-circular structure for which a pair of edges is chosen iteratively…
The well-known $q,t$-Catalan sequence has two combinatorial interpretations as weighted sums of ordinary Dyck paths: one is Haglund's area-bounce formula, and the other is Haiman's dinv-area formula. The zeta map was constructed to connect…
In this paper we study a mapping from permutations to Dyck paths. A Dyck path gives rise to a (Young) diagram and we give relationships between statistics on permutations and statistics on their corresponding diagrams. The distribution of…
In this work, we seek to simulate rare transitions between metastable states using score-based generative models. An efficient method for generating high-quality transition paths is valuable for the study of molecular systems since data is…
Motivated by independent results of Bizley and Duchon, we study rational Dyck paths and their subset of factor-free elements. On the one hand, we give a bijection between rational Dyck paths and regular Dyck paths with ascents colored by…
We consider the problem of counting subset of Dyck paths contained in a Ferrers diagram. This enumeration concerns to find the number of the elements in a branch of the Kr\'ew\'eras tree. Using the Ferrers diagrams associated with Dyck…
An upper bound on degrees of elements of a minimal generating system for invariants of quivers of dimension (2,...,2) is established over a field of arbitrary characteristic and its precision is estimated. The proof is based on the…
A Schr\"oder path is a lattice path from $(0,0)$ to $(2n,0)$ with steps $(1,1)$, $(1,-1)$ and $(2,0)$ that never goes below the $x-$axis. A small Schr\"{o}der path is a Schr\"{o}der path with no $(2,0)$ steps on the $x-$axis. In this paper,…
We study enumerations of Dyck and ballot tilings, which are tilings of a region determined by two Dyck or ballot paths. We give bijective proofs to two formulae of enumerations of Dyck tilings through Hermite histories. We show that one of…
The determination of collision-free shortest paths among growing discs has previously been studied for discs with fixed growing rates. Here, we study a more general case of this problem, where: (1) the speeds at which the discs are growing…
Two-dimensional (random) walks in cones are very natural both in combinatorics and probability theory: they are interesting for themselves and also because they are strongly related to other discrete structures. While walks restricted to…
We examine the evolution of the best choice algorithm and the probability of its success from a directed path to the linear order of the same cardinality through $k$th powers of a directed path, $1 \leq k < n$. The vertices of a $k$th power…
Recently, there has been growing interest in developing optimization methods for solving large-scale machine learning problems. Most of these problems boil down to the problem of minimizing an average of a finite set of smooth and strongly…
Motzkin excursions and meanders are revisited. This is considered in the context of forbidden patterns. Previous work by Asinowski, Banderier, Gittenberger, and Roitner is continued. Motzkin paths of bounded height are considered, leading…
A high-symmetry crystal surface may undergo a kinetic instability during the growth, such that its late stage evolution resembles a phase separation process. This parallel is rigorous in one dimension, if the conserved surface current is…
Our main contribution here is the discovery of a new family of standard Young tableaux $ {\cal T}^k_n$ which are in bijection with the family ${\cal D}_{m,n}$ of Rational Dyck paths for $m=k\times n\pm 1$ (the so called "Fuss" case). Using…
Stanley lists the class of Dyck paths where all returns to the axis are of odd length as one of the many objects enumerated by (shifted) Catalan numbers. By the standard bijection in this context, these special Dyck paths correspond to a…
We analyse some enumerative and asymptotic properties of lattice paths below a line of rational slope. We illustrate our approach with Dyck paths under a line of slope $2/5$. This answers Knuth's problem #4 from his "Flajolet lecture"…
Gessel's walks are the planar walks that move within the positive quadrant $\mathbb{Z}_{+}^{2}$ by unit steps in any of the following directions: West, North-East, East and South-West. In this paper, we find an explicit expression for the…
Recent method developments involving path integral simulations have come a long way in making these techniques practical for studying condensed phase non-equilibrium phenomena. One of the main difficulties that still needs to be surmounted…