English

Unary Patterns of Size Four with Morphic Permutations

Combinatorics 2019-03-25 v1 Formal Languages and Automata Theory Logic in Computer Science

Abstract

We investigate the avoidability of unary patterns of size of four with morphic permutations. More precisely, we show that, for the positive integers i,j,ki,j,k, the sizes of the alphabets over which a pattern xπi(x)πj(x)πk(x)x \pi ^ {i} (x) \pi^{j}(x) \pi^{k}(x) is avoidable are an interval of the integers (where xx is a word variable and π\pi is a function variable with values in the set of all morphic permutations of the respective alphabets). We also show how to compute a good approximation of this interval. This continues the work of [Manea et al., 2015], where a complete characterisation of the avoidability of cubic patterns with permutations was given.

Keywords

Cite

@article{arxiv.1902.02333,
  title  = {Unary Patterns of Size Four with Morphic Permutations},
  author = {Kamellia Reshadi},
  journal= {arXiv preprint arXiv:1902.02333},
  year   = {2019}
}

Comments

Accepted in the Student Research Forum (SRF) of SOFSEM 2019 conference

R2 v1 2026-06-23T07:33:54.975Z