Combinatorial convexity
by Bárány, Imre
"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, Carathéodory, 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 Carathéodory, and the (p, q) theorem of Alon and Kleitman. As the title …
Read More ↓Title Statements
- Full title :Combinatorial convexity / Imre Bárány.
Summary
"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, Carathéodory, 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 Carathéodory, 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"--Provided by publisher.
Read More ↓Edition Statements
- Publication Date:©2021
Publication Statements
- Publisher(s):American mathematical Society
- Place of Publication:Providence, Rhode Island
- Language:eng
- Publication Date:©2021
The Physical Object
- Description:1 online resource (viii, 148 pages) : : illustrations (some color)
Edition Identifiers
- ISBN:9781470467685, 1470467682
- oclc:on1284288809
- LC Classification:QA640
- Dewey Decimal:516/.08
Table of Contents
Cover -- Title page -- Copyright -- Contents -- Preface -- Basic concepts -- Carathéodory's theorem -- Radon's theorem -- Topological Radon -- Tverberg's theorem -- General position -- Helly's theorem -- Applications of Helly's theorem -- Fractional Helly -- Colourful Carathéodory -- Colourful Carathéodory again -- Colourful Helly -- Tverberg's theorem again -- Colourful Tverberg theorem -- Sarkaria and Kirchberger generalized -- The Erdős-Szekers theorem -- The same type lemma -- Better bound for the Erdős-Szekeres number -- Covering number, planar case -- The stretched grid
Covering number, general case -- Upper bound on the covering number -- The point selection theorem -- Homogeneous selection -- Missing few simplices -- Weak -nets -- Lower bound on the size of weak -nets -- The ( , ) theorem -- The colourful ( , ) theorem -- intervals -- Halving lines, havling planes -- Convex lattice sets -- Fractional Helly for convex lattice sets -- Bibliography -- Index -- Back Cover
Subjects
Writers
More from this Series
No reviews yet. Be the first to rate this work.
Related Works
more →
Combinatorics
Integer Programming and Combinatorial Optimization
Combinatorial games
Handbook of discrete and computational geometry
Rate & Review