Convex Polytopes
Convex Polytopes is a 1967 mathematics textbook. It was written by Branko Grünbaum.
- Written by
- Branko Grünbaum
All 3 facts, and where they come from
Facts
3 facts · 0 confirmed by two sources · 0 cited · 3 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 18, 2026 · revision 2401894111
- Described as
- 1967 mathematics textbook
- What it is
- written work
- Written by
- Branko Grünbaum
- Language
- English
- Wikipedias with a page
- 1
Wikidata item Q104852926 (wikidata.org/wiki/Q104852926), public domain (CC0). Copied 2026-11-18.
What Wikipedia says · copied November 18, 2026 · revision 1384469976
Convex Polytopes is a graduate-level mathematics textbook about convex polytopes, higher-dimensional generalizations of three-dimensional convex polyhedra. It was written by Branko Grünbaum, with contributions from Victor Klee, Micha Perles, and G. C. Shephard, and published in 1967 by John Wiley & Sons. It went out of print in 1970. A second edition, prepared with the assistance of Volker Kaibel, Victor Klee, and Günter M. Ziegler, was published by Springer-Verlag in 2003, as volume 221 of their book series Graduate Texts in Mathematics.
Convex Polytopes was the winner of the 2005 Leroy P. Steele Prize for mathematical exposition, given by the American Mathematical Society. The Basic Library List Committee of the Mathematical Association of America has recommended its inclusion in undergraduate mathematics libraries.
From the Wikipedia article “Convex Polytopes” (en.wikipedia.org/wiki/Convex_Polytopes), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-18; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
