This book provides an introduction to the inverse eigenvalue problem for graphs (IEP-$G$) and the related area of zero forcing, propagation, and throttling. The IEP-$G$ grew from the intersection of linear algebra and combinatorics and has given rise to both a rich set of deep problems in that area as well as a breadth of “ancillary” problems in related areas. The IEP-$G$ asks a fundamental mathematical question expressed in terms of linear algebra and graph theory, but the significance of such questions goes beyond these two areas, as particular instances of the IEP-$G$ also appear as major research problems in other fields of mathematics, sciences and engineering. One approach to the IEP-$G$ is through rank minimization, a relevant problem in itself and with a large number of applications. During the past 10 years, important developments on the rank minimization problem, particularly in relation to zero forcing, have led to significant advances in the IEP-$G$. The monograph serves as an entry point and valuable resource that will stimulate future developments in this active and mathematically diverse research area.

The Workshop for Women in Graph Theory and Applications was held at the Institute for Mathematics and Its Applications (University of Minnesota, Minneapolis) on August 19-23, 2019. During this five-day workshop, 42 participants performed collaborative research, in six teams, each focused on open problems in different areas of graph theory and its applications. The research work of each team was led by two experts in the corresponding area, who prior to the workshop, carefully selected relevant and meaningful open problems that would yield high-quality research and results of strong impact. As a result, all six teams have made significant contributions to several open problems in their respective areas. The workshop led to the creation of the Women in Graph Theory and Applications Research Collaboration Network, which provided the framework to continue collaborating and to produce this volume. This book contains six chapters, each of them on one of the different areas of research at the Workshop for Women in Graph Theory and Applications, and written by participants of each team.

50 Years of Combinatorics, Graph Theory, and Computing advances research in discrete mathematics by providing current research surveys, each written by experts in their subjects. The book also celebrates outstanding mathematics from 50 years at the Southeastern International Conference on Combinatorics, Graph Theory & Computing (SEICCGTC). The conference is noted for the dissemination and stimulation of research, while fostering collaborations among mathematical scientists at all stages of their careers. The authors of the chapters highlight open questions. The sections of the book include: Combinatorics; Graph Theory; Combinatorial Matrix Theory; Designs, Geometry, Packing and Covering. Readers will discover the breadth and depth of the presentations at the SEICCGTC, as well as current research in combinatorics, graph theory and computer science. Features: Commemorates 50 years of the Southeastern International Conference on Combinatorics, Graph Theory & Computing with research surveys Surveys highlight open questions to inspire further research Chapters are written by experts in their fields Extensive bibliographies are provided at the end of each chapter

Bimonoidal categories are categorical analogues of rings without additive inverses. They have been actively studied in category theory, homotopy theory, and algebraic $K$-theory since around 1970. There is an abundance of new applications and questions of bimonoidal categories in mathematics and other sciences. The three books published by the AMS in the Mathematical Surveys and Monographs series under the general title Bimonoidal Categories, $E_n$-Monoidal Categories, and Algebraic $K$-Theory (Volume I: Symmetric Bimonoidal Categories and Monoidal Bicategories?this book, Volume II: Braided Bimonoidal Categories with Applications, and Volume III: From Categories to Structured Ring Spectra) provide a unified treatment of bimonoidal and higher ring-like categories, their connection with algebraic $K$-theory and homotopy theory, and applications to quantum groups and topological quantum computation. With ample background material, extensive coverage, detailed presentation of both well-known and new theorems, and a list of open questions, this work is a user-friendly resource for beginners and experts alike. Part 1 of this book proves in detail Laplaza's two coherence theorems and May's strictification theorem of symmetric bimonoidal categories, as well as their bimonoidal analogues. This part includes detailed corrections to several inaccurate statements and proofs found in the literature. Part 2 proves Baez's Conjecture on the existence of a bi-initial object in a 2-category of symmetric bimonoidal categories. The next main theorem states that a matrix construction, involving the matrix product and the matrix tensor product, sends a symmetric bimonoidal category with invertible distributivity morphisms to a symmetric monoidal bicategory, with no strict structure morphisms in general.

Bimonoidal categories are categorical analogues of rings without additive inverses. They have been actively studied in category theory, homotopy theory, and algebraic $K$-theory since around 1970. There is an abundance of new applications and questions of bimonoidal categories in mathematics and other sciences. The three books published by the AMS in the Mathematical Surveys and Monographs series under the title Bimonoidal Categories, $E_n$-Monoidal Categories, and Algebraic $K$-Theory (Volume I: Symmetric Bimonoidal Categories and Monoidal Bicategories, Volume II: Braided Bimonoidal Categories with Applications, and Volume III: From Categories to Structured Ring Spectra?this book) provide a unified treatment of bimonoidal and higher ring-like categories, their connection with algebraic $K$-theory and homotopy theory, and applications to quantum groups and topological quantum computation. With ample background material, extensive coverage, detailed presentation of both well-known and new theorems, and a list of open questions, this work is a user-friendly resource for beginners and experts alike. Part 1 of this book is a detailed study of enriched monoidal categories, pointed diagram categories, and enriched multicategories. Using this machinery, Part 2 discusses the rich interconnection between the higher ring-like categories, homotopy theory, and algebraic $K$-theory. Starting with a chapter on homotopy theory background, the first half of Part 2 constructs the Segal $K$-theory functor and the Elmendorf-Mandell $K$-theory multifunctor from permutative categories to symmetric spectra. For the latter, the detailed treatment here includes identification and correction of some subtle errors concerning its extended domain. The second half applies the $K$-theory multifunctor to small ring, bipermutative, braided ring, and $E_n$-monoidal categories to obtain, respectively, strict ring, $E_{infty}$-, $E_2$-, and $E_n$-symmetric spectra.

The Langlands program has been a very active and central field in mathematics ever since its conception over 50 years ago. It connects number theory, representation theory and arithmetic geometry, and other fields in a profound way. There are nevertheless very few expository accounts beyond the GL(2) case. This book features expository accounts of several topics on automorphic forms on higher rank groups, including rationality questions on unitary group, theta lifts and their applications to Arthur's conjectures, quaternionic modular forms, and automorphic forms over functions fields and their applications to inverse Galois problems. It is based on the lecture notes prepared for the twenty-fifth Arizona Winter School on “Automorphic Forms beyond GL(2)”, held March 5–9, 2022, at the University of Arizona in Tucson. The speakers were Ellen Eischen, Wee Teck Gan, Aaron Pollack, and Zhiwei Yun. The exposition of the book is in a style accessible to students entering the field. Advanced graduate students as well as researchers will find this a valuable introduction to various important and very active research areas.

Although there is no precise definition of a “fractal”, it is usually understood to be a set whose smaller parts, when magnified, resemble the whole. Self-similar and self-affine sets are those for which this resemblance is precise and given by a contracting similitude or affine transformation. The present book is devoted to this most basic class of fractal objects. The book contains both introductory material for beginners and more advanced topics, which continue to be the focus of active research. Among the latter are self-similar sets and measures with overlaps, including the much-studied infinite Bernoulli convolutions. Self-affine systems pose additional challenges; their study is often based on ergodic theory and dynamical systems methods. In the last twenty years there have been many breakthroughs in these fields, and our aim is to give introduction to some of them, often in the simplest nontrivial cases. The book is intended for a wide audience of mathematicians interested in fractal geometry, including students. Parts of the book can be used for graduate and even advanced undergraduate courses.

This book is an introduction to residuated structures, viewed as a common thread binding together algebra and logic. The framework includes well-studied structures from classical abstract algebra such as lattice-ordered groups and ideals of rings, as well as structures serving as algebraic semantics for substructural and other non-classical logics. Crucially, classes of these structures are studied both algebraically, yielding a rich structure theory along the lines of Conrad's program for lattice-ordered groups, and algorithmically, via analytic sequent or hypersequent calculi. These perspectives are related using a natural notion of equivalence for consequence relations that provides a bridge offering benefits to both sides. Algorithmic methods are used to establish properties like decidability, amalgamation, and generation by subclasses, while new insights into logical systems are obtained by studying associated classes of structures. The book is designed to serve the purposes of novices and experts alike. The first three chapters provide a gentle introduction to the subject, while subsequent chapters provide a state-of-the-art account of recent developments in the field.

This book is the tenth in a series of volumes whose aim is to provide a complete proof of the classification theorem for the finite simple groups based on a fairly short and clearly enumerated set of background results. Specifically, this book completes our identification of the simple groups of bicharacteristic type begun in the ninth volume of the series (see SURV/40.9). This is a fascinating set of simple groups which have properties in common with matrix groups (or, more generally, groups of Lie type) defined both over fields of characteristic 2 and over fields of characteristic 3. This set includes 11 of the celebrated 26 sporadic simple groups along with several of their large simple subgroups. Together with SURV/40.9, this volume provides the first unified treatment of this class of simple groups.

The goal of this book is to introduce the reader to methodologies in recovery problems for objects, such as functions and signals, from partial or indirect information. The recovery of objects from a set of data demands key solvers of inverse and sampling problems. Until recently, connections between the mathematical areas of inverse problems and sampling were rather tenuous. However, advances in several areas of mathematical research have revealed deep common threads between them, which proves that there is a serious need for a unifying description of the underlying mathematical ideas and concepts. Freeden and Nashed present an integrated approach to resolution methodologies from the perspective of both these areas. Researchers in sampling theory will benefit from learning about inverse problems and regularization methods, while specialists in inverse problems will gain a better understanding of the point of view of sampling concepts. This book requires some basic knowledge of functional analysis, Fourier theory, geometric number theory, constructive approximation, and special function theory. By avoiding extreme technicalities and elaborate proof techniques, it is an accessible resource for students and researchers not only from applied mathematics, but also from all branches of engineering and science.