Related papers: Generating Functions for Restricted Motzkin Paths …
We propose a method to obtain the optimal weight function of 9 paths in (3+1)D space-time whose length is less than or equal to $2\times (6+2)$ lattice units. The factor 2 comes from inclusion of opposite direction path or time reversed…
We provide formulas for generating functions of many types of paths in various rooted tree structures. We compute the $k$th moment of the generating functions for various types of vertical paths. In two specific familes of trees we find…
Path generation, the process of converting high-level mission specifications, such as sequences of waypoints from a path planner, into smooth, executable paths, is a fundamental challenge in mobile robotics. Most path following and…
We propose a formalism to analyze discrete stochastic processes with finite-state-level N. By using an (N+1)-dimensional representation of su(2) Lie algebra, we re-express the master equation to a time-evolution equation for the state…
We are concerned with counting self-conjugate $(s,s+1,s+2)$-core partitions. A Motzkin path of length $n$ is a path from $(0,0)$ to $(n,0)$ which stays above the $x$-axis and consists of the up $U=(1,1)$, down $D=(1,-1)$, and flat $F=(1,0)$…
In this work a method is presented to derive the generating functional in path integral form for a system with an arbitrary number of degrees of freedom and constrained by general conditions. The method is applied to the case of the…
In this note we investigate mixed partitions with extra condition on the sizes of the blocks. We give a general formula and the generating function. We consider in more details a special case, determining the generating functions, some…
The design space of discrete-space diffusion or flow generative models are significantly less well-understood than their continuous-space counterparts, with many works focusing only on a simple masked construction. In this work, we aim to…
We give several bijections among restricted Motzkin paths, explaining why various parameters on these paths are equidistributed. For example, the number of doublerise-free Motzkin paths of length n is the same as the number of peak-free…
We use a Hamiltonian (transition matrix) description of height-restricted Dyck paths on the plane in which generating functions for the paths arise as matrix elements of the propagator to evaluate the length and area generating function for…
Recently, several authors have considered lattice paths with various steps, including vertical steps permitted. In this paper, we consider a kind of generalized Motzkin paths, called {\it G-Motzkin paths} for short, that is lattice paths…
We propose a novel stochastic method to exactly generate Brownian paths conditioned to start at an initial point and end at a given final point during a fixed time $t_{f}$. These paths are weighted with a probability given by the overdamped…
The success of generative modeling in continuous domains has led to a surge of interest in generating discrete data such as molecules, source code, and graphs. However, construction histories for these discrete objects are typically not…
We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We…
The sequence A176677 in the Encyclopedia of Integer Sequences enumerates Motzkin paths where two types of horizontal steps may occur, but only on odd indexed levels. We show how to perform the enumeration, also dealing with partial such…
In this work, we seek to simulate rare transitions between metastable states using score-based generative models. An efficient method for generating high-quality transition paths is valuable for the study of molecular systems since data is…
The object of this paper is to introduce a new weighted information generating function whose derivative at point 1 gives some well known measures of information. Some properties and particular cases of the proposed generating function have…
The question of classifying the nature of the generating functions of restricted lattice walks has enjoyed much attention in past years. We prove that a certain class of octant walks have a D-finite generating function using the theory of…
Using a simple transfer matrix approach we have derived very long series expansions for the perimeter generating function of punctured staircase polygons (staircase polygons with a single internal staircase hole). We find that all the terms…
We obtain expected number of arrivals, probability of arrival, absorption probabilities and expected time before absorption for a modified discrete random walk on the (sub)set of integers. In a [pqrs] random walk the particle can move one…