No Nine Neighborly Tetrahedra Exist
Joseph Zaks
Jan 1991 · American Mathematical Society: Memoirs of the American Mathematical Society Book 447 · American Mathematical Soc.
Ebook
106
Pages
reportRatings and reviews aren’t verified Learn More
About this ebook
This book is devoted to a proof of the following problem of F Bagemihl (1956): What is the maximum number of tetrahedra in three-space such that every two of them meet in a two-dimensional set? Such families are called neighborly, Bagemihl presented an example of eight neighborly tetrahedra and showed that a neighborly family of tetrahedra contains at most seventeen members. This upper bound was reduced to nine in 1965. The question of whether or not there can be nine neighborly tetrahedra has been repeatedly mentioned in the literature since 1956. This book also treats the problem of the number of combinatorially different examples of eight neighborly tetrahedra. The author concludes by reproducing a proof that there can be at most fourteen tetrahedra in three-space such that every two tetrahedra are separated by a plane containing a facet of each of them. The book allows readers to follow the solution of this long-standing open problem by using various tools, including a few extensive computer searches.
Rate this ebook
Tell us what you think.
Reading information
Smartphones and tablets
Install the Google Play Books app for Android and iPad/iPhone. It syncs automatically with your account and allows you to read online or offline wherever you are.
Laptops and computers
You can listen to audiobooks purchased on Google Play using your computer's web browser.
eReaders and other devices
To read on e-ink devices like Kobo eReaders, you'll need to download a file and transfer it to your device. Follow the detailed Help Center instructions to transfer the files to supported eReaders.
