A natural bijection for contiguous pattern avoidance in words

DOI10.1016/j.disc.2023.113793zbMath1530.05002arXiv2212.08959MaRDI QIDQ6136679

Isaiah Hollars, Eric S. Rowland, Julia Carrigan

Publication date: 17 January 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

combinatorics on wordsbijectionscontiguous pattern avoidance

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• String overlaps, pattern matching, and nontransitive games
• Enumeration of words by their number of mistakes
• An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
• Some Combinatorial Properties of Free Semigroups
• Periods and borders of random words
• The Goulden—Jackson cluster method: extensions, applications and implementations
• A Combinatorial Identity and Its Application to the Problem Concerning the First Occurrence of a Rare Event

This page was built for publication: A natural bijection for contiguous pattern avoidance in words