The book presents the winners of the Abel Prize in mathematics for the period 2018-2022: - Robert P. Langlands (2018) - Karen K. Uhlenbeck (2019) - Hillel Furstenberg and Gregory Margulis (2020) - Lászlo Lóvász and Avi Wigderson (2021) - Dennis P. Sullivan (2022) The profiles feature autobiographical information as well as a scholarly description of each mathematician’s work. In addition, each profile contains a Curriculum Vitae, a complete bibliography, and the full citation from the prize committee. The book also includes photos from the period 2018-2022 showing many of the additional activities connected with the Abel Prize. This book follows on The Abel Prize: 2003-2007. The First Five Years (Springer, 2010) and The Abel Prize 2008-2012 (Springer, 2014) as well as on The Abel Prize 2013-2017 (Springer, 2019), which profile the previous Abel Prize laureates.
The book presents the winners of the Abel Prize in mathematics for the period 2013–17: Pierre Deligne (2013); Yakov G. Sinai (2014); John Nash Jr. and Louis Nirenberg (2015); Sir Andrew Wiles (2016); and Yves Meyer (2017). The profiles feature autobiographical information as well as a scholarly description of each mathematician’s work. In addition, each profile contains a Curriculum Vitae, a complete bibliography, and the full citation from the prize committee. The book also includes photos for the period 2003–2017 showing many of the additional activities connected with the Abel Prize. As an added feature, video interviews with the Laureates as well as videos from the prize ceremony are provided at an accompanying website (http://extras.springer.com/). This book follows on The Abel Prize: 2003-2007. The First Five Years (Springer, 2010) and The Abel Prize 2008-2012 (Springer 2014), which profile the work of the previous Abel Prize winners.
The book presents the winners of the first five Abel Prizes in mathematics: 2003 Jean-Pierre Serre; 2004 Sir Michael Atiyah and Isadore Singer; 2005 Peter D. Lax; 2006 Lennart Carleson; and 2007 S.R. Srinivasa Varadhan. Each laureate provides an autobiography or an interview, a curriculum vitae, and a complete bibliography. This is complemented by a scholarly description of their work written by leading experts in the field and by a brief history of the Abel Prize. Interviews with the laureates can be found at http://extras.springer.com .
Covering the years 2008-2012, this book profiles the life and work of recent winners of the Abel Prize: · John G. Thompson and Jacques Tits, 2008 · Mikhail Gromov, 2009 · John T. Tate Jr., 2010 · John W. Milnor, 2011 · Endre Szemerédi, 2012. The profiles feature autobiographical information as well as a description of each mathematician's work. In addition, each profile contains a complete bibliography, a curriculum vitae, as well as photos — old and new. As an added feature, interviews with the Laureates are presented on an accompanying web site (http://extras.springer.com/). The book also presents a history of the Abel Prize written by the historian Kim Helsvig, and includes a facsimile of a letter from Niels Henrik Abel, which is transcribed, translated into English, and placed into historical perspective by Christian Skau. This book follows on The Abel Prize: 2003-2007, The First Five Years (Springer, 2010), which profiles the work of the first Abel Prize winners.
A unique series of fascinating research papers on subjects related to the work of Niels Henrik Abel, written by some of the foremost specialists in their fields. Some of the authors have been specifically invited to present papers, discussing the influence of Abel in a mathematical-historical context. Others have submitted papers presented at the Abel Bicentennial Conference, Oslo June 3-8, 2002. The idea behind the book has been to produce a text covering a substantial part of the legacy of Abel, as perceived at the beginning of the 21st century.
From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography
Robert Langlands formulated his celebrated conjectures, initiating the Langlands Program, at the age of 31, profoundly changing the landscape of mathematics. Langlands, recipient of the Abel Prize, is famous for his insight in discovering links among seemingly dissimilar objects, leading to astounding results. This book is uniquely designed to serve a wide range of mathematicians and advanced students, showcasing Langlands' unique creativity and guiding readers through the areas of Langlands' work that are generally regarded as technical and difficult to penetrate. Part 1 features non-technical personal reflections, including Langlands' own words describing how and why he was led to formulate his conjectures. Part 2 includes survey articles of Langlands' early work that led to his conjectures, and centers on his principle of functoriality and foundational work on the Eisenstein series, and is accessible to mathematicians from other fields. Part 3 describes some of Langlands' contributions to mathematical physics.
This edited volume offers a detailed account of the theory of directed graphs from the perspective of important classes of digraphs, with each chapter written by experts on the topic. Outlining fundamental discoveries and new results obtained over recent years, this book provides a comprehensive overview of the latest research in the field. It covers core new results on each of the classes discussed, including chapters on tournaments, planar digraphs, acyclic digraphs, Euler digraphs, graph products, directed width parameters, and algorithms. Detailed indices ease navigation while more than 120 open problems and conjectures ensure that readers are immersed in all aspects of the field. Classes of Directed Graphs provides a valuable reference for graduate students and researchers in computer science, mathematics and operations research. As digraphs are an important modelling tool in other areas of research, this book will also be a useful resource to researchers working in bioinformatics, chemoinformatics, sociology, physics, medicine, etc.
This book provides an introduction to hypergraphs, its aim being to overcome the lack of recent manuscripts on this theory. In the literature hypergraphs have many other names such as set systems and families of sets. This work presents the theory of hypergraphs in its most original aspects, while also introducing and assessing the latest concepts on hypergraphs. The variety of topics, their originality and novelty are intended to help readers better understand the hypergraphs in all their diversity in order to perceive their value and power as mathematical tools. This book will be a great asset to upper-level undergraduate and graduate students in computer science and mathematics. It has been the subject of an annual Master's course for many years, making it also ideally suited to Master's students in computer science, mathematics, bioinformatics, engineering, chemistry, and many other fields. It will also benefit scientists, engineers and anyone else who wants to understand hypergraphs theory.
