Davenport-Schinzel sequences and their geometric applications

TLDR: A close to linear bound on the maximum length of Davenport--Schinzel sequences enable us to derive sharp bounds on the combinatorial structure underlying various geometric problems, which in turn yields efficient algorithms for these problems.

Abstract: An $(n,s)$ Davenport--Schinzel sequence, for positive integers $n$ and $s$, is a sequence composed of $n$ symbols with the properties that no two adjacent elements are equal, and that it does not contain, as a (possibly non-contiguous) subsequence, any alternation $a \cdots b \cdots a \cdots b \cdots$ of length $s+2$ between two distinct symbols $a$ and $b$. The close relationship between Davenport--Schinzel sequences and the combinatorial structure of lower envelopes of collections of functions make the sequences very attractive, because a wide variety of geometric problems can be formulated in terms of lower envelopes. A close to linear bound on the maximum length of Davenport--Schinzel sequences enable us to derive sharp bounds on the combinatorial structure underlying various geometric problems, which in turn yields efficient algorithms for these problems. This paper gives a comprehensive survey on the theory of Davenport--Schinzel sequences and their geometric applications.