Pattern occurrences in \(k\)-ary words revisited: a few new and old observations

DOI10.1016/j.jcta.2022.105596zbMath1497.68405arXiv2102.00443OpenAlexW4226458443MaRDI QIDQ2077272

Reza Rastegar, Toufik Mansour

Publication date: 24 February 2022

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

permutationsrandom walkpattern avoidancek-ary wordspattern occurrence

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Cites Work

• Excluded permutation matrices and the Stanley-Wilf conjecture
• Patterns in permutations and words.
• Wilf-equivalence on \(k\)-ary words, compositions, and parking functions
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Asymptotics of the number of \(k\)-words with an \(l\)-descent
• Finite automata and pattern avoidance in words
• On the number of permutations avoiding a given pattern
• Extensions of the linear bound in the Füredi-Hajnal conjecture
• Combinatorics of Permutations
• Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations

This page was built for publication: Pattern occurrences in \(k\)-ary words revisited: a few new and old observations