|
|
|||
|
||||
OverviewHigh Quality Content by WIKIPEDIA articles! 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 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 Atallah (1985) these sequences and their length bounds have also become a standard tool in discrete geometry and in the analysis of geometric algorithms. Full Product DetailsAuthor: Lambert M. Surhone , Mariam T. Tennoe , Susan F. HenssonowPublisher: VDM Publishing House Imprint: VDM Publishing House Dimensions: Width: 22.90cm , Height: 0.40cm , Length: 15.20cm Weight: 0.125kg ISBN: 9786131255700ISBN 10: 6131255709 Pages: 76 Publication Date: 15 August 2010 Audience: General/trade , General Format: Paperback Publisher's Status: Active Availability: In Print This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |