| dc.contributor.author | Currie, James | |
| dc.contributor.author | Rampersad, Narad | |
| dc.date.accessioned | 2018-03-01T20:18:00Z | |
| dc.date.available | 2018-03-01T20:18:00Z | |
| dc.date.issued | 2009 | |
| dc.identifier.citation | Currie, James D., and Narad Rampersad. "Dejean's conjecture holds for n ≥ 27." RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications 43(4) (2009): 775-778. DOI: 10.1051/ita/2009017. | en_US |
| dc.identifier.issn | 0988-3754 | |
| dc.identifier.uri | http://hdl.handle.net/10680/1371 | |
| dc.description.abstract | We show that Dejean’s conjecture holds for n ≥ 27. This brings the final resolution of the conjecture by the approach of Moulin Ollagnier within range of the computationally feasible. | en_US |
| dc.description.sponsorship | The first author is supported by an NSERC Discovery Grant. The second author is supported by an NSERC Postdoctoral Fellowship. | en_US |
| dc.description.uri | https://www.rairo-ita.org/articles/ita/abs/2009/04/ita09028/ita09028.html | |
| dc.language.iso | en | en_US |
| dc.publisher | EDP Sciences | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.subject | Dejean’s conjecture | en_US |
| dc.subject | Repetitions in words | en_US |
| dc.subject | Fractional exponent | en_US |
| dc.title | Dejean's conjecture holds for n ≥ 27 | en_US |
| dc.type | Article | en_US |
| dc.identifier.doi | 10.1051/ita/2009017 | |
