Davenport–Schinzel sequence explained

In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited. The maximum possible length of a Davenport–Schinzel sequence is bounded by the number of its distinct symbols multiplied by a small but nonconstant factor that depends on the number of alternations that are allowed. Davenport–Schinzel sequences were first defined in 1965 by Harold Davenport and Andrzej Schinzel to analyze linear differential equations. Following these sequences and their length bounds have also become a standard tool in discrete geometry and in the analysis of geometric algorithms.^[1]

Definition

A finite sequence U = u₁, u₂, u₃, is said to be a Davenport–Schinzel sequence of order s if it satisfies the following two properties:

1. No two consecutive values in the sequence are equal to each other.
2. If x and y are two distinct values occurring in the sequence, then the sequence does not contain a subsequence ... x, ... y, ..., x, ..., y, ... consisting of s + 2 values alternating between x and y.

For instance, the sequence

1, 2, 1, 3, 1, 3, 2, 4, 5, 4, 5, 2, 3is a Davenport–Schinzel sequence of order 3: it contains alternating subsequences of length four, such as ...1, ... 2, ... 1, ... 2, ... (which appears in four different ways as a subsequence of the whole sequence) but it does not contain any alternating subsequences of length five.

If a Davenport–Schinzel sequence of order s includes n distinct values, it is called an (n,s) Davenport–Schinzel sequence, or a DS(n,s)-sequence.^[2]

Length bounds

The complexity of DS(n,s)-sequence has been analyzed asymptotically in the limit as n goes to infinity, with the assumption that s is a fixed constant, and nearly tight bounds are known for all s. Let λ_s(n) denote the length of the longest DS(n,s)-sequence. The best bounds known on λ_s involve the inverse Ackermann function

α(n) = min,where A is the Ackermann function. Due to the very rapid growth of the Ackermann function, its inverse α grows very slowly, and is at most four for problems of any practical size.^[3]

Using big O and big Θ notation, the following bounds are known:

λ _{0(n)=1} .λ _{1(n)=n} .^[4] λ _{2(n)=2n-1} .λ _{3(n)} = 2 n\alpha(n) + O(n) .^[5] This complexity bound can be realized to within a factor of 2 by line segments: there exist arrangements of n line segments in the plane whose lower envelopes have complexity Ω(n α(n)).^[6] λ _{4(n)} = \Theta(n 2 ^{\alpha(n)} ) .^[7] λ _{5(n)} = \Theta(n\alpha(n) 2 ^{\alpha(n)} ) .^[8]

• For both even and odd values of s ≥ 6,

λ _{s(n)=n ⋅} 2 ^{(1)/(\alpha(n) ^{t} + O(\alpha(n) ^{t-1} ) t!)} , where t = \left\lfloor (s -2)/(2) \right\rfloor .^[9]

The value of λ_s(n) is also known when s is variable but n is a small constant:^[10]

λ _{s(1)=1} λ _{s(2)=s+1} λ _{s(3)=3s-2+(s} \bmod 2 ) λ _{s(4)=6s-2+(s} \bmod 2 ).

When s is a function of n the upper and lower bounds on Davenport-Schinzel sequences are not tight.

• When

s > n ^{1/t} (t -1 )! , λ _{s(n)} = \Omega(n ^{2s/(t-1)!)} and λ _{s(n)} = O(n ^{2s)} .^[11]

• When

loglog n < s = n ^{o(1)} , λ _{s(n)} = \Omega\left(n\left( (s)/(2loglog _{s} n) \right) ^{loglog _{s} n} \right) .^[12]

• When

s \le loglog n , λ _{s(n)} = \Omega(n 2 ^{s)} .^[13]

Application to lower envelopes

The lower envelope of a set of functions ƒ_i(x) of a real variable x is the function given by their pointwise minimum:

ƒ(x) = min_iƒ_i(x).Suppose that these functions are particularly well behaved: they are all continuous, and any two of them are equal on at most s values. With these assumptions, the real line can be partitioned into finitely many intervals within which one function has values smaller than all of the other functions. The sequence of these intervals, labeled by the minimizing function within each interval, forms a Davenport–Schinzel sequence of order s. Thus, any upper bound on the complexity of a Davenport–Schinzel sequence of this order also bounds the number of intervals in this representation of the lower envelope.

In the original application of Davenport and Schinzel, the functions under consideration were a set of different solutions to the same homogeneous linear differential equation of order s. Any two distinct solutions can have at most s values in common, so the lower envelope of a set of n distinct solutions forms a DS(n,s)-sequence.

The same concept of a lower envelope can also be applied to functions that are only piecewise continuous or that are defined only over intervals of the real line; however, in this case, the points of discontinuity of the functions and the endpoints of the interval within which each function is defined add to the order of the sequence. For instance, a non-vertical line segment in the plane can be interpreted as the graph of a function mapping an interval of x values to their corresponding y values, and the lower envelope of a collection of line segments forms a Davenport–Schinzel sequence of order three because any two line segments can form an alternating subsequence with length at most four.

See also

• Squarefree word

References

• .
• .
• .
• .
• .
• .
• .
• .
• .
• .
• .
• .
• .
• .
• .

External links

• Davenport-Schinzel Sequence, from MathWorld.
• Davenport-Schinzel Sequences, a section in the book Motion Planning, by Steven M. LaValle.

Notes and References

1. , pp. x and 2.
2. See, p. 1, for this notation.
3. , p. 14.
4. , p. 6.
5. , Chapter 2, pp. 12–42; ; ; ; ; .
6. , Chapter 4, pp. 86–114; .
7. , Chapter 3, pp. 43–85; ; ; .
8. .
9. , Chapter 3, pp. 43–85; ; ; .
10. .

11. .

12. .
13. .