Describes how to use coherent sheaves and cohomology to prove combinatorial and number theoretical identities over finite fields.

Algebraic varieties are shapes defined by polynomial equations. Smooth Fano threefolds are a fundamental subclass that can be thought of as higher-dimensional generalizations of ordinary spheres. They belong to 105 irreducible deformation families. This book determines whether the general element of each family admits a Kähler–Einstein metric (and for many families, for all elements), addressing a question going back to Calabi 70 years ago. The book's solution exploits the relation between these metrics and the algebraic notion of K-stability. Moreover, the book presents many different techniques to prove the existence of a Kähler–Einstein metric, containing many additional relevant results such as the classification of all Kähler–Einstein smooth Fano threefolds with infinite automorphism groups and computations of delta-invariants of all smooth del Pezzo surfaces. This book will be essential reading for researchers and graduate students working on algebraic geometry and complex geometry.

Written in celebration of Miles Reid's 70th birthday, this illuminating volume contains 11 papers by leading mathematicians in and around algebraic geometry, broadly related to the themes and interests of Reid's varied career. Just as in Reid's own scientific output, some of the papers give comprehensive accounts of the state of the art of foundational matters, while others give expositions of subject areas or techniques in concrete terms. Reid has been one of the major expositors of algebraic geometry and a great influence on many in this field – this book hopes to inspire a new generation of graduate students and researchers in his tradition.

Automatic sequences are sequences over a finite alphabet generated by a finite-state machine. This book presents a novel viewpoint on automatic sequences, and more generally on combinatorics on words, by introducing a decision method through which many new results in combinatorics and number theory can be automatically proved or disproved with little or no human intervention. This approach to proving theorems is extremely powerful, allowing long and error-prone case-based arguments to be replaced by simple computations. Readers will learn how to phrase their desired results in first-order logic, using free software to automate the computation process. Results that normally require multipage proofs can emerge in milliseconds, allowing users to engage with mathematical questions that would otherwise be difficult to solve. With more than 150 exercises included, this text is an ideal resource for researchers, graduate students, and advanced undergraduates studying combinatorics, sequences, and number theory.

Presenting the basics of elliptic PDEs in connection with regularity theory, the book bridges fundamental breakthroughs – such as the Krylov–Safonov and Evans–Krylov results, Caffarelli's regularity theory, and the counterexamples due to Nadirashvili and Vlăduţ – and modern developments, including improved regularity for flat solutions and the partial regularity result. After presenting this general panorama, accounting for the subtleties surrounding C-viscosity and Lp-viscosity solutions, the book examines important models through approximation methods. The analysis continues with the asymptotic approach, based on the recession operator. After that, approximation techniques produce a regularity theory for the Isaacs equation, in Sobolev and Hölder spaces. Although the Isaacs operator lacks convexity, approximation methods are capable of producing Hölder continuity for the Hessian of the solutions by connecting the problem with a Bellman equation. To complete the book, degenerate models are studied and their optimal regularity is described.

Since their introduction by Gromov in the 1980s, the study of bounded cohomology and simplicial volume has developed into an active field connected to geometry and group theory. This monograph, arising from a learning seminar for young researchers working in the area, provides a collection of different perspectives on the subject, both classical and recent. The book's introduction presents the main definitions of the theories of bounded cohomology and simplicial volume, outlines their history, and explains their principal motivations and applications. Individual chapters then present different aspects of the theory, with a focus on examples. Detailed references to foundational papers and the latest research are given for readers wishing to dig deeper. The prerequisites are only basic knowledge of classical algebraic topology and of group theory, and the presentations are gentle and informal in order to be accessible to beginning graduate students wanting to enter this lively and topical field.

Discrete quantum walks are quantum analogues of classical random walks. They are an important tool in quantum computing and a number of algorithms can be viewed as discrete quantum walks, in particular Grover's search algorithm. These walks are constructed on an underlying graph, and so there is a relation between properties of walks and properties of the graph. This book studies the mathematical problems that arise from this connection, and the different classes of walks that arise. Written at a level suitable for graduate students in mathematics, the only prerequisites are linear algebra and basic graph theory; no prior knowledge of physics is required. The text serves as an introduction to this important and rapidly developing area for mathematicians and as a detailed reference for computer scientists and physicists working on quantum information theory.