A generalized Goulden-Jackson cluster method and lattice path enumeration
From MaRDI portal
Publication:1685986
DOI10.1016/j.disc.2017.09.004zbMath1376.05009arXiv1508.02793OpenAlexW2963187226MaRDI QIDQ1685986
Publication date: 20 December 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.02793
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Related Items (4)
Enumerating symmetric and asymmetric peaks in Dyck paths ⋮ Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata ⋮ An application of the Goulden-Jackson cluster theorem ⋮ A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial aspects of continued fractions
- Enumeration of pairs of sequences by rises, falls and levels
- The Goulden-Jackson cluster method for cyclic words
- Lattice Path Enumeration
- Generalizations of the Goulden–Jackson cluster method
- Counting occurrences for a finite set of words
- Extension of Goulden–Jackson cluster method on pattern occurrences in random sequences and comparison with Régnier–Szpankowski method
- Dyck Paths with Peak‐ and Valley‐Avoiding Sets
- An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
- Determination of a class of Poincaré series.
- The symbolic Goulden-Jackson cluster method
- The Goulden—Jackson cluster method: extensions, applications and implementations
This page was built for publication: A generalized Goulden-Jackson cluster method and lattice path enumeration
