Related papers: Counting generalized Schr\"oder paths
We evaluate four families of determinants of matrices, where the entries are sums or differences of generating functions for paths consisting of up-steps, down-steps and level steps. By specialisation, these determinant evaluations have…
We give a combinatorial interpretation of vector continued fractions obtained by applying the Jacobi-Perron algorithm to a vector of $p\geq 1$ resolvent functions of a banded Hessenberg operator of order $p+1$. The interpretation consists…
Osculating paths are sets of directed lattice paths which are not allowed to cross each other or have common edges, but are allowed to have common vertices. In this work we derive a constant term formula for the number of such lattice paths…
A path with three blocks $P(k,l,r)$ is an oriented path formed by $k$-forward arcs followed by $l$-backward arcs then $r$-forward arcs. We prove that any $(2k+1)$-chromatic digraph contains a path $P(1,k,1)$. However the existence of…
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…
Some problems founds in teaching physics related to curved paths that are unfortunately only described as illustration. A simple way to introduce the path is presented, which can help students to test their concept numerically. The…
A path P(k,l,r) is an oriented path consisting of k forward arcs, followed by l backward arcs, and then by r forward arcs. We prove the existence of any oriented path of length n-1 with three blocks having the middle block of length one in…
A family of plane oriented continuous paths depending on a fixed real positive number $R$ is considered. For any point $x$ on the path, the previous points lie out of any circle of radius $R$ having at $x$ interior normal in a suitable…
We give a randomized algorithm that determines if a given graph has a simple path of length at least k in O(2^k poly(n,k)) time.
We consider the length of {\em ordered loose paths} in the random $r$-uniform hypergraph $H=H^{(r)}(n, p)$. A ordered loose path is a sequence of edges $E_1,E_2,\ldots,E_\ell$ where $\max\{j\in E_i\}=\min\{j\in E_{i+1}\}$ for $1\leq…
Let $G$ be a $k$-connected graph with $k\geq 2$. In this paper we first prove that: For two distinct vertices $x$ and $z$ in $G$, it contains a path passing through its any $k-2$ {specified} vertices with length at least the average degree…
We provide generating functions for the popularity and the distribution of patterns of length at most three over the set of Dyck paths having a first return decomposition constrained by height.
An induced path factor of a graph $G$ is a set of induced paths in $G$ with the property that every vertex of $G$ is in exactly one of the paths. The induced path number $\rho(G)$ of $G$ is the minimum number of paths in an induced path…
We enumerate the number of monotonic lattice paths starting at $(0,0)$ and terminating at $(m,n)$ in which $l$ of the first $k$ steps lie below the line $y=x\ (0\leq k\leq m\leq n)$. These closed formulas consist of terms which are a…
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…
In this thesis we develop generalized versions of the Chung-Feller theorem for lattice paths constrained in the half plane. The beautiful cycle method which was developed by Devoretzky and Motzkin as a means to prove the ballot problem is…
Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…
Path generation, the process of converting high-level mission specifications, such as sequences of waypoints from a path planner, into smooth, executable paths, is a fundamental challenge in mobile robotics. Most path following and…
Dispersed Dyck paths are Dyck paths, with possible flat steps on level 0. We revisit and augment questions about them from the Encyclopedia of Integer Sequences, in a systematic way that uses generating functions and the kernel method.
In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not…