Papers
Topics
Authors
Recent
Search
2000 character limit reached

Unary Patterns of Size Four with Morphic Permutations

Published 5 Feb 2019 in math.CO, cs.FL, and cs.LO | (1902.02333v1)

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,k$, the sizes of the alphabets over which a pattern $x \pi ^ {i} (x) \pi{j}(x) \pi{k}(x)$ is avoidable are an interval of the integers (where $x$ 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.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.