arXiv 0812.44702008-12-24math.COcs.FL

There are k-uniform cubefree binary morphisms for all k >= 0

James Currie, Narad Rampersad

备注：: 5 pages

英文摘要：

A word is cubefree if it contains no non-empty subword of the form xxx. A morphism h : Sigma^* -> Sigma^* is k-uniform if h(a) has length k for all a in Sigma. A morphism is cubefree if it maps cubefree words to cubefree words. We show that for all k >= 0 there exists a k-uniform cubefree binary morphism.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

无幂互补二元态射

Power-free Complementary Binary Morphisms

本文研究二元互补态射的无幂性质，证明Thue-Morse词前缀生成3^+-无态射，并刻画无立方情形的长度存在性及其α-无边界。

2023-12-08cs.DMcs.FLmath.CO

Another Solution to the Thue Problem of Non-Repeating Words

In this work we consider morphisms that preserve well-known non-repeating properties: squarefreeness, cubefreeness, overlap-freeness and weak squarefreeness. Up to the present moment only the morphisms preserving three out of four non-repeating properties have been known. The problem of the existence of weakly squarefree morphisms was open. The essential result of this work is the positive solution to this problem. An example of the morphism preserving all four properties is provided. Also, it is proved that there are no morphisms with the same properties and a lower rank.

2015-04-30cs.FLmath.CO

Synchronizing delay for binary uniform morphisms

Circular D0L-systems are those with finite synchronizing delay. We introduce a tool called graph of overhangs which can be used to find the minimal value of synchronizing delay of a given D0L-system. By studying the graphs of overhangs, a general upper bound on the minimal value of a synchronizing delay of a circular D0L-system with a binary uniform morphism is given.

2015-07-18cs.FLmath.CO

Anti-Powers in Primitive Uniform Substitutions

In a recent work, A. Berger and C. Defant showed that if $x$ is a fixed point of a binary uniform and primitive morphism, then there exists a constant $C$ such that for all positive integers $i,k,$ beginning in position $n$ in $x$ is a $k$-anti-power with block length at most $Ck$. They ask whether this result extends to a broader class of morphic words. In this note we extend their results to fixed points of uniform primitive morphisms on arbitrary finite alphabets. Our methods make use of the recognisability of uniform primitive morphisms. This result was proved independantly by S. Garg, usi…

2019-10-07math.CO

Infinite Words with Finite Defect

In this paper, we provide a new characterization of uniformly recurrent words with finite defect based on a relation between the palindromic and factor complexity. Furthermore, we introduce a class of morphisms P_ret closed under composition and we show that a uniformly recurrent word with finite defect is an image of a rich (also called full) word under a morphism of class P_ret. This class is closely related to the well-known class P defined by Hof, Knill, and Simon; every morphism from P_ret is conjugate to a morphism of class P.

2011-01-10math.CO

Morphisms generating antipalindromic words

We introduce two classes of morphisms over the alphabet $A=\{0,1\}$ whose fixed points contain infinitely many antipalindromic factors. An antipalindrome is a finite word invariant under the action of the antimorphism $\mathrm{E}:\{0,1\}^*\to\{0,1\}^*$, defined by $\mathrm{E}(w_1\cdots w_n)=(1-w_{n})\cdots(1-w_1)$. We conjecture that these two classes contain all morphisms (up to conjugation) which generate infinite words with infinitely many antipalindromes. This is an analogue to the famous HKS conjecture concerning infinite words containing infinitely many palindromes. We prove our conjectu…

2019-06-14math.CO

更多相关论文收起更多论文

Fixed points of Sturmian morphisms and their derivated words

Any infinite uniformly recurrent word ${\bf u}$ can be written as concatenation of a finite number of return words to a chosen prefix $w$ of ${\bf u}$. Ordering of the return words to $w$ in this concatenation is coded by derivated word $d_{\bf u}(w)$. In 1998, Durand proved that a fixed point ${\bf u}$ of a primitive morphism has only finitely many derivated words $d_{\bf u}(w)$ and each derivated word $d_{\bf u}(w)$ is fixed by a primitive morphism as well. In our article we focus on Sturmian words fixed by a primitive morphism. We provide an algorithm which to a given Sturmian morphism $ψ$ …

2018-05-07math.CO

Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms

Let $A$ be a finite or countable alphabet and let $θ$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under $θ$ ($θ$-invariant for short).We establish an extension of the famous defect theorem. Moreover, we prove that for the so-called thin $θ$-invariant codes, maximality and completeness are two equivalent notions. We prove that a similar property holds in the framework of some special families of $θ$-invariant codes such as prefix (bifix) codes, codes with a finite dec…

2017-07-27cs.DMcs.ITmath.CO

避免自然数上的分数幂

Avoiding fractional powers over the natural numbers

本研究通过自动化方法确定自然数上字典序最小分数幂自由词的结构，涵盖多个有理数族及零星情形，并揭示其与有限字母表及自动序列的联系。

2018-05-28cs.DMmath.CO

Recurrence along directions in multidimensional words

In this paper we introduce and study new notions of uniform recurrence in multidimensional words. A $d$-dimensional word is called \emph{uniformly recurrent} if for all $(s_1,\ldots,s_d)\in\mathbb{N}^d$ there exists $n\in\mathbb{N}$ such that each block of size $(n,\ldots,n)$ contains the prefix of size $(s_1,\ldots,s_d)$. We are interested in a modification of this property. Namely, we ask that for each rational direction $(q_1,\ldots,q_d)$, each rectangular prefix occurs along this direction in positions $\ell(q_1,\ldots,q_d)$ with bounded gaps. Such words are called \emph{uniformly recurren…

2020-06-17math.CO

Avoiding Abelian powers in binary words with bounded Abelian complexity

The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waerden's theorem, they proved that if a word avoids Abelian $k$-powers for some integer $k$, then its Abelian complexity is unbounded. This suggests the following question: How frequently do Abelian $k$-powers occur in a word having bounded Abelian complexity? In particular, does every uniformly recurrent word having bounded Abelian complexity begin in an Abelian $k$-power? While this is true for various classes of unif…

2010-05-14cs.DMmath.CO