Related papers: Generating Functions for Restricted Motzkin Paths …
We give an algorithm that takes a directed graph $G$ undergoing $m$ edge insertions with lengths in $[1, W]$, and maintains $(1+\epsilon)$-approximate shortest path distances from a fixed source $s$ to all other vertices. The algorithm is…
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)$,…
We propose a simple, geometrically-motivated construction of smooth random paths in the plane. The construction is such that, with probability one, the paths have finite curvature everywhere (and the realizations are visually pleasing when…
We study the multi-time distribution in a discrete polynuclear growth model or, equivalently, in directed last-passage percolation with geometric weights. A formula for the joint multi-time distribution function is derived in the discrete…
In this paper, we continue the study of linear sets with complementary weights. We find criteria to determine the set of points of any fixed weight and use this to present particular linear sets with few points of weight more than one. We…
For an acyclic directed graph with multiple sources and multiple sinks, we prove that one can choose the Merger's paths between the sources and the sinks such that the number of mergings between these paths is upper bounded by a constant…
We establish an explicit combinatorial/homological characterization of supports for linear degenerations of flag varieties. For such purpose, we introduce the concept of an excessive multisegment. It provides a new class of combinatorial…
We consider weighted small step walks in the positive quadrant, and provide algebraicity and differential transcendence results for the underlying generating functions: we prove that depending on the probabilities of allowed steps, certain…
Two path integral representations for the $T$-matrix in nonrelativistic potential scattering are derived and proved to produce the complete Born series when expanded to all orders. They are obtained with the help of "phantom" degrees of…
A redundant generating function is a generating function having terms which are not part of the solution of the original problem. We use redundant generating functions to study two path problems. In the first application we explain a…
We obtain the first near-linear time deterministic algorithm for negative-weight single-source shortest paths on integer-weighted graphs. Our main ingredient is a deterministic construction of a padded decomposition on directed graphs,…
Noncrossing linked partitions arise in the study of certain transforms in free probability theory. We explore the connection between noncrossing linked partitions and colored Motzkin paths. A (3,2)-Motzkin path can be viewed as a colored…
In this paper we give a bijection between the class of permutations that can be drawn on an X-shape and a certain set of permutations that appears in [Knuth] in connection to sorting algorithms. A natural generalization of this set leads us…
We provide a complete classification, in the language of weak-combinatorics, of minimal plus-one generated line arrangements in the complex projective plane with double and triple intersection points.
In this work, we present a simple and efficient generator of polymeric linear chains, based on a random self-avoiding walk process. The chains are generated using a discrete process of growth, in cubic networks and in a finite time, without…
Dyck paths where peaks are only allowed on level 1 and on even-indexed levels, were introduced by Retakh and analysed by Zeilberger, with assistance from Ekhad. We add some combinatorial comments to the enumeration, which involves Motzkin…
We enumerate 132-avoiding permutations of order 3 in terms of the Catalan and Motzkin generating functions, answering a question of B\'{o}na and Smith from 2019. We also enumerate 231-avoiding permutations that are composed only of…
We develop the structure theory for transformations of weakly geometric rough paths of bounded $1 < p$-variation and their controlled paths. Our approach differs from existing approaches as it does not rely on smooth approximations. We…
Almost twenty years ago, E.R. Fernholz introduced portfolio generating functions which can be used to construct a variety of portfolios, solely in the terms of the individual companies' market weights. I. Karatzas and J. Ruf recently…
The paper deals with finite-state Markov decision processes (MDPs) with integer weights assigned to each state-action pair. New algorithms are presented to classify end components according to their limiting behavior with respect to the…