The book is an introduction to the theory of convex polytopes and polyhedral sets, to algebraic geometry, and to the connections between these fields, known as the theory of toric varieties. The first part of the book covers the theory of polytopes and provides large parts of the mathematical background of linear optimization and of the geometrical aspects in computer science. The second part introduces toric varieties in an elementary way.

This book is about the combinatorial properties of convex sets, families of convex sets in finite dimensional Euclidean spaces, and finite points sets related to convexity. This area is classic, with theorems of Helly, Carathéodory, and Radon that go back more than a hundred years. At the same time, it is a modern and active field of research with recent results like Tverberg's theorem, the colourful versions of Helly and Carathéodory, and the (p,q) (p,q) theorem of Alon and Kleitman. As the title indicates, the topic is convexity and geometry, and is close to discrete mathematics. The questions considered are frequently of a combinatorial nature, and the proofs use ideas from geometry and are often combined with graph and hypergraph theory. The book is intended for students (graduate and undergraduate alike), but postdocs and research mathematicians will also find it useful. It can be used as a textbook with short chapters, each suitable for a one- or two-hour lecture. Not much background is needed: basic linear algebra and elements of (hyper)graph theory as well as some mathematical maturity should suffice.

This volume consists of research papers and expository survey articles presented by the invited speakers of the Summer Workshop on Lattice Polytopes. Topics include enumerative, algebraic and geometric combinatorics on lattice polytopes, topological combinatorics, commutative algebra and toric varieties.Readers will find that this volume showcases current trends on lattice polytopes and stimulates further developments of many research areas surrounding this field. With the survey articles, research papers and open problems, this volume provides its fundamental materials for graduate students to learn and researchers to find exciting activities and avenues for further exploration on lattice polytopes.

Handbook of Combinatorics

A new edition of a classical treatment of elliptic and modular functions with some of their number-theoretic applications, this text offers an updated bibliography and an alternative treatment of the transformation formula for the Dedekind eta function. It covers many topics, such as Hecke’s theory of entire forms with multiplicative Fourier coefficients, and the last chapter recounts Bohr’s theory of equivalence of general Dirichlet series.

Aimed at the novice rather than the connoisseur and stressing the role of examples and motivation, this text is suitable not only for use in a graduate course, but also for self-study in the subject by interested graduate students. More than 400 exercises testing the understanding of the general theory in the text are included in this new edition.

This book is an introductory text in functional analysis. Unlike many modern treatments, it begins with the particular and works its way to the more general. From the reviews: "This book is an excellent text for a first graduate course in functional analysis....Many interesting and important applications are included....It includes an abundance of exercises, and is written in the engaging and lucid style which we have come to expect from the author." --MATHEMATICAL REVIEWS

"This book presents a basic introduction to complex analysis in both an interesting and a rigorous manner. It contains enough material for a full year's course, and the choice of material treated is reasonably standard and should be satisfactory for most first courses in complex analysis. The approach to each topic appears to be carefully thought out both as to mathematical treatment and pedagogical presentation, and the end result is a very satisfactory book." --MATHSCINET

This book emphasizes the isomorphic theory of Banach spaces and techniques using the unifying viewpoint of basic sequences. Its aim is to provide the reader with the necessary technical tools and background to reach the frontiers of research without the introduction of too many extraneous concepts. Detailed and accessible proofs are included, as are a variety of exercises and problems.

Combinatorial enumeration is a readily accessible subject full of easily stated, but sometimes tantalizingly difficult problems. This book leads the reader in a leisurely way from basic notions of combinatorial enumeration to a variety of topics, ranging from algebra to statistical physics. The book is organized in three parts: Basics, Methods, and Topics. The aim is to introduce readers to a fascinating field, and to offer a sophisticated source of information for professional mathematicians desiring to learn more. There are 666 exercises, and every chapter ends with a highlight section, discussing in detail a particularly beautiful or famous result.