论文信息 - Improved lower bounds on the length of Davenport-Schinzel sequences

Improved lower bounds on the length of Davenport-Schinzel sequences

We derive lower bounds on the maximal lengthλs(n) of (n, s) Davenport Schinzel sequences. These bounds have the form λ2s=1(n)=Ω(nαs(n)), whereα(n) is the extremely slowly growing functional inverse of the Ackermann function. These bounds extend the nonlinear lower boundλ3(n)=Ω(nα(n)) due to Hart and Sharir [5], and are obtained by an inductive construction based upon the construction given in [5].

Micha Sharir | M. Sharir

[1] Micha Sharir,et al. Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes , 1986, FOCS.

[2] Micha Sharir,et al. On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space , 1987, Discret. Comput. Geom..

[3] Mikhail J. Atallah,et al. Dynamic computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[4] E. Szemerédi. On a problem of Davenport and Schinzel , 1974 .

[5] H. Davenport,et al. A Combinatorial Problem Connected with Differential Equations , 1965 .

[6] Micha Sharir,et al. On the shortest paths between two convex polyhedra , 2018, JACM.

[7] Micha Sharir,et al. Almost linear upper bounds on the length of general davenport—schinzel sequences , 1987, Comb..

[8] H. Davenport. A combinatorial problem connected with differential equations II , 1971 .