Abstract is: 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.
P646 | Freebase ID | /m/04zzcvn |
P2812 | MathWorld ID | Davenport-SchinzelSequence |
P6366 | Microsoft Academic ID | 2778143808 |
P6104 | maintained by WikiProject | WikiProject Mathematics | Q8487137 |
Q1385023 | Harold Davenport | notable work | P800 |
Davenport–Schinzel sequence | wikipedia | |
Suite de Davenport-Schinzel | wikipedia | |
Последовательность Дэвенпорта — Шинцеля | wikipedia | |
達文波特-欣策爾序列 | wikipedia |
Search more.