Natural bijections for contiguous pattern avoidance in words

12/17/2022
by   Julia Carrigan, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/18/2018

Descent distribution on Catalan words avoiding a pattern of length at most three

Catalan words are particular growth-restricted words over the set of non...
research
07/29/2021

Mesosome Avoidance

We consider avoiding mesosomes – that is, words of the form xx' with x' ...
research
07/23/2018

Enumerative Results on the Schröder Pattern Poset

The set of Schröder words (Schröder language) is endowed with a natural ...
research
05/21/2018

Algorithmic and algebraic aspects of unshuffling permutations

A permutation is said to be a square if it can be obtained by shuffling ...
research
10/07/2021

Transliteration of Foreign Words in Burmese

This manuscript provides general descriptions on transliteration of fore...
research
02/03/2016

Image and Information

A well-known old adage says that "A picture is worth a thousand words!"...
research
12/22/2019

Catalan words avoiding pairs of length three patterns

Catalan words are particular growth-restricted words counted by the epon...

Please sign up or login with your details

Forgot password? Click here to reset