Home
»
Combinatorial Convexity
Combinatorial Convexity
Regular price
€58.99
603 verified reviews
100% verified
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
Shipping & Delivery
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
14-28 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
Close
A01=Imre Barany
Author_Imre Barany
Category=PBM
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Product details
- ISBN 9781470467098
- Weight: 294g
- Dimensions: 178 x 254mm
- Publication Date: 28 Feb 2022
- Publisher: American Mathematical Society
- Publication City/Country: US
- Product Form: Paperback
This book is about the combinatorial properties of convex sets, families of convex sets in finite dimensional Euclidean spaces, and finite points sets related to convexity. This area is classic, with theorems of Helly, Caratheodory, and Radon that go back more than a hundred years. At the same time, it is a modern and active field of research with recent results like Tverberg's theorem, the colourful versions of Helly and Caratheodory, and the $(p, q)$ theorem of Alon and Kleitman. As the title indicates, the topic is convexity and geometry, and is close to discrete mathematics. The questions considered are frequently of a combinatorial nature, and the proofs use ideas from geometry and are often combined with graph and hypergraph theory.
The book is intended for students (graduate and undergraduate alike), but postdocs and research mathematicians will also find it useful. It can be used as a textbook with short chapters, each suitable for a one- or two-hour lecture. Not much background is needed: basic linear algebra and elements of (hyper)graph theory as well as some mathematical maturity should suffice.
The book is intended for students (graduate and undergraduate alike), but postdocs and research mathematicians will also find it useful. It can be used as a textbook with short chapters, each suitable for a one- or two-hour lecture. Not much background is needed: basic linear algebra and elements of (hyper)graph theory as well as some mathematical maturity should suffice.
Imre Barany, Renyi Institute of Mathematics, Budapest, Hungary, and University College London, United Kingdom.
Combinatorial Convexity
€58.99
