Combinatorics: Ancient & Modern

NOTE EDITORE

Who first presented Pascal's triangle? (It was not Pascal.) Who first presented Hamiltonian graphs? (It was not Hamilton.) Who first presented Steiner triple systems? (It was not Steiner.) The history of mathematics is a well-studied and vibrant area of research, with books and scholarly articles published on various aspects of the subject. Yet, the history of combinatorics seems to have been largely overlooked. This book goes some way to redress this and serves two main purposes: 1) it constitutes the first book-length survey of the history of combinatorics; and 2) it assembles, for the first time in a single source, researches on the history of combinatorics that would otherwise be inaccessible to the general reader. Individual chapters have been contributed by sixteen experts. The book opens with an introduction by Donald E. Knuth to two thousand years of combinatorics. This is followed by seven chapters on early combinatorics, leading from Indian and Chinese writings on permutations to late-Renaissance publications on the arithmetical triangle. The next seven chapters trace the subsequent story, from Euler's contributions to such wide-ranging topics as partitions, polyhedra, and latin squares to the 20th century advances in combinatorial set theory, enumeration, and graph theory. The book concludes with some combinatorial reflections by the distinguished combinatorialist, Peter J. Cameron. This book is not expected to be read from cover to cover, although it can be. Rather, it aims to serve as a valuable resource to a variety of audiences. Combinatorialists with little or no knowledge about the development of their subject will find the historical treatment stimulating. A historian of mathematics will view its assorted surveys as an encouragement for further research in combinatorics. The more general reader will discover an introduction to a fascinating and too little known subject that continues to stimulate and inspire the work of scholars today.

SOMMARIO

1 - Indian Combinatorics2 - China3 - Islamic Combinatorics4 - Jewish Combinatorics5 - Renaissance Combinatorics6 - The Origins of Modern Combinatorics7 - The Arithmetical Triangle8 - Early Graph Theory9 - Partitions10 - Block Designs11 - Latin Squares12 - Enumeration (18th-20th Centuries)13 - Combinatorial Set Theory14 - Modern Graph Theory

AUTORE

Robin Wilson is an Emeritus Professor of Pure Mathematics at the Open University, Emeritus Professor of Geometry at Gresham College, London, and a former Fellow of Keble College, Oxford. He was President of the British Society for the History of Mathematics from 2012 to 2014s. He has written and edited many books on graph theory, including Introduction to Graph Theory and Four Colours Suffice, and on the history of mathematics, including Lewis Carroll in Numberland. He is involved with the popularization and communication of mathematics and its history, and was awarded a Pólya prize by the Mathematical Association of America for 'outstanding expository writing'. John J. Watkins is an Emeritus Professor of Mathematics at Colorado College, USA. He received his doctorate from the University of Kansas, specializing in commutative ring theory. His main research interest, however, has been in graph theory and he has published mainly in this area, including many papers with undergraduates as co-authors. He has written several books, including Graphs: An Introductory Approach, Across the Board: The Mathematics of Chessboard Problems, and Topics in Commutative Ring Theory, and has recently finished his latest book, Elementary Number Theory. Colorado College presented John Watkins with the 2005 Boettcher Award for Faculty Excellence.

ALTRE INFORMAZIONI

• Condizione: Nuovo
• ISBN: 9780198739050
• Dimensioni: 234 x 20.6 x 160 mm Ø 588 gr
• Formato: Brossura
• Illustration Notes: 130 b/w line drawings, 20 b/w halftones
• Pagine Arabe: 392