The Goulden—Jackson cluster method: extensions, applications and implementations
From MaRDI portal
Publication:4700080
DOI10.1080/10236199908808197zbMath0935.05003arXivmath/9806036OpenAlexW1981959436MaRDI QIDQ4700080
Publication date: 2 December 1999
Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9806036
Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10)
Related Items
On the entropy and letter frequencies of powerfree words ⋮ ON THE EXISTENCE OF MINIMAL β-POWERS ⋮ Exponential lower bounds for the number of words of uniform length avoiding a pattern ⋮ The Number of Optimal Strategies in the Penney-Ante Game ⋮ Many faces of symmetric edge polytopes ⋮ Polynomial versus exponential growth in repetition-free binary words ⋮ A representation theorem for (\(q\)-)holonomic sequences ⋮ Successions in words and compositions ⋮ Strict bounds for pattern avoidance ⋮ A generalized Goulden-Jackson cluster method and lattice path enumeration ⋮ Counting words with Laguerre series ⋮ Tree series and pattern avoidance in syntax trees ⋮ A natural bijection for contiguous pattern avoidance in words ⋮ Generating functions for lattice paths with several forbidden patterns ⋮ Residues and telescopers for bivariate rational functions ⋮ Growth properties of power-free languages ⋮ On cyclic strings avoiding a pattern ⋮ Applying the cluster method to count occurrences of generalized permutation patterns ⋮ SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS ⋮ Clusters, generating functions and asymptotics for consecutive patterns in permutations ⋮ Growth of repetition-free words -- a review ⋮ The symbolic Goulden-Jackson cluster method ⋮ Pattern avoidance: themes and variations ⋮ Avoiding large squares in infinite binary words ⋮ Pattern avoidance in binary trees ⋮ Generalizations of the Goulden–Jackson cluster method ⋮ Extension of Goulden–Jackson cluster method on pattern occurrences in random sequences and comparison with Régnier–Szpankowski method ⋮ The number of binary cube-free words of length up to 47 and their numerical analysis ⋮ Phase Coexistence for the Hard-Core Model on ℤ2 ⋮ Increasing consecutive patterns in words ⋮ Systematic Counting of Restricted Partitions ⋮ Dimensions of fractals related to languages defined by tagged strings in complete genomes ⋮ The Goulden-Jackson cluster method for cyclic words ⋮ Bounds for the growth rate of meander numbers ⋮ Several constants arising in statistical mechanics ⋮ An application of the Goulden-Jackson cluster theorem
Uses Software
Cites Work
This page was built for publication: The Goulden—Jackson cluster method: extensions, applications and implementations
