Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
Explore this paper's citation graph
Summary
Sharp upper and lower bounds are obtained on the maximal length λs(n) of (n, s)-Davenport-Schinzel sequences, i.e., sequences composed of n symbols, having no two adjacent equal elements and containing no alternating subsequence of length s + 2.
- Type
- article
- Published
- 1989-11-01
- Cited by
- 181
- References
- 8
- OpenAlex
- https://openalex.org/W1998230386
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:9427723
Keywords
Combinatorics, Subsequence, Upper and lower bounds, Mathematics, Function (biology)
References
Cited by
- Two results on a partial ordering of finite sequences
- Enumerating Davenport-Schinzel sequences
- An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems
- Maximin location of convex objects in a polygon and related dynamic Voronoi diagrams
- Depth, crossings and conflicts in discrete geometry
- New combinatorial techniques for nonlinear orders
- Arrangements and their applications in robotics: recent developments
- Computing a Largest Empty Anchored Cylinder, and Related Problems
- Fat triangles determine linearly many holes (computational geometry)
- On critical orientations in the kedem-sharir motion planning algorithm
- Improved bounds on maximum sets of letters in sequences with forbidden alternations
- Complexity of a Single Face in an Arrangement of s-Intersecting Curves
- Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
- A Relationship Between Generalized Davenport-Schinzel Sequences and Interval Chains
- Bounds on extremal functions of forbidden patterns
- Obfuscated Drawings of Planar Graphs
- Sequences of formation width 4 and alternation length 5
- Almost tight upper bounds for the single cell and zone problems in three dimensions
- Extremal functions for sequences
- Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences
Related papers
- Summability of Subsequences and Rearrangements of Sequences
- Uniform subsequential estimates on weakly null sequences
- Subsequence principles for vector-valued random variables
- Regular methods of summability and the Banach-Saks property for double sequences
- Weakly null sequences with upper estimates
- A bounded sequence of normal functionals has a subsequence which is nearly weakly convergent
- An upper bound for the solving degree in terms of the degree of regularity
- Lower Bounds on the Complexity of 0-1-Valued Recursive Functions