The symbolic Goulden-Jackson cluster method

DOI10.1080/10236190512331329432zbMath1066.05017OpenAlexW2061302137MaRDI QIDQ4663093

Xiangdong Wen

Publication date: 30 March 2005

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10236190512331329432

zbMATH Keywords

self-avoiding walksmarked word

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (2)

A generalized Goulden-Jackson cluster method and lattice path enumeration ⋮ Increasing consecutive patterns in words

Cites Work

• New upper bounds for the connective constants of self-avoiding walks
• An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
• The Goulden—Jackson cluster method: extensions, applications and implementations
• Unnamed Item

This page was built for publication: The symbolic Goulden-Jackson cluster method