The following pages link to GJsqfree (Q31120):
Displaying 21 items.
- Shuffle algebras, homology, and consecutive pattern avoidance (Q365882) (← links)
- 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)
- Using homological duality in consecutive pattern avoidance (Q540139) (← links)
- Pattern avoidance in labelled trees (Q658978) (← links)
- On the entropy and letter frequencies of powerfree words (Q845374) (← links)
- Several constants arising in statistical mechanics (Q1306604) (← 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)
- (Q2800764) (← links)
- Automatic Generation of Theorems and Proofs on Enumerating Consecutive-Wilf Classes (Q2846957) (← links)
