Powers and Anti-Powers in Binary Words
dc.contributor.author | Riasat, Samin | |
dc.date.accessioned | 2019-08-28T15:44:11Z | |
dc.date.available | 2019-08-28T15:44:11Z | |
dc.date.issued | 2019-08-28 | |
dc.date.submitted | 2019-08-15 | |
dc.description.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. | en |
dc.identifier.uri | http://hdl.handle.net/10012/14974 | |
dc.language.iso | en | en |
dc.pending | false | |
dc.publisher | University of Waterloo | en |
dc.subject | cobinatorics on words | en |
dc.subject | ramsey theory | en |
dc.subject | anti power | en |
dc.title | Powers and Anti-Powers in Binary Words | en |
dc.type | Master Thesis | en |
uws-etd.degree | Master of Mathematics | en |
uws-etd.degree.department | David R. Cheriton School of Computer Science | en |
uws-etd.degree.discipline | Computer Science | en |
uws-etd.degree.grantor | University of Waterloo | en |
uws.contributor.advisor | Shallit, Jeffrey | |
uws.contributor.affiliation1 | Faculty of Mathematics | en |
uws.peerReviewStatus | Unreviewed | en |
uws.published.city | Waterloo | en |
uws.published.country | Canada | en |
uws.published.province | Ontario | en |
uws.scholarLevel | Graduate | en |
uws.typeOfResource | Text | en |