Increasing consecutive patterns in words

DOI10.1007/s10801-018-0868-5zbMath1434.05009arXiv1805.06077OpenAlexW2963648295WikidataQ128648362 ScholiaQ128648362MaRDI QIDQ2304195

Doron Zeilberger, Mingjia Yang

Publication date: 6 March 2020

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.06077

zbMATH Keywords

generating functionpermutationefficient computationwordconsecutive patternGoulden-Jackson cluster method

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (1)

An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences

Uses Software

• Maple
• CAV
• OEIS
• Elizalde
• Sergi
• KamaTzviot
• NAIVE
• DAVID_IAN
• JODO
• BLANKS
• SYMGJ
• SPGJ
• GJseries
• GJSAW
• GJsqfree

Cites Work

• Unnamed Item
• Unnamed Item
• Permutations and words counted by consecutive patterns
• Symmetric functions and P-recursiveness
• Consecutive patterns in permutations
• Words restricted by patterns with at most 2 distinct letters
• Automatic Generation of Theorems and Proofs on Enumerating Consecutive-Wilf Classes
• Computational Approaches to Consecutive Pattern Avoidance in Permutations
• An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
• The symbolic Goulden-Jackson cluster method
• The Goulden—Jackson cluster method: extensions, applications and implementations

This page was built for publication: Increasing consecutive patterns in words