Böcker i Texts and Readings in Mathematics-serien

Several generations of students of algebraic geometry have learned the subject from David Mumford's fabled "Red Book" containing notes of his lectures at Harvard University. This book contains what Mumford had intended to be Volume II. It covers the material in the "Red Book" in more depth with several more topics added.

Treats some basic topics in the spectral theory of dynamical systems. The treatment is at a general level, but two more advanced theorems, one by H. Helson and W. Parry and the other by B. Host, are presented. Moreover, Ornstein's family of mixing rank one automorphisms is described with construction and proof.

This book discusses basic topics in the spectral theory of dynamical systems. Lastly, the second edition includes a new chapter "Calculus of Generalized Riesz Products", which discusses the recent work connecting generalized Riesz products, Hardy classes, Banach's problem of simple Lebesgue spectrum in ergodic theory and flat polynomials.

This book develops the concepts of fundamental convex analysis and optimization by using advanced calculus and real analysis. Brief accounts of advanced calculus and real analysis are included within the book. The emphasis is on building a geometric intuition for the subject, which is aided further by supporting figures. Two distinguishing features of this book are the use of elementary alternative proofs of many results and an eclectic collection of useful concepts from optimization and convexity often needed by researchers in optimization, game theory, control theory, and mathematical economics. A full chapter on optimization algorithms gives an overview of the field, touching upon many current themes. The book is useful to advanced undergraduate and graduate students as well as researchers in the fields mentioned above and in various engineering disciplines.

This book discusses the origin of graph theory from its humble beginnings in recreational mathematics to its modern setting or modeling communication networks, as is evidenced by the World Wide Web graph used by many Internet search engines. The second edition of the book includes recent developments in the theory of signed adjacency matrices involving the proof of sensitivity conjecture and the theory of Ramanujan graphs. In addition, the book discusses topics such as Pick's theorem on areas of lattice polygons and Graham-Pollak's work on addressing of graphs. The concept of graph is fundamental in mathematics and engineering, as it conveniently encodes diverse relations and facilitates combinatorial analysis of many theoretical and practical problems. The text is ideal for a one-semester course at the advanced undergraduate level or beginning graduate level.

This book introduces the dilation theory of operators on Hilbert spaces and its relationship to complex geometry. Classical as well as very modern topics are covered in the book. On the one hand, it introduces the reader to the characteristic function, a classical object used by Sz.-Nagy and Foias and still a topic of current research. On the other hand, it describes the dilation theory of the symmetrized bidisc which has been developed mostly in the present century and is a very active topic of research. It also describes an abstract theory of dilation in the setting of set theory. This was developed very recently.A good portion of the book discusses various geometrical objects like the bidisc, the Euclidean unit ball, and the symmetrized bidisc. It shows the similarities and differences between the dilation theory in these domains. While completely positive maps play a big role in the dilation theory of the Euclidean unit ball, this is not so in the symmetrized bidisc for example. There, the central role is played by an operator equation. Targeted to graduate students and researchers, the book introduces the reader to different techniques applicable in different domains.