Related papers: Dyck paths with catastrophes modulo the positions …
For a given graph $G$ of minimum degree at least $k$, let $G_p$ denote the random spanning subgraph of $G$ obtained by retaining each edge independently with probability $p=p(k)$. We prove that if $p \ge \frac{\log k + \log \log k +…
The article is devoted to mappings with bounded and finite distortion of plane domains. Our investigations are devoted to the connection between mappings of the Sobolev class and upper bounds for the distortion of the modulus of families of…
In this paper, we obtain a large and moderate deviation principle for the law of the maximum of a random Dyck path. Our result extend the results of Chung, Kennedy, Kaigh and Khorunzhiy and Marckert.
We consider generalizations of Dunkl's differential-difference operators associated with groups generated by reflections. The commutativity condition is equivalent to certain functional equations. These equations are solved in many cases.…
Hypermaps were introduced as an algebraic tool for the representation of embeddings of graphs on an orientable surface. Recently a bijection was given between hypermaps and indecomposable permutations; this sheds new light on the subject by…
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to meet strict criteria. Since such graphs nevertheless seem to…
We study sums of directed paths on a hierarchical lattice where each bond has either a positive or negative sign with a probability $p$. Such path sums $J$ have been used to model interference effects by hopping electrons in the strongly…
A simple periodically driven system displaying rich behavior is introduced and studied. The system self-organizes into a mosaic of static ordered regions with three possible patterns, which are threaded by one-dimensional paths on which a…
We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…
In a graph, $k$ cycles are {\em admissible} if their lengths form an arithmetic progression with common difference one or two. Let $G$ be a 2-connected graph with minimum degree at least $k\geqslant 4$. We prove that \begin{itemize} \item…
Attempts to find a quantum-to-classical correspondence in a classically forbidden region leads to non-physical paths, involving, for example, complex time or spatial coordinates. Here, we identify genuine quasi-classical paths for tunneling…
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…
A Bicycle $(n,k)$-gon is an equilateral $n$-gon whose $k$ diagonals are of equal length. In this paper we consider periodic bicycle $(n,k)$-paths, which are a natural variation in which the polygon is replaced with a periodic polygonal…
Recently Mansour and Shattuck studied $(k,a)$-paths and gave formulas that relate the total number of humps (peaks) in all $(k,a)$-paths to the number of super $(k,a)$-paths. These results generalize earlier results of Regev on Dyck paths…
In this paper we investigate $p$-adic self-similar sets and $p$-adic self-similar measures. We show that $p$-adic self-similar sets are $p$-adic path set fractals, and that the converse is not necessarily true. For $p$-adic self-similar…
For integers $k,t \geq 2$ and $1\leq r \leq t$ let $D_k(r,t;n)$ be the number of parts among all $k$-regular partitions (i.e., partitions of $n$ where all parts have multiplicity less than $k$) of $n$ that are congruent to $r$ modulo $t$.…
The difference of actions between nearly lying unstable ``8'' and ``0'' like trajectories in two dimensions is computed by methods of chaotic dynamics. We found it to be equal to $pY\Theta/2$, where $\Theta$ is angle between paths at cross,…
In dealing with asymptotic approximation of possibly divergent nets of probability distributions, we are led to study uniform structures on the set of distributions. This paper identifies a class of such uniform structures that may be…
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is…
If a sequence indexed by nonnegative integers satisfies a linear recurrence without constant terms, one can extend the indices of the sequence to negative integers using the recurrence. Recently, Cigler and Krattenthaler showed that the…