How Much Different Are Two Words with Different Shortest Periods

Sometimes the difference between two distinct words of the same length cannot be smaller than a certain minimal amount. In particular if two distinct words of the same length are both periodic or quasiperiodic, then their Hamming distance is at least 2. We study here how the minimum Hamming distance \( dist (x,y)\) between two words x, y of the same length n depends on their periods. Similar problems were considered in [1] in the context of quasiperiodicities. We say that a period p of a word x is primitive if x does not have any smaller period \(p'\) which divides p. For integers p, n (\(p\le n\)) we define \(\mathcal {P}_{p}(n)\) as the set of words of length n with primitive period p. We show several results related to the following functions introduced in this paper for \(p\ne q\) and \(n \ge \max (p,q)\). $$\begin{aligned} {\mathcal D}_{p,q}(n) = \min \,\{\, dist (x,y)\,:\; x\in \mathcal {P}_{p}(n), \,y\in \mathcal {P}_{q}(n)\,\}, \\ N_{p,q}(h) = \max \,\{\, n \,:\; {\mathcal D}_{p,q}(n)\le h\,\}. \qquad \qquad \end{aligned}$$

[1]  Juhani Karhumäki,et al.  Fine and Wilf's Theorem for k-Abelian Periods , 2013, Int. J. Found. Comput. Sci..

[2]  Stepan Holub On multiperiodic words , 2006, RAIRO Theor. Informatics Appl..

[3]  R. Tijdeman,et al.  Fine and Wilf words for any periods II , 2009, Theor. Comput. Sci..

[4]  Francine Blanchet-Sadri,et al.  Fine and Wilf's Theorem for Partial Words with Arbitrarily Many Weak Periods , 2010, Int. J. Found. Comput. Sci..

[5]  Lucian Ilie,et al.  Fine and Wilf's Theorem for Abelian Periods , 2006, Bull. EATCS.

[6]  Costas S. Iliopoulos,et al.  Two strings at Hamming distance 1 cannot be both quasiperiodic , 2017, Inf. Process. Lett..

[7]  Antonio Restivo,et al.  Fine and Wilf's Theorem for Three Periods and a Generalization of Sturmian Words , 1999, Theor. Comput. Sci..

[8]  H. Wilf,et al.  Uniqueness theorems for periodic functions , 1965 .

[9]  Pedro V. Silva,et al.  On Fine and Wilf's theorem for bidimensional words , 2003, Theor. Comput. Sci..

[10]  Filippo Mignosi,et al.  Generalizations of the Periodicity Theorem of Fine and Wilf , 1994, CAAP.

[11]  Florin Manea,et al.  Fine and Wilf's Theorem and Pseudo-repetitions , 2012, MFCS.

[12]  Jacques Justin,et al.  On a paper by Castelli, Mignosi, Restivo , 2000, RAIRO Theor. Informatics Appl..

[13]  Shu Wang,et al.  A new approach to the periodicity lemma on strings with holes , 2009, Theoretical Computer Science.

[14]  Jeffrey Shallit,et al.  Variations on a Theorem of Fine & Wilf , 2001, MFCS.

[15]  Frantisek Franek,et al.  The New Periodicity Lemma revisited , 2016, Discret. Appl. Math..

[16]  William F. Smyth,et al.  A New Periodicity Lemma , 2005, SIAM J. Discret. Math..

[17]  Francine Blanchet-Sadri,et al.  Graph connectivity, partial words, and a theorem of Fine and Wilf , 2008, Inf. Comput..

[18]  Ely Porat,et al.  Approximate Cover of Strings , 2017, CPM.

[19]  Jean Berstel,et al.  Partial Words and a Theorem of Fine and Wilf , 1999, Theor. Comput. Sci..

[20]  Lucian Ilie,et al.  Generalised fine and Wilf's theorem for arbitrary number of periods , 2005, Theor. Comput. Sci..

[21]  Francine Blanchet-Sadri,et al.  Abelian periods, partial words, and an extension of a theorem of Fine and Wilf , 2013, RAIRO Theor. Informatics Appl..

[22]  Francine Blanchet-Sadri,et al.  Partial words and a theorem of Fine and Wilf revisited , 2002, Theor. Comput. Sci..

[23]  Francine Blanchet-Sadri,et al.  Fine and Wilf's Periodicity Result on Partial Words and Consequences , 2007, LATA.