On Davenpoty-Schinzel sequence
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 lengt...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1998
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16445 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-16958 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-169582022-02-12T00:58:05Z On Davenpoty-Schinzel sequence Keng, Jennifer T. Uy, Garen D. 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. 1998-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/16445 Bachelor's Theses English Animo Repository Sequences (Mathematics) Algebras, Linear Group theory |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| topic |
Sequences (Mathematics) Algebras, Linear Group theory |
| spellingShingle |
Sequences (Mathematics) Algebras, Linear Group theory Keng, Jennifer T. Uy, Garen D. On Davenpoty-Schinzel sequence |
| description |
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. |
| format |
text |
| author |
Keng, Jennifer T. Uy, Garen D. |
| author_facet |
Keng, Jennifer T. Uy, Garen D. |
| author_sort |
Keng, Jennifer T. |
| title |
On Davenpoty-Schinzel sequence |
| title_short |
On Davenpoty-Schinzel sequence |
| title_full |
On Davenpoty-Schinzel sequence |
| title_fullStr |
On Davenpoty-Schinzel sequence |
| title_full_unstemmed |
On Davenpoty-Schinzel sequence |
| title_sort |
on davenpoty-schinzel sequence |
| publisher |
Animo Repository |
| publishDate |
1998 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/16445 |
| _version_ |
1772835310396243968 |