, Volume 6, Issue 2, pp 151–177

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

  • Sergiu Hart
  • Micha Sharir

DOI: 10.1007/BF02579170

Cite this article as:
Hart, S. & Sharir, M. Combinatorica (1986) 6: 151. doi:10.1007/BF02579170


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 ofn 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.

AMS subject classification (1980)

05 A 9905 C 3568 B 15

Copyright information

© Akadémiai Kiadó 1986

Authors and Affiliations

  • Sergiu Hart
    • 1
  • Micha Sharir
    • 1
  1. 1.School of Mathematical SciencesTel Aviv UniversityTel AvivIsrael