A natural bijection for contiguous pattern avoidance in words

DOI10.1016/J.DISC.2023.113793zbMATH Open1530.05002arXiv2212.08959MaRDI QIDQ6136679FDOQ6136679

Isaiah Hollars, Eric Rowland, Julia Carrigan

Publication date: 17 January 2024

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

Abstract: Two words $p$ and $q$ are avoided by the same number of length-$n$ words, for all $n$, precisely when $p$ and $q$ have the same set of border lengths. However, known proofs of this result use generating functions and do not provide explicit bijections. We establish a natural bijection from the set of words avoiding $p$ to the set of words avoiding $q$ in the case that $p$ and $q$ have the same set of proper borders.

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

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136679)