Cited in
(48)- Strict bounds for pattern avoidance
- Residues and telescopers for bivariate rational functions
- Generating functions for lattice paths with several forbidden patterns
- Counting words with Laguerre series
- Using homological duality in consecutive pattern avoidance
- Clusters, generating functions and asymptotics for consecutive patterns in permutations
- An application of the Goulden-Jackson cluster theorem
- Pattern avoidance in labelled trees
- Exponential lower bounds for the number of words of uniform length avoiding a pattern
- Successions in words and compositions
- CAV
- Elizalde
- Sergi
- ZOO
- KamaTzviot
- CGJ
- RotaStanley
- JAN
- SiPerUGJ
- SymUGJ
- UGJ
- BinaryTrees
- BLANKS
- DAVID_IAN
- GJseries
- GJSAW
- GJsqfree
- NAIVE
- SPGJ
- SYMGJ
- Compositions
- Dismal Arithmetic
- operads
- Many faces of symmetric edge polytopes
- The number of optimal strategies in the Penney-Ante game
- Generating functions and Wilf equivalence for generalized interval embeddings
- A generalized Goulden-Jackson cluster method and lattice path enumeration
- Several constants arising in statistical mechanics
- Pattern avoidance in ternary trees
- Shuffle algebras, homology, and consecutive pattern avoidance
- Automatic generation of theorems and proofs on enumerating consecutive-Wilf classes
- On the entropy and letter frequencies of powerfree words
- The Goulden—Jackson cluster method: extensions, applications and implementations
- Increasing consecutive patterns in words
- Systematic counting of restricted partitions
- On cyclic strings avoiding a pattern
- Tree series and pattern avoidance in syntax trees
- A representation theorem for (q-)holonomic sequences
This page was built for software: JODO
