Kategoria BISAC: Mathematics >> Combinatorics

This book presents a modular and expandable technique in the rapidly emerging research area of automatic configuration and selection of the best algorithm for the instance at hand. The author presents the basic model behind ISAC and then details a number of modifications and practical applications. In particular, he addresses automated feature generation, offline algorithm configuration for portfolio generation, algorithm selection, adaptive solvers, online tuning, and parallelization.

The author's related thesis was honorably mentioned (runner-up) for the ACP Dissertation...

This revised and enlarged fifth edition features four new chapters, which contain highly original and delightful proofs for classics such as the spectral theorem from linear algebra, some more recent jewels like the non-existence of the Borromean rings and other surprises.

From the Reviews

..". Inside PFTB (Proofs from The Book) is indeed a glimpse of mathematical heaven, where clever insights and beautiful ideas combine in astonishing and glorious ways. There is vast wealth within its pages, one gem after another. ... Aigner and...

This first text on the subject provides a comprehensive introduction to the representation theory of finite monoids. Carefully worked examples and exercises provide the bells and whistles for graduate accessibility, bringing a broad range of advanced readers to the forefront of research in the area. Highlights of the text include applications to probability theory, symbolic dynamics, and automata theory. Comfort with module theory, a familiarity with ordinary group representation theory, and the basics of Wedderburn theory, are prerequisites for advanced graduate level study. Researchers...

The subject is at the crossroads of Discrete Mathematics and Computer Science, with a strong probabilistic flavor. The main tools used before are on the one hand analytic (generating functions and complex analysis), and on the other probabilistic (strong laws, central limit theorems, martingales, etc.) Often, professionals worked with one set of tools or the other. We offer a reconciliation to espouse these fields to come in hand-in-hand offering a harmonious and beneficial marriage.

This book focuses on symmetric groups and representation theory. The symmetric group is a central object in discrete mathematics. It can be studied from a combinatorial, algorithmic, or algebraic viewpoint, and the results can be applied in a plethora of other fields, such as physics and computer science. This book is the most up-to-date one on the topic, bringing together new research and results.

Aimed toward upper undergraduate and graduate students in mathematics, this book examines the foremost forms of graph labelings including magic, harmonious, and graceful labelings. An overview of basic graph theory concepts and notation is provided along with the origins of graph labeling. Common methods and techniques are presented introducing readers to links between graph labels. A variety of useful techniques are presented to analyze and understand properties of graph labelings. The classical results integrated with new techniques, complete proofs, numerous exercises, and a variety of...

This book provides an introduction and overview of the growing area of chip-firing. It offers an appreciation for the richness and diversity of chip-firing. Chip-firing refers to a discrete dynamical system -- a commodity is exchanged between sites of a network according to very simple local rules. Although governed by local rules, the long-term global behavior of the system reveals fascinating properties. Working over the simplest type of network, basic properties are covered from a variety of perspectives. This gives the reader both a broad context of the field and concrete entry points...