Hardback : £85.79
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.
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.
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.
A comprehensive treatment of a fundamental tool for solving problems in computational and combinatorial geometry.
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
Review of the hardback: 'I am very impressed by the book and highly
recommend it to anyone who is interested in computational
geometry.' K. Kedem, The Computer Journal
|
Ask a Question About this Product More... |
|
