A unified treatment of the Riemann-Hilbert correspondence for (not necessarily regular) holonomic D-modules using indsheaves.

A collection of research papers, both new and expository, based on the interests of Professor J. P. C. Greenlees.

A collection of expository articles on modern topics in algebraic geometry, focusing on the geometry of algebraic spaces and stacks.

This book provides the first thorough treatment of effective results and methods for Diophantine equations over finitely generated domains. Compiling diverse results and techniques from papers written in recent decades, the text includes an in-depth analysis of classical equations including unit equations, Thue equations, hyper- and superelliptic equations, the Catalan equation, discriminant equations and decomposable form equations. The majority of results are proved in a quantitative form, giving effective bounds on the sizes of the solutions. The necessary techniques from Diophantine approximation and commutative algebra are all explained in detail without requiring any specialized knowledge on the topic, enabling readers from beginning graduate students to experts to prove effective finiteness results for various further classes of Diophantine equations.

Written to honor the enduring influence of William Fulton, these articles present substantial contributions to algebraic geometry.

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.