Pages that link to "Item:Q4700080"

The following pages link to The Goulden—Jackson cluster method: extensions, applications and implementations (Q4700080):

Displaying 36 items.

• A representation theorem for (\(q\)-)holonomic sequences (Q386034) (← links)
• Strict bounds for pattern avoidance (Q393106) (← links)
• Counting words with Laguerre series (Q405183) (← links)
• Residues and telescopers for bivariate rational functions (Q444428) (← links)
• Growth properties of power-free languages (Q465700) (← links)
• Pattern avoidance: themes and variations (Q557911) (← links)
• Avoiding large squares in infinite binary words (Q557912) (← links)
• Polynomial versus exponential growth in repetition-free binary words (Q598459) (← links)
• On the entropy and letter frequencies of powerfree words (Q845374) (← links)
• Pattern avoidance in binary trees (Q986111) (← links)
• Several constants arising in statistical mechanics (Q1306604) (← links)
• Dimensions of fractals related to languages defined by tagged strings in complete genomes (Q1581740) (← links)
• The Goulden-Jackson cluster method for cyclic words (Q1585502) (← links)
• A generalized Goulden-Jackson cluster method and lattice path enumeration (Q1685986) (← links)
• On cyclic strings avoiding a pattern (Q1744751) (← links)
• Clusters, generating functions and asymptotics for consecutive patterns in permutations (Q1761477) (← links)
• Successions in words and compositions (Q1928592) (← links)
• An application of the Goulden-Jackson cluster theorem (Q2109221) (← links)
• Many faces of symmetric edge polytopes (Q2161212) (← links)
• Tree series and pattern avoidance in syntax trees (Q2194759) (← links)
• Generating functions for lattice paths with several forbidden patterns (Q2199903) (← links)
• Increasing consecutive patterns in words (Q2304195) (← links)
• Exponential lower bounds for the number of words of uniform length avoiding a pattern (Q2381499) (← links)
• Growth of repetition-free words -- a review (Q2484440) (← links)
• Bounds for the growth rate of meander numbers (Q2575805) (← links)
• ON THE EXISTENCE OF MINIMAL β-POWERS (Q2909104) (← links)
• Applying the cluster method to count occurrences of generalized permutation patterns (Q3016321) (← links)
• SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS (Q3022001) (← links)
• Generalizations of the Goulden–Jackson cluster method (Q3066364) (← links)
• Extension of Goulden–Jackson cluster method on pattern occurrences in random sequences and comparison with Régnier–Szpankowski method (Q3369573) (← links)
• The symbolic Goulden-Jackson cluster method (Q4663093) (← links)
• The number of binary cube-free words of length up to 47 and their numerical analysis (Q4700079) (← links)
• The Number of Optimal Strategies in the Penney-Ante Game (Q4987405) (← links)
• Systematic Counting of Restricted Partitions (Q5148745) (← links)
• Phase Coexistence for the Hard-Core Model on ℤ² (Q5219308) (← links)
• A natural bijection for contiguous pattern avoidance in words (Q6136679) (← links)