Related papers: Pattern distributions in Dyck paths with a first r…
In this paper, we introduce a generalization of a class of tilings which appear in the literature: the tilings over which a height function can be defined (for example, the famous tilings of polyominoes with dominoes). We show that many…
Dyck paths (also balanced brackets and Dyck words) are among the most heavily studied Catalan families. This paper is a continuation of [2, 3, 4]. In the paper we are dealing with the numbering of Dyck paths, with the resulting numbers, the…
We introduce a method to exactly generate bridge trajectories for discrete-time random walks, with arbitrary jump distributions, that are constrained to initially start at the origin and return to the origin after a fixed time. The method…
As a first step in the first passage problem for passive tracer in stratified porous media, we consider the case of a two-dimensional system consisting of two layers with different convection velocities. Using a lattice generating function…
Diffusion models form an important class of generative models today, accounting for much of the state of the art in cutting edge AI research. While numerous extensions beyond image and video generation exist, few of such approaches address…
The properties of a particle diffusing on a one-dimensional lattice where at each site a random barrier and a random trap act simultaneously on the particle are investigated by numerical and analytical techniques. The combined effect of…
Prime path coverage is a powerful structural testing criterion, but generating all prime paths in a directed graph remains computationally challenging due to the potentially exponential number of them. Existing approaches typically rely on…
A variation of Dyck paths allows for down-steps of arbitrary length, not just one. This is motivated by ideas published by Emeric Deutsch around the turn of the millenium. We are interested in the subclass of them where the sequence of the…
The study of first passage times for diffusing particles reaching target states is foundational in various practical applications, including diffusion-controlled reactions. In this work, we present a bi-scaling theory for the probability…
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…
We present a new bijection between variants of $m$-Dyck paths (paths with steps in $\{+1,-m\}$ starting and ending at height $0$ and remaining at non-negative height), which generalizes a classical bijection between Dyck prefixes and…
The standard setup for single-file diffusion is diffusing particles in one dimension which cannot overtake each other, where the dynamics of a tracer (tagged) particle is of main interest. In this article we generalise this system and…
We study the distribution of maximal-chain lengths between two elements of a causal set and its relationship with the embeddability of the causal set in a region of flat spacetime. We start with causal sets obtained from uniformly…
It is proven that the connected pathwidth of any graph $G$ is at most $2\cdot\pw(G)+1$, where $\pw(G)$ is the pathwidth of $G$. The method is constructive, i.e. it yields an efficient algorithm that for a given path decomposition of width…
Given a permutation w, we look at the range of how often a simple reflection s_k appears in reduced decompositions of w. We compute the minimum and give a sharp upper bound on the maximum. That bound is in terms of 321- and 3412-patterns in…
We present an extension of a theorem by Michael Drmota and Mich\`ele Soria [Images and Preimages in Random Mappings, 1997] that can be used to identify the limiting distribution for a class of combinatorial schemata. This is achieved by…
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…
We consider the problem of finding a Hamiltonian path or a Hamiltonian cycle with precedence constraints in the form of a partial order on the vertex set. We show that the path problem is $\mathsf{NP}$-complete for graphs of pathwidth 4…
We propose Range and Roots which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for these two patterns. Counting and occurrence constraints…
Functional networks of complex systems are obtained from the analysis of the temporal activity of their components, and are often used to infer their unknown underlying connectivity. We obtain the equations relating topology and function in…