Results 101 to 110 of about 20,234 (200)
Lattice-Like Total Perfect Codes
Discussiones Mathematicae Graph Theory, 2014 A contribution is made to the classification of lattice-like total perfect codes in integer lattices Λn via pairs (G, Φ) formed by abelian groups G and homomorphisms Φ: Zn → G.
Araujo Carlos, Dejter Italo
doaj +1 more source
Counting lattice paths by Narayana polynomials, Electron
, 2000 Let d(n) count the lattice paths from (0,0) to (n, n) using the steps (0,1), (1,0), and (1,1). Let e(n) count the lattice paths from (0,0) to (n, n) with permitted steps from the step set N × N −{(0,0)}, where N denotes the nonnegative integers.
Robert A. Sulanke
core
Limit laws for lattice paths with catastrophes
, 2022 In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths or random walks, it is like having the possibility of jumping from any altitude to zero.
Wallner, Michael; orcid:
core
Refined lattice path enumeration and combinatorial reciprocity [PDF]
Enumerative Combinatorics and Applications, 2023 Henri M\"uhle, Eleni Tzanaki
doaj +1 more source
Generating functions of lattice paths
We recall the main types of \emph{lattice paths}, which are sequences in the lattice of integer coordinates points in the plane. We start with the fundamental \emph{central lattice paths} and \emph{Dyck paths} and proceed in elementary terms through ...
Duarte, Rui +1 more
core
Basic Analytic Combinatorics of Directed Lattice Paths
, 2001 This paper develops a uni ed enumerative and asymptotic theory of directed 2-dimensional lattice paths in half-planes and quarter ...
Flajolet, P. +5 more
core +1 more source
Enumeration of Lattice Paths with Restrictions
Lattice path enumeration, through the lens of Catalan numbers, plays a crucial role in combinatorics. This thesis delves into enumerations of some of the most common lattice paths – north-east paths, up-down paths, and Dyck paths – with restrictions ...
White, Vince
core
Higher dimensional restricted lattice paths with diagonal steps
, 1991 In this paper, restricted minimal lattice paths with horizontal, vertical, and diagonal steps, in two and higher dimensions are discussed. The Delannoy numbers, the numbers of unrestricted minimal lattice paths with diagonal steps, and some of their ...
Kaparthi, Shashidhar, Rao, H.Raghav
core +1 more source
Playing with paths: enumerating sets of embellished lattice paths
, 2012 © 2012 Dr. Paul W. T. FijnThis thesis primarily examines several problems in enumerative combinatorics, particu- larly those related to sets of (binomial) paths on an integer lattice.
Fijn, Paul W. T.
core
Lattice paths and the q-ballot polynomials
Advances in Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources