Combinatorics: Ancient & Modern
OUP Oxford, 27 de juny 2013 - 381 pàgines
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.
Què opinen els usuaris - Escriviu una ressenya
No hem trobat cap ressenya als llocs habituals.
Altres edicions - Mostra-ho tot
Abraham de Moivre algebra algorithms Amer appeared Arabic arithmetical triangle arrangements Bernoulli binary binomial calculated Cardano Cayley century Chapter coefficients colours column combinatorial configurations Conjectandi conjecture construction contains corresponding diagram dice digits edges elements enumeration Erd˝os Euler example figurate numbers finite formula four four-colour G. H. Hardy geometry given number graph theory Ibn Mun↩im integers Jacob Bernoulli Kircher Kirkman later Leibniz letters lexicographic order Li Shanlan magic squares Math mathematician Mersenne method Moivre Montmort multiply N¯ar¯ayan.a number of combinations number of permutations obtained orthogonal latin squares pair paper Pascal plane of order polynomial possible prast¯ara projective plane proof proved published Redfield repetition result rule Sciences sequence solution solved squares of order Steiner triple systems subsets sudoku syllables Sylvester symbols theorem tions total number transversals treatise trees triple system variations vertex vertices wrote Yang Hui