Improved lower bounds on the length of Davenport-Schinzel sequences (Q1119587)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4099314
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved lower bounds on the length of Davenport-Schinzel sequences |
scientific article; zbMATH DE number 4099314 |
Statements
Improved lower bounds on the length of Davenport-Schinzel sequences (English)
0 references
1988
0 references
For the longest length of general Davenport-Schinzel sequences, i.e. sequences of n letters with no immediate repetitions and no subsequence of type a..b..a..b..a.. of length \(s+2\), the estimate \(\Omega (n\alpha^ s(n))\) is established, where \(\alpha\) (n) is the inverse of the Ackermann function. This improves earlier bounds. The proof uses generalized path compression schemes.
0 references
Davenport-Schinzel sequences
0 references
Ackermann function
0 references
generalized path compression schemes
0 references
0 references
0 references
0.9037508368492126
0 references
0.8870258927345276
0 references
0.8829913139343262
0 references
0.8769392371177673
0 references
0.8743900656700134
0 references
