Explicit formulas for enumeration of lattice paths: basketball and the kernel method

DOI10.1007/978-3-030-11102-1_6zbMath1422.05007arXiv1609.06473OpenAlexW2963222432MaRDI QIDQ2328846

Yanyan Li

Publication date: 16 October 2019

Full work available at URL: https://arxiv.org/abs/1609.06473

zbMATH Keywords

generating functioncomputer algebracontext-free grammarskernel methodlattice pathsMotzkin pathsDyck pathssingularity analysisLagrange inversionanalytic combinatorics\(\mathbb{N}\)-algebraic function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Asymptotic enumeration (05A16)

Related Items (7)

Bijections between directed animals, multisets and Grand-Dyck paths ⋮ Symmetric Fibonaccian distributive lattices and representations of the special linear Lie algebras ⋮ The research and progress of the enumeration of lattice paths ⋮ Knight's paths towards Catalan numbers ⋮ Enumerative combinatorics of \textit{XX0} Heisenberg chain ⋮ Pseudo-involutions in the Riordan group ⋮ Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata

Uses Software

• gfun

This page was built for publication: Explicit formulas for enumeration of lattice paths: basketball and the kernel method