Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
integer sequence
|
| gptkbp:application |
gptkb:geometry
analysis of lower envelopes |
| gptkbp:definedIn |
a sequence of symbols with restrictions on alternations between pairs of symbols
|
| gptkbp:field |
combinatorics
|
| gptkbp:generalizes |
forbidden subsequence problems
|
| https://www.w3.org/2000/01/rdf-schema#label |
Davenport–Schinzel sequence
|
| gptkbp:introducedIn |
1965
|
| gptkbp:maximumLength |
lambda_s(n) for order s and n symbols
|
| gptkbp:namedAfter |
gptkb:Harold_Davenport
gptkb:André_Schinzel |
| gptkbp:order |
parameter s in the definition
|
| gptkbp:property |
no subsequence of the form a...b...a...b...a of length s+2 for order s
no two adjacent elements are equal |
| gptkbp:relatedTo |
arrangements of curves
envelope complexity |
| gptkbp:symbolSetSize |
parameter n in the definition
|
| gptkbp:usedIn |
bounding the complexity of lower envelopes of functions
analyzing geometric algorithms |
| gptkbp:bfsParent |
gptkb:Harold_Davenport
|
| gptkbp:bfsLayer |
6
|