Abstract | ||
---|---|---|
Let Fk be the family of the binary words containing the letter 0 exactly k times. Ilić, Klavžar and Rho constructed an infinite subfamily of 2-isometric and not 3-isometric words in F2. Wei and Zhang further found all such words in F2. In this paper we find that there exists no 2-isometric and not 3-isometric word in F3. For k≠1,3,4 and 7, we also construct an infinite subfamily of 2-isometric and not 3-isometric words in Fk. Based on those results and computer experiments, we conjecture that F1, F3, F4 and F7 are the only families in which there exists no 2-isometric and not 3-isometric word. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1016/j.tcs.2017.07.028 | Theoretical Computer Science |
Keywords | Field | DocType |
Binary word,s-isometric word,Isometric word,Non-isometric word | Discrete mathematics,Combinatorics,Existential quantification,Isometric exercise,Subfamily,Conjecture,Mathematics,Binary number | Journal |
Volume | ISSN | Citations |
696 | 0304-3975 | 0 |
PageRank | References | Authors |
0.34 | 15 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jianxin Wei | 1 | 7 | 1.55 |
Yujun Yang | 2 | 0 | 0.34 |
Guangfu Wang | 3 | 1 | 2.05 |