Results 11 to 20 of about 45,216 (263)
Analytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the Area [PDF]
This paper tackles the enumeration and asymptotics of the area below directed lattice paths (walks on $\mathbb{N}$ with a finite set of jumps). It is a nice surprise (obtained via the "kernel method'') that the generating functions of the moments of the ...
Cyril Banderier, Bernhard Gittenberger
doaj +1 more source
4-Dimensional Lattice Path Enumeration with Arbitrary Steps
Consider a set of vectors, L, which consists of vectors whose coordinates are 0 or 1. We find explicit formulas that counts the number of lattice paths from origin to (a,b,c,d) for using vectors in {(1,0,0,0),(0,1,0,0),(0,0,1,0),(0,0,0,1)} ∪ L for ...
Alper Vural, Cemil Karaçam
doaj +1 more source
Lattice paths with catastrophes [PDF]
In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not have the same intuitive probabilistic behaviour as classical Dyck paths (the typical properties ...
Cyril Banderier, Michael Wallner 0001
openaire +5 more sources
A lattice on Dyck paths close to the Tamari lattice
We introduce a new poset structure on Dyck paths where the covering relation is a particular case of the relation inducing the Tamari lattice. We prove that the transitive closure of this relation endows Dyck paths with a lattice structure. We provide a trivariate generating function counting the number of Dyck paths with respect to the semilength, the
Baril, Jean-Luc +2 more
openaire +5 more sources
Topological Valley Transport of Elastic Waves Based on Periodic Triangular-Lattices
Topological transports of elastic waves have attracted much attention because of their unique immunity to defects and backscattering-suppression ability.
Zehuan Tang +9 more
doaj +1 more source
Bijections for lattice paths between two boundaries [PDF]
We prove that on the set of lattice paths with steps $N=(0,1)$ and $E=(1,0)$ that lie between two boundaries $B$ and $T$, the two statistics `number of $E$ steps shared with $B$' and `number of $E$ steps shared with $T$' have a symmetric joint ...
Sergi Elizalde, Martin Rubey
doaj +1 more source
Short Simplex Paths in Lattice Polytopes [PDF]
The goal of this paper is to design a simplex algorithm for linear programs on lattice polytopes that traces `short' simplex paths from any given vertex to an optimal one. We consider a lattice polytope $P$ contained in $[0,k]^n$ and defined via $m$ linear inequalities.
Alberto Del Pia, Carla Michini
openaire +2 more sources
Osculating Random Walks on Cylinders [PDF]
We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before.
Saibal Mitra, Bernard Nienhuis
doaj +1 more source
This paper proposes a new active noise control (ANC) system based on a recursive least-squares lattice (RLSL) algorithm by designing secondary-path innovation (SPI) and lattice-order decision (LOD) algorithms.
Dong Woo Kim, Poogyeon Park
doaj +1 more source
A Discrete-Time Approach to Evaluate Path-Dependent Derivatives in a Regime-Switching Risk Model
This paper provides a discrete-time approach for evaluating financial and actuarial products characterized by path-dependent features in a regime-switching risk model.
Emilio Russo
doaj +1 more source

