Related papers: An efficient search algorithm for inverting the sw…
We present a simple algorithm for inverting the sweep map on rational $(m,n)$-Dyck paths for a co-prime pair $(m,n)$ of positive integers. This work is inspired by Thomas-Williams work on the modular sweep map. A simple proof of the…
We show that our algorithm for inverting the sweep map on (2n, n)-Dyck paths works for any (kn, n)-Dyck path, where k is an arbitrary positive integer.
Building upon the foundational work of Thomas and Williams on the modular sweep map, Garsia and Xin have developed a straightforward algorithm for the inversion of the sweep map on rational $(m,n)$-Dyck paths, where $(m,n)$ represents…
We introduce a simple, rank-based algorithm for inverting the sweep map on (2n,n)-Dyck paths.
Garsia and Xin gave a linear algorithm for inverting the sweep map for Fuss rational Dyck paths in $D_{m,n}$ where $m=kn\pm 1$. They introduced an intermediate family $\mathcal{T}_n^k$ of certain standard Young tableau. Then inverting the…
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…
For integers $n, m$ with $n \geq 1$ and $0 \leq m \leq n$, an $(n,m)$-Dyck path is a lattice path in the integer lattice $\mathbb{Z} \times \mathbb{Z}$ using up steps $(0,1)$ and down steps $(1,0)$ that goes from the origin $(0,0)$ to the…
An $(a,b)$-Dyck path $P$ is a lattice path from $(0,0)$ to $(b,a)$ that stays above the line $y=\frac{a}{b}x$. The zeta map is a curious rule that maps the set of $(a,b)$-Dyck paths into itself; it is conjecturally bijective, and we provide…
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…
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 problem of space-efficient depth-first search (DFS) is reconsidered. A particularly simple and fast algorithm is presented that, on a directed or undirected input graph $G=(V,E)$ with $n$ vertices and $m$ edges, carries out a DFS in…
Using techniques introduced by H. Thomas and N. Williams in "Cyclic Symmetry of the Scaled Simplex," we prove that modular sweep maps are bijective. We construct the inverse of the modular sweep map by passing through an intermediary set of…
We study the relationship between rational slope Dyck paths and invariant subsets of $\mathbb Z,$ extending the work of the first two authors in the relatively prime case. We also find a bijection between $(dn,dm)$--Dyck paths and…
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…
It is well known that the set of $m$-Dyck paths with a fixed height and a fixed amount of valleys is counted by the Fu{\ss}-Narayana numbers. In this article, we consider the set of $m$-Dyck paths that start with at least $t$ north steps.…
We present an algorithm for a fault tolerant Depth First Search (DFS) Tree in an undirected graph. This algorithm is drastically simpler than the current state-of-the-art algorithms for this problem, uses optimal space and optimal…
The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. In this paper, we consider the refinements of Dyck paths with flaws by four…
Let $\mathcal{G}$ be the set of all the planar embeddings of a (not necessarily connected) $n$-vertex graph $G$. We present a bijection $\Phi$ from $\mathcal{G}$ to the natural numbers in the interval $[0 \dots |\mathcal{G}| - 1]$. Given a…
Although Dijkstra's algorithm has near-optimal time complexity for the problem of finding a shortest path from a given vertex $s$ to a given vertex $t$, in practice other algorithms are often superior on huge graphs. A prominent example is…
Standard sweep algorithms require an order of discrete points in Euclidean space, and rely on the property that, at a given point, all points in the halfspace below come earlier in this order. We are motivated by the problem of…