Related papers: Osculating Paths and Oscillating Tableaux
Dyck tilings are certain tilings in the region surrounded by two Dyck paths. We study bijections and combinatorial objects bijective to Dyck tilings, which include Dyck tiling strip (DTS) and Dyck tiling ribbon (DTR) bijections, increasing…
The symmetries of paths in a manifold $M$ are classified with respect to a given pointwise proper action of a Lie group $G$ on $M$. Here, paths are embeddings of a compact interval into $M$. There are at least two types of symmetries:…
For a given finite subset P of points of the lattice Z^2, a friendly path is a monotone (uphill or downhill) lattice path which splits points in half; points lying on the path itself are discarded. The purpose of this paper (and its sequel)…
In this paper we present the theory of oscillation numbers and dual oscillation numbers for continuous Lagrangian paths in $\mathbb{R}^{2n}$. Our main results include a connection of the oscillation numbers of the given Lagrangian path with…
A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…
The Young--Fibonacci graph is the Hasse diagram of one of the two (along with the Young lattice) 1-differential graded modular lattices. This explains the interest to path enumeration problems in this graph. We obtain a formula for the…
We study combinatorial structures arising from finite-time transition probabilities of the Totally Asymmetric Simple Exclusion Process with open boundary conditions. While much of the existing combinatorial theory regarding the TASEP…
There is a natural bijection between standard immaculate tableaux of composition shape $\alpha \vDash n$ and length $\ell(\alpha) = k$ and the $ \left\{ \begin{smallmatrix} n \\ k \end{smallmatrix} \right\} $ set-partitions of $\{ 1, 2,…
Various lattice path models are reviewed. The enumeration is done using generating functions. A few bijective considerations are woven in as well. The kernel method is often used. Computer algebra was an essential tool. Some results are…
The topologies permitted in joint ocular dominance (OD), orientation preference (OP), and direction preference (DP) maps in the primary visual cortex (V1) are considered, with the aim of finding a maximally symmetric periodic case that can…
A generalized Motzkin path, called G-Motzkin path for short, of length $n$ is a lattice path from $(0, 0)$ to $(n, 0)$ in the first quadrant of the XOY-plane that consists of up steps $\mathbf{u}=(1, 1)$, down steps $\mathbf{d}=(1, -1)$,…
Motivated by an evolutionary biology question, we study the following problem: we consider the hypercube $\{0,1\}^L$ where each node carries an independent random variable uniformly distributed on $[0,1]$, except $(1,1,\ldots,1)$ which…
In this document we study the uniform local path connectivity of sets of $m$-tuples of pairwise commuting normal matrices with some additional constraints. More specifically, given given $\varepsilon>0$, a fixed metric $\eth$ in…
Mathematical billiards is much like the real game: a point mass, representing the ball, rolls in a straight line on a (perfectly friction-less) table, striking the sides according to the law of reflection. A billiard trajectory is then…
A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…
The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…
There is a strikingly simple classical formula for the number of lattice paths avoiding the line x = ky when k is a positive integer. We show that the natural generalization of this simple formula continues to hold when the line x = ky is…
Okada and Stembridge's Pfaffian formula for the enumeration of families of nonintersecting paths with fixed starting points and unfixed ending points has been widely used to resolve many challenging problems in enumerative combinatorics. In…
We show that oriented percolation occurs whenever a condition is satisfied called "exponential intersection tails". This condition says that a measure on paths exists for which the probability of two independent paths intersecting in more…
Researching elliptic analogues for equalities and formulas is a new trend in enumerative combinatorics which has followed the previous trend of studying $q$-analogues. Recently Schlosser proposed a lattice path model in the square lattice…