Construct · 1 fields · 1 citations

Davenport-Schinzel sequence: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational geometry

a sequence with no long alternation between two symbols, whose maximum length bounds the complexity of lower envelopes of curves.

In computational geometry, Davenport-Schinzel sequence refers to a sequence with no long alternation between two symbols, whose maximum length bounds the complexity of lower envelopes of curves. This meaning comes from Davenport (1965) in American Journal of Mathematics.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Davenport-Schinzel sequence sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

complexity4 fields · 7 citationsjingle · one word, four constructs sequence3 fields · 3 citationsjingle · one word, three constructs

References

Davenport, H., & Schinzel, A. (1965). A Combinatorial Problem Connected with Differential Equations. American Journal of Mathematics, 87(3), 684. https://doi.org/10.2307/2373068

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct