Sharp Upper and Lower Bounds on the Length of General Davenport-Schinzel Sequences (Classic Reprint) - Softcover

Inhaltsangabe

Sharp upper and lower bounds for Davenport-Schinzel sequences, now with tighter results
This work presents new bounds for Davenport-Schinzel sequences, a key concept in computational geometry. It focuses on how long these sequences can be under various order constraints and what that means for related problems.

The authors generalize techniques to obtain tighter estimates for higher orders, including a detailed look at the order four case and extensions to larger orders. The approach uses decompositions, new function families tied to Ackermann’s function, and a careful inductive framework to bridge gaps between upper and lower bounds. The results highlight how sharp estimates influence the complexity of core geometric problems and related algorithms.

• Understand what Davenport-Schinzel sequences are and why they matter in geometry


• See how sequences can be decomposed into chains to study their length


• Learn about the role of Ackermann-type functions in deriving bounds


• Discover how these bounds translate into practical limits for geometric problems

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.