Skip to main content
SpringerLink
Log in

A word on 7 letters which is non-repetitive up to mod 5

  • Original article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

Trying to tile the plane in highly non-periodic ways leads to problems in combinatorics on words. In particular, one wants bisequences where certain subsequences are non-repetitive. The authors construct a perturbed 6-cycle which is non-repetitive up to mod 5. This answers a question of Currie and Simpson.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Winnipeg, Winnipeg, Manitoba, Canada R3B 2E9 (e-mail: currie@uwinnipeg.ca) , , , , , , CA

    James D. Currie & Erica Moodie

Authors
  1. James D. Currie
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Erica Moodie
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 3 April 2002 / 16 January 2003

RID="*"

ID="*" This work was supported by an NSERC operating grant.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Currie, J., Moodie, E. A word on 7 letters which is non-repetitive up to mod 5. Acta Informatica 39, 451–468 (2003). https://doi.org/10.1007/s00236-003-0110-2

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-003-0110-2

Search

Navigation