Nonlinearity of davenport-Schinzel sequences and of generalized path compression schemes

Sergiu Hart*, Micha Sharir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

197 Scopus citations

Abstract

Davenport-Schinzel sequences are sequences that do not contain forbidden subsequences of alternating symbols. They arise in the computation of the envelope of a set of functions. We show that the maximal length of a Davenport-Schinzel sequence composed of n symbols is Θ (nα(n)), where α(n) is the functional inverse of Ackermann's function, and is thus very slowly increasing to infinity. This is achieved by establishing an equivalence between such sequences and generalized path compression schemes on rooted trees, and then by analyzing these schemes.

Original languageEnglish
Pages (from-to)151-177
Number of pages27
JournalCombinatorica
Volume6
Issue number2
DOIs
StatePublished - Jun 1986
Externally publishedYes

Keywords

  • AMS subject classification (1980): 05A99, 05C35, 68B15

Fingerprint

Dive into the research topics of 'Nonlinearity of davenport-Schinzel sequences and of generalized path compression schemes'. Together they form a unique fingerprint.

Cite this