Davenport-Schinzel Sequences and their Geometric Applications
- Publisher's listprice GBP 130.00
-
65 793 Ft (62 660 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 13 159 Ft off)
- Discounted price 52 634 Ft (50 128 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
65 793 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Cambridge University Press
- Date of Publication 26 May 1995
- ISBN 9780521470254
- Binding Hardback
- No. of pages388 pages
- Size 241x160x24 mm
- Weight 720 g
- Language English 0
Categories
Short description:
A comprehensive treatment of a fundamental tool for solving problems in computational and combinatorial geometry.
MoreLong description:
These sequences exhibit some surprising properties that make them a fascinating subject for research in combinatorial analysis. This 1995 book on the subject by two of its leading researchers will be an important resource for students and professionals in combinatorics, computational geometry and related fields.
Review of the hardback: 'This is a very well written and readable book suitable as a textbook for upper undergraduate and junior graduate students. It is entirely selfcontained.' European Mathematical Society Newsletter
Table of Contents:
1. Introduction; 2. Davenport-Schinzel sequences of order 3; 3. Higher order sequences; 4. Geometric realization; 5. Planar arrangements; 6. Algorithms for arrangements; 7. Arrangements in higher dimensions; 8. Geometric applications; Bibliography.
More
