On Davenpoty-Schinzel sequence
Date of Publication
1998
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
A different kind of sequence was introduced in this study. A Davenport-Schinzel sequence is a finite sequence over n symbols with no immediate repetition of the same symbol which contain no five-term alternating subsequence, a...b...a...b...a... This study shows that s(n), which is the maximum length of a k-regular word w on n letters avoiding a forbidden word f, has an upper bound and its upper bound is linear if and only if the forbidden word avoids ababa.
Abstract Format
html
Language
English
Format
Accession Number
TU08305
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
64 leaves
Keywords
Sequences (Mathematics); Algebras, Linear; Group theory
Recommended Citation
Keng, J. T., & Uy, G. D. (1998). On Davenpoty-Schinzel sequence. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16445
