NAIVE

swMATH19282MaRDI QIDQ31112FDOQ31112

Author name not available (Why is that?)

Cited In (26)

• Strict bounds for pattern avoidance
• Residues and telescopers for bivariate rational functions
• Generating functions for lattice paths with several forbidden patterns
• Automatic Generation of Theorems and Proofs on Enumerating Consecutive-Wilf Classes
• Counting words with Laguerre series
• Using homological duality in consecutive pattern avoidance
• The Number of Optimal Strategies in the Penney-Ante Game
• 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
• Systematic Counting of Restricted Partitions
• Pattern Avoidance in Ternary Trees
• Dismal Arithmetic
• Many faces of symmetric edge polytopes
• 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
• Shuffle algebras, homology, and consecutive pattern avoidance
• The Goulden—Jackson cluster method: extensions, applications and implementations
• Increasing consecutive patterns in words
• On the entropy and letter frequencies of powerfree words
• 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: NAIVE