Related papers: Pattern distributions in Dyck paths with a first r…
We introduce and study cover-inclusive and cover-exclusive Dyck tilings of type $D$. It is shown that the generating functions of Dyck tilings of type $D$ are expressed in terms of the generating function of ballot tilings of type $B$. We…
By using the matrix formulation of the two-step approach to distributions of patterns in random sequences, recurrence and explicit formulas for the generating functions of successions in random permutations of arbitrary multisets are…
A model for diffusion on a cubic lattice with a random distribution of traps is developed. The traps are redistributed at certain time intervals. Such models are useful for describing systems showing dynamic disorder, such as ion-conducting…
In a Dyck path a peak which is (weakly) higher than all the preceding peaks is called a strict (weak) left to right maximum. We obtain explicit generating functions for both weak and strict left to right maxima in Dyck paths. The proofs of…
We compute the joint distribution of the first times a linear diffusion makes an excursion longer than some given duration above (resp. below) some fixed level. In the literature, such stopping times have been introduced and studied in the…
Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev polynomials of the first or second kind,…
The path decomposition expansion is a path integral technique for decomposing sums over paths in configuration space into sums over paths in different spatial regions. It leads to a decomposition of the configuration space propagator across…
We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result extends well known enumerative formulae concerning lattice paths, and its derivation involves a classical…
A $d$-dimensional random array on a nonempty set $I$ is a stochastic process $\boldsymbol{X}=\langle X_s:s\in \binom{I}{d}\rangle$ indexed by the set $\binom{I}{d}$ of all $d$-element subsets of $I$. We obtain structural decompositions of…
Divide-and-conquer functions satisfy equations in F(z),F(z^2),F(z^4)... Their generated sequences are mainly used in computer science, and they were analyzed pragmatically, that is, now and then a sequence was picked out for scrutiny. By…
We demonstrate propagation rules of subsystem code constructions by extending, shortening and combining given subsystem codes. Given an $[[n,k,r,d]]_q$ subsystem code, we drive new subsystem codes with parameters $[[n+1,k,r,\geq d]]_q$,…
A class of cubic networks composed of a regular one-dimensional lattice and a set of long-range links is introduced. Networks parametrized by a positive integer k are constructed by starting from a one-dimensional lattice and iteratively…
We present classes of models in which particles are dropped on an arbitrary fixed finite connected graph, obeying adhesion rules with screening. We prove that there is an invariant distribution for the resulting height profile, and Gaussian…
We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one…
Pattern forming systems allow for a wealth of states, where wavelengths and orientation of patterns varies and defects disrupt patches of monocrystalline regions. Growth of patterns has long been recognized as a strong selection mechanism.…
We present three bijections, the first between little Schr\"{o}der paths and a class of growth-constrained integer sequences, the second between lattice paths consisting of steps with nonnegative slope and another class of…
We consider paths in the plane with $(1,0),$ $(0,1),$ and $(a,b)$-steps that start at the origin, end at height $n,$ and stay to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at…
We present nine bijections between classes of Dyck paths and classes of standard Young tableaux (SYT). In particular, we consider SYT of flag and rectangular shapes, we give Dyck path descriptions for certain SYT of height at most 3, and we…
We obtain the first near-linear time deterministic algorithm for negative-weight single-source shortest paths on integer-weighted graphs. Our main ingredient is a deterministic construction of a padded decomposition on directed graphs,…
We study first-passage percolation through related optimization problems over paths of restricted length. The path length variable is in duality with a shift of the weights. This puts into a convex duality framework old observations about…