Davenport–Schinzel sequence
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.
known for
Wikipage redirect
Accrington_AcademyAndrzej SchinzelArrangement of linesDavenport-Schinzel sequenceDavenport–Schinzel Sequences and Their Geometric ApplicationsDisjoint-set data structureHarold DavenportKinetic hangerKinetic heaterKinetic priority queueKinetic tournamentKinetic triangulationList of books in computational geometryLower envelopePankaj K. AgarwalTimeline of Polish science and technologyVisibility polygon
Link from a Wikipage to another Wikipage
known for
primaryTopic
Davenport–Schinzel sequence
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.
has abstract
En combinatoire, une suite de ...... des algorithmes géométriques.
@fr
In combinatorics, a Davenport– ...... lysis of geometric algorithms.
@en
В комбинаторике последовательн ...... изе геометрических алгоритмов.
@ru
在组合数学中,達文波特–欣策爾序列是指对任意两个符号交替出现 ...... 继 ) 一文之后成为了离散几何与几何算法分析领域的标准工具。
@zh
Link from a Wikipage to an external page
Wikipage page ID
20,232,529
page length (characters) of wiki page
Wikipage revision ID
1,024,617,569
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
En combinatoire, une suite de ...... des algorithmes géométriques.
@fr
In combinatorics, a Davenport– ...... lysis of geometric algorithms.
@en
В комбинаторике последовательн ...... изе геометрических алгоритмов.
@ru
在组合数学中,達文波特–欣策爾序列是指对任意两个符号交替出现 ...... 继 ) 一文之后成为了离散几何与几何算法分析领域的标准工具。
@zh
label
Davenport–Schinzel sequence
@en
Suite de Davenport-Schinzel
@fr
Последовательность Дэвенпорта — Шинцеля
@ru
達文波特-欣策爾序列
@zh