Peter Sarnak - Böcker

The theory of modular forms and especially the so-called 'Ramanujan Conjectures' have been applied to resolve problems in combinatorics, computer science, analysis and number theory. This tract, based on the Wittemore Lectures given at Yale University, is concerned with describing some of these applications. In order to keep the presentation reasonably self-contained, Professor Sarnak begins by developing the necessary background material in modular forms. He then considers the solution of three problems: the Ruziewicz problem concerning finitely additive rotationally invariant measures on the sphere; the explicit construction of highly connected but sparse graphs: 'expander graphs' and 'Ramanujan graphs'; and the Linnik problem concerning the distribution of integers that represent a given large integer as a sum of three squares. These applications are carried out in detail. The book therefore should be accessible to a wide audience of graduate students and researchers in mathematics and computer science.

The theory of modular forms and especially the so-called 'Ramanujan Conjectures' have been applied to resolve problems in combinatorics, computer science, analysis and number theory. This tract, based on the Wittemore Lectures given at Yale University, is concerned with describing some of these applications. In order to keep the presentation reasonably self-contained, Professor Sarnak begins by developing the necessary background material in modular forms. He then considers the solution of three problems: the Ruziewicz problem concerning finitely additive rotationally invariant measures on the sphere; the explicit construction of highly connected but sparse graphs: 'expander graphs' and 'Ramanujan graphs'; and the Linnik problem concerning the distribution of integers that represent a given large integer as a sum of three squares. These applications are carried out in detail. The book therefore should be accessible to a wide audience of graduate students and researchers in mathematics and computer science.

This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. The reader needs only a background in elementary algebra, analysis and combinatorics; the authors supply the necessary background material from graph theory, number theory, group theory and representation theory. The text can therefore be used as a brief introduction to these subjects as well as an illustration of how such topics are synthesised in modern mathematics.

This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. The reader needs only a background in elementary algebra, analysis and combinatorics; the authors supply the necessary background material from graph theory, number theory, group theory and representation theory. The text can therefore be used as a brief introduction to these subjects as well as an illustration of how such topics are synthesised in modern mathematics.

A renowned mathematician who considers himself both applied and theoretical in his approach, Peter Lax has spent most of his professional career at NYU, making significant contributions to both mathematics and computing. He has written several important published works and has received numerous honors including the National Medal of Science, the Lester R. Ford Award, the Chauvenet Prize, the Semmelweis Medal, the Wiener Prize, and the Wolf Prize. Several students he has mentored have become leaders in their fields.Two volumes span the years from 1952 up until 1999, and cover many varying topics, from functional analysis, partial differential equations, and numerical methods to conservation laws, integrable systems and scattering theory. After each paper, or collection of papers, is a commentary placing the paper in context and where relevant discussing more recent developments. Many of the papers in these volumes have become classics and should be read by any serious studentof these topics. In terms of insight, depth, and breadth, Lax has few equals. The reader of this selecta will quickly appreciate his brilliance as well as his masterful touch. Having this collection of papers in one place allows one to follow the evolution of his ideas and mathematical interests and to appreciate how many of these papers initiated topics that developed lives of their own.

A renowned mathematician who considers himself both applied and theoretical in his approach, Peter Lax has spent most of his professional career at NYU, making significant contributions to both mathematics and computing. He has written several important published works and has received numerous honors including the National Medal of Science, the Lester R. Ford Award, the Chauvenet Prize, the Semmelweis Medal, the Wiener Prize, and the Wolf Prize. Several students he has mentored have become leaders in their fields.Two volumes span the years from 1952 up until 1999, and cover many varying topics, from functional analysis, partial differential equations, and numerical methods to conservation laws, integrable systems and scattering theory. After each paper, or collection of papers, is a commentary placing the paper in context and where relevant discussing more recent developments. Many of the papers in these volumes have become classics and should be read by any serious studentof these topics. In terms of insight, depth, and breadth, Lax has few equals. The reader of this selecta will quickly appreciate his brilliance as well as his masterful touch. Having this collection of papers in one place allows one to follow the evolution of his ideas and mathematical interests and to appreciate how many of these papers initiated topics that developed lives of their own.

This volume contains the proceedings of the virtual workshop on Computational Aspects of Discrete Subgroups of Lie Groups, held from June 14 to June 18, 2021, and hosted by the Institute for Computational and Experimental Research in Mathematics (ICERM), Providence, Rhode Island.The major theme deals with a novel domain of computational algebra: the design, implementation, and application of algorithms based on matrix representation of groups and their geometric properties. It is centered on computing with discrete subgroups of Lie groups, which impacts many different areas of mathematics such as algebra, geometry, topology, and number theory. The workshop aimed to synergize independent strands in the area of computing with discrete subgroups of Lie groups, to facilitate solution of theoretical problems by means of recent advances in computational algebra.