Computational investigations of non-repetitive sequences

Simple item page
dc.contributor.advisorSchatz, Joseph
dc.contributor.committeeMemberSchmidt, Jürgen
dc.contributor.committeeMemberWalker, Robert H.
dc.creatorDoyle, Jon
dc.date.accessioned2022-01-25T15:45:49Z
dc.date.available2022-01-25T15:45:49Z
dc.date.issued1974
dc.description.abstractThe need for infinite sequences of symbols with no repetitions seems to have arisen frequently. In view of previous findings about non-repetitive sequences, this paper considers the question whether for some positive integer n, there exists an infinite sequence on two symbols with no three adjacent identical blocks of symbols and no two adjacent identical blocks of symbols of length n or greater. The first result obtained is a lower bound of 4 for the value of n. This is followed by the computation of a 5000-term sequence on two symbols with no three adjacent identical blocks of symbols and no two adjacent identical blocks of symbols of length 4 or greater, evidence which suggests the conjecture that 4 is the greatest lower bound for n. A computation is then performed, the result of which suggests that the traditional methods used in studying nonrepetitive sequences may not be practical for use in determining the status of the above conjecture. Some new concepts and questions are then introduced as aids which may prove useful in further study of this conjecture.
dc.description.departmentMathematics, Department of
dc.format.digitalOriginreformatted digital
dc.format.mimetypeapplication/pdf
dc.identifier.other14073009
dc.identifier.urihttps://hdl.handle.net/10657/8527
dc.language.isoen
dc.relation.ispartofSenior Honors Theses
dc.rightsThis item is protected by copyright but is made available here under a claim of fair use (17 U.S.C. §107) for non-profit research and educational purposes. Users of this work assume the responsibility for determining copyright status prior to reusing, publishing, or reproducing this item for purposes other than what is allowed by fair use or other copyright exemptions. Any reuse of this item in excess of fair use or other copyright exemptions requires express permission of the copyright holder.
dc.titleComputational investigations of non-repetitive sequences
dc.type.dcmiText
dc.type.genreThesis
thesis.degree.collegeCollege of Natural Sciences and Mathematics
thesis.degree.departmentMathematics, Department of
thesis.degree.disciplineMathematics
thesis.degree.grantorUniversity of Houston

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Doyle_1974_14073009.pdf
Size:
5.6 MB
Format:
Adobe Portable Document Format
Download

Collections

Legacy Theses and Dissertations (1940-2009)