Skip to main content

A Theorem of Johnson and Grunbaum

  • Chapter
  • 85 Accesses

Part of the book series: Texts and Readings in Mathematics ((TRM))

Abstract

In chapter 9, we gave a quick proof for the finiteness of the number of RFP. However, one has an enormous number of possibilities, with varied n-gons, that have to be discarded as non-existent (see table 9.1 with row numbers four, ten, and sixteen terminating respectively at the eleventh, twenty-ninth and forty-oneth place).

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   35.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Hindustan Book Agency

About this chapter

Cite this chapter

Rajwade, A.R. (2001). A Theorem of Johnson and Grunbaum. In: Convex Polyhedra with Regularity Conditions and Hilbert’s Third Problem. Texts and Readings in Mathematics. Hindustan Book Agency, Gurgaon. https://doi.org/10.1007/978-93-86279-06-4_11

Download citation

Publish with us

Policies and ethics