Related papers: Osculating Paths and Oscillating Tableaux
We prove an integral formula for continuous paths of rectangles inscribed in a piecewise smooth loop. We then use this integral formula to show that (with a very mild genericity hypothesis) the number of rectangle coincidences, informally…
The paper is devoted to the study of lattice paths that consist of vertical steps $(0,-1)$ and non-vertical steps $(1,k)$ for some $k\in \mathbb Z$. Two special families of primary and free lattice paths with vertical steps are considered.…
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.…
A bounded curvature path is a continuously differentiable piecewise $C^2$ path with a bounded absolute curvature that connects two points in the tangent bundle of a surface. In this work, we analyze the homotopy classes of bounded curvature…
We define a family of maps on lattice paths, called sweep maps, that assign levels to each step in the path and sort steps according to their level. Surprisingly, although sweep maps act by sorting, they appear to be bijective in general.…
A bijection is presented between (1): partitions with conditions $f_j+f_{j+1}\leq k-1$ and $ f_1\leq i-1$, where $f_j$ is the frequency of the part $j$ in the partition, and (2): sets of $k-1$ ordered partitions $(n^{(1)}, n^{(2)}, ...,…
MacMahon enumerated the plane partitions in an $a \times b \times c$ box. These are in bijection to lozenge tilings of a hexagon, to certain perfect matchings, and to families of non-intersecting lattice paths. In this work we consider more…
If one attaches shifted copies of a skew tableau to the right of itself and rectifies, at a certain point the copies no longer experience vertical slides, a phenomenon called tableau stabilization. While tableau stabilization was originally…
In the 1980s, Viennot developed a combinatorial approach to studying mixed moments of orthogonal polynomials using Motzkin paths. Recently, an alternative combinatorial model for these mixed moments based on lecture hall paths was…
Consider an $m\times n$ table $T$ and latices paths $\nu_1,\ldots,\nu_k$ in $T$ such that each step $\nu_{i+1}-\nu_i=(1,1)$, $(1,0)$ or $(1,-1)$. The number of paths from the $(1,i)$-blank (resp. first column) to the $(s,t)$-blank is…
Inspired by a new mathematical model for bobbin lace, this paper considers finite lattice paths formed from the set of step vectors $\mathfrak{A}=$$\{\rightarrow,$ $\nearrow,$ $\searrow,$ $\uparrow,$ $\downarrow\}$ with the restriction that…
Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tableaux thereby generalizing recent work on the Kostka polynomials by Nakayashiki and Yamada and by Lascoux, Leclerc and Thibon. Motivated by these works…
Let $a,b$ be fixed positive coprime integers. For a positive integer $g$, write $W_k(g)$ for the set of lattice paths from the startpoint $(0,0)$ to the endpoint $(ga,gb)$ with steps restricted to $\{(1,0), (0,1)\}$, having exactly $k$…
In this paper, a natural bijection between multichains of binary paths and shifted tableaux is presented, and it is used for the enumeration of the chains with maximum length from a given path $P$ to the maximum path $\mathbf{1}_{|P|}$. By…
We consider the set of alternating paths on a fixed fully packed loop of size n. This set is in bijection with the set of fully packed loops of size n. Furthermore, for a special choice of fully packed loop, we demonstrate that the set of…
We study waves in a chain of dispersively coupled phase oscillators. Two approaches -- a quasi-continuous approximation and an iterative numerical solution of the lattice equation -- allow us to characterize different types of traveling…
In this paper we show that every sufficiently large family of convex bodies in the plane has a large subfamily in convex position provided that the number of common tangents of each pair of bodies is bounded and every subfamily of size five…
Let a and b be two positive integers. A culminating path is a path of Z^2 that starts from (0,0), consists of steps (1,a) and (1,-b), stays above the x-axis and ends at the highest ordinate it ever reaches. These paths were first…
We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases the…
Totally asymmetric simple exclusion processes on lattices with junctions, where particles interact with hard-core exclusion and move on parallel lattice branches that at the junction combine into a single lattice segment, are investigated.…