Name
Abstract | ||
|---|---|---|
Three recent papers (Fan et al., 2006; Simpson, 2007; Kopylova and Smyth, 2012) [5,11,8] have considered in complementary ways the combinatorial consequences of assuming that three squares overlap in a string. In this paper we provide a unifying framework for these results: we show that in 12 of 14 subcases that arise the postulated occurrence of three neighboring squares forces a breakdown into highly periodic behavior, thus essentially trivial and easily recognizable. In particular, we provide a proof of Subcase 4 for the first time, and we simplify and refine the previously established results for Subcases 11-14. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.jda.2012.03.003 | J. Discrete Algorithms |
Keywords | Field | DocType |
neighboring square,postulated occurrence,recent paper,unifying framework,combinatorial consequence,complementary way,overlapping square,periodic behavior,period,square | Combinatorics,Periodic graph (geometry),Mathematics | Journal |
Volume | ISSN | Citations |
17, | 1570-8667 | 6 |
PageRank | References | Authors |
0.99 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frantisek Franek | 1 | 95 | 16.02 |
| Robert C. G. Fuller | 2 | 6 | 0.99 |
| Jamie Simpson | 3 | 164 | 21.41 |
| W. F. Smyth | 4 | 730 | 68.91 |