|
Norman L. Biggs
Norman Linstead Biggs (born 2 January 1941) is a leading British mathematician focusing on discrete mathematics and in particular algebraic combinatorics.[1] EducationBiggs was educated at Harrow County Grammar School and then studied mathematics at Selwyn College, Cambridge. In 1962, Biggs gained first-class honours in his third year of the university's undergraduate degree in mathematics.[2]
CareerHe was a lecturer at University of Southampton, lecturer then reader at Royal Holloway, University of London, and Professor of Mathematics at the London School of Economics. He has been on the editorial board of a number of journals, including the Journal of Algebraic Combinatorics. He has been a member of the Council of the London Mathematical Society. He has written 12 books and over 100 papers on mathematical topics, many of them in algebraic combinatorics and its applications. He became Emeritus Professor in 2006 and continues to teach History of Mathematics in Finance and Economics for undergraduates. He is also vice-president of the British Society for the History of Mathematics. FamilyBiggs married Christine Mary Farmer in 1975 and has one daughter Clare Juliet born in 1980. Interests and HobbiesBiggs' interests include computational learning theory, the history of mathematics and historical metrology. Since 2006, he has been an emeritus professor at the London School of Economics. Biggs hobbies consist of writing about the history of weights and scales. He currently holds the position of Chair of the International Society of Antique Scale Collectors (Europe), and a member of the British Numismatic Society. WorkMathematicsIn 2002, Biggs wrote the second edition of Discrete Mathematics breaking down a wide range of topics into a clear and organised style. Biggs organised the book into four major sections; The Language of Mathematics, Techniques, Algorithms and Graphs, and Algebraic Methods. This book was an accumulation of Discrete Mathematics, first edition, textbook published in 1985 which dealt with calculations involving a finite number of steps rather than limiting processes. The second edition added nine new introductory chapters; Fundamental language of mathematicians, statements and proofs, the logical framework, sets and functions, and number system. This book stresses the significance of simple logical reasoning, shown by the exercises and examples given in the book. Each chapter contains modelled solutions, examples, exercises including hints and answers.[3] Algebraic Graph TheoryIn 1974, Biggs published Algebraic Graph Theory which articulates properties of graphs in algebraic terms, then works out theorems regarding them. In the first section, he tackles the applications of linear algebra and matrix theory; algebraic constructions such as adjacency matrix and the incidence matrix and their applications are discussed in depth. Next, there is and wide-ranging description of the theory of chromatic polynomials. The last section discusses symmetry and regularity properties. Biggs makes important connections with other branches of algebraic combinatorics and group theory.[4] Computational Learning TheoryIn 1997, N. Biggs and M. Anthony wrote a book titled Computational Learning Theory: an Introduction. Both Biggs and Anthony focused on the necessary background material from logic, probability, and complex theory. This book is an introduction to computational learning. History of MathematicsBiggs contributed to thirteen journals and books developing topics such as the four-colour conjecture, the roots/history of combinatorics, calculus, Topology on the 19th century, and mathematicians.[5] In addition, Biggs examined the ideas of William Ludlam, Thomas Harriot, John Arbuthnot, and Leonhard Euler.[6] Chip-Firing GameThe chip-firing game has been around for less than 20 years. It has become an important part of the study of structural combinatorics. The set of configurations that are stable and recurrent for this game can be given the structure of an abelian group. In addition, the order of the group is equal to the tree number of the graph.[7][8] PublicationsSummary of Biggs' published Books on Mathematics
Summary of Biggs' latest published Papers on Mathematics2000
2001
2002
2004
2005
2007
2008
2009
2010
2011
For other published work on the history of mathematics, please see.[11] See alsoReferences
External links
|
Portal di Ensiklopedia Dunia
