The Four-Color Theorem: History, Topological Foundations, and Idea of Proof
Autor Rudolf Fritsch Traducere de J.lie Peschke Autor Gerda Fritschen Limba Engleză Paperback – 23 oct 2012
Preț: 388.54 lei
Puncte Express: 583
Carte tipărită la comandă
Livrare economică 21 septembrie-05 octombrie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9781461272540
ISBN-10: 1461272548
Pagini: 280
Ilustrații: XVI, 260 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.4 kg
Ediția:Softcover reprint of the original 1st ed. 1998
Editura: Springer
Colecția Springer
Locul publicării:New York, NY, United States
ISBN-10: 1461272548
Pagini: 280
Ilustrații: XVI, 260 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.4 kg
Ediția:Softcover reprint of the original 1st ed. 1998
Editura: Springer
Colecția Springer
Locul publicării:New York, NY, United States
Public țintă
Professional/practitionerCuprins
1 History.- 2 (Topological) Maps.- 3 The Four-Color Theorem (Topological Version).- 4 Topology to Combinatorics.- 5 The Four-Color Theorem (Combinatorial Version).- 6 Reducibility.- 7 The Quest for Unavoidable Sets.- Works of Reference.
Textul de pe ultima copertă
This elegant little book discusses a famous problem that helped to define the field now known as graph theory: what is the minimum number of colors required to print a map such that no two adjoining countries have the same color, no matter how convoluted their boundaries are. Many famous mathematicians have worked on the problem, but the proof eluded formulation until the 1970s, when it was finally cracked with a brute-force approach using a computer. The Four-Color Theorem begins by discussing the history of the problem up to the new approach given in the 1990s (by Neil Robertson, Daniel Sanders, Paul Seymour, and Robin Thomas). The book then goes into the mathematics, with a detailed discussion of how to convert the originally topological problem into a combinatorial one that is both elementary enough that anyone with a basic knowledge of geometry can follow it and also rigorous enough that a mathematician can read it with satisfaction. The authors discuss the mathematics and point to the philosophical debate that ensued when the proof was announced: just what is a mathematical proof, if it takes a computer to provide one - and is such a thing a proof at all?
Descriere
Descriere de la o altă ediție sau format:
This book discusses a famous problem that helped to define the field now known as topology: What is the minimum number of colors required to print a map so that no two adjoining countries have the same color? This problem remained unsolved until the 1950s, when it was finally cracked using a computer. This book discusses the history and mathematics of the problem, as well as the philosophical debate which ensued, regarding the validity of computer generated proofs.
This book discusses a famous problem that helped to define the field now known as topology: What is the minimum number of colors required to print a map so that no two adjoining countries have the same color? This problem remained unsolved until the 1950s, when it was finally cracked using a computer. This book discusses the history and mathematics of the problem, as well as the philosophical debate which ensued, regarding the validity of computer generated proofs.