UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Powers and Anti-Powers in Binary Words

Thumbnail Image

Files

Riasat_Samin.pdf (289.49 KB)

Date

2019-08-28

Authors

Riasat, Samin

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

Fici et al. recently introduced the notion of anti-powers in the context of combinatorics on words. A power (also called tandem repeat) is a sequence of consecutive identical blocks. An anti-power is a sequence of consecutive distinct blocks of the same length. Fici et al. showed that the existence of powers or anti-powers is an unavoidable regularity for sufficiently long words. In this thesis we explore this notion further in the context of binary words and obtain new results.

Description

Keywords

cobinatorics on words, ramsey theory, anti power

LC Keywords

Citation

URI

http://hdl.handle.net/10012/14974

Collections

Theses
Computer Science