Improved lower bounds on the length of Davenport-Schinzel sequences (Q1119587): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:17, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved lower bounds on the length of Davenport-Schinzel sequences |
scientific article |
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
