No Nine Neighborly Tetrahedra Exist
Joseph Zaks
Jan 1991 · American Mathematical Society: Memoirs of the American Mathematical Society Kitabu cha 447 · American Mathematical Soc.
Kitabu pepe
106
Kurasa
reportUkadiriaji na maoni hayajahakikishwa Pata Maelezo Zaidi
Kuhusu kitabu pepe hiki
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.
Kadiria kitabu pepe hiki
Tupe maoni yako.
Kusoma maelezo
Simu mahiri na kompyuta vibao
Sakinisha programu ya Vitabu vya Google Play kwa ajili ya Android na iPad au iPhone. Itasawazishwa kiotomatiki kwenye akaunti yako na kukuruhusu usome vitabu mtandaoni au nje ya mtandao popote ulipo.
Kompyuta za kupakata na kompyuta
Unaweza kusikiliza vitabu vilivyonunuliwa kwenye Google Play wakati unatumia kivinjari cha kompyuta yako.
Visomaji pepe na vifaa vingine
Ili usome kwenye vifaa vya wino pepe kama vile visomaji vya vitabu pepe vya Kobo, utahitaji kupakua faili kisha ulihamishie kwenye kifaa chako. Fuatilia maagizo ya kina ya Kituo cha Usaidizi ili uhamishe faili kwenye visomaji vya vitabu pepe vinavyotumika.
