The problem of enumerating maps (a map is a set of polygonal "countries" on a world of a certain topology, not necessarily the plane or the sphere) is an important problem in mathematics and physics, and it has many applications ranging from statistical physics, geometry, particle physics, telecommunications, biology, ... etc. This problem has been studied by many communities of researchers, mostly combinatorists, probabilists, and physicists. Since 1978, physicists have invented a method ...

A look at one of the most exciting unsolved problems in mathematics todayElliptic Tales describes the latest developments in number theory by looking at one of the most exciting unsolved problems in contemporary mathematics—the Birch and Swinnerton-Dyer Conjecture. In this book, Avner Ash and Robert Gross guide readers through the mathematics they need to understand this captivating problem.The key to the conjecture lies in elliptic curves, which m...

The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful to readers with a wide range of backgrounds including Mathematics, Computer Science/Computer Applications and Operational Research. While dealing with theorems and algorithms, emphasis is laid on construct...

This second edition of Mathematical Olympiad Treasures contains a stimulating collection of problems in geometry and trigonometry, algebra, number theory, and combinatorics. It encourages readers to think creatively about techniques and strategies for solving real-world problems, with new sections, revisions, and many more Olympiad-like problems at various levels of difficulty.The problems are clustered by topic into three self-contained chapters. The book begins with elem...

Matroid theory is a vibrant area of research that provides a unified way to understand graph theory, linear algebra and combinatorics via finite geometry. This book provides the first comprehensive introduction to the field which will appeal to undergraduate students and to any mathematician interested in the geometric approach to matroids. Written in a friendly, fun-to-read style and developed from the authors' own undergraduate courses, the book is ideal for students. Beginning with a ba...

This introduction to random walks on infinite graphs gives particular emphasis to graphs with polynomial volume growth. It offers an overview of analytic methods, starting with the connection between random walks and electrical resistance, and then proceeding to study the use of isoperimetric and Poincaré inequalities. The book presents rough isometries and looks at the properties of a graph that are stable under these transformations. Applications include the 'type problem': determining w...

This book gives a comprehensive treatment of the Grassmannian varieties and their Schubert subvarieties, focusing on the geometric and representation-theoretic aspects of Grassmannian varieties. Research of Grassmannian varieties is centered at the crossroads of commutative algebra, algebraic geometry, representation theory, and combinatorics. Therefore, this text uniquely presents an exciting playing field for graduate students and researchers in mathematics, physics, and computer science...

For over eighty years this delightful classic has provided entertainment through mathematical problems commonly known as recreations. Although they often involve fundamental mathematical methods and notions, their chief appeal is as games or puzzles rather than the usefulness of their conclusions.This new edition upholds the original, but the terminology and treatment of problems have been updated and much new material has been added. There are new selections on polyominoes and the...

Combinatorics and Algebraic Geometry have enjoyed a fruitful interplay since the nineteenth century. Classical interactions include invariant theory, theta functions and enumerative geometry. The aim of this volume is to introduce recent developments in combinatorial algebraic geometry and to approach algebraic geometry with a view towards applications, such as tensor calculus and algebraic statistics. A common theme is the study of algebraic varieties endowed with a rich combinatorial str...

Ramsey theory is a relatively “new,” approximately 100 year-old direction of fascinating mathematical thought that touches on many classic fields of mathematics such as combinatorics, number theory, geometry, ergodic theory, topology, combinatorial geometry, set theory, and measure theory. Ramsey theory possesses its own unifying ideas, and some of its results are among the most beautiful theorems of mathematics. The underlying theme of Ramsey theory can be formulated as: any finite colori...

This volume consolidates selected articles from the 2016 Apprenticeship Program at the Fields Institute, part of the larger program on Combinatorial Algebraic Geometry that ran from July through December of 2016. Written primarily by junior mathematicians, the articles cover a range of topics in combinatorial algebraic geometry including curves, surfaces, Grassmannians, convexity, abelian varieties, and moduli spaces. This book bridges the gap between graduate courses and cutting-edge rese...

A deterministic extractor is a function that extracts almost perfect random bits from a weak random source. In this research monograph the author constructs deterministic extractors for several types of sources. A basic theme in this work is a methodology of recycling randomness which enables increasing the output length of deterministic extractors to near optimal length. The author's main work examines deterministic extractors for bit-fixing sources, deterministic extractors for affine so...