Handbook of the Tutte Polynomial and Related Topics


Book Description

The Tutte Polynomial touches on nearly every area of combinatorics as well as many other fields, including statistical mechanics, coding theory, and DNA sequencing. It is one of the most studied graph polynomials. Handbook of the Tutte Polynomial and Related Topics is the first handbook published on the Tutte Polynomial. It consists of thirty-four chapters written by experts in the field, which collectively offer a concise overview of the polynomial’s many properties and applications. Each chapter covers a different aspect of the Tutte polynomial and contains the central results and references for its topic. The chapters are organized into six parts. Part I describes the fundamental properties of the Tutte polynomial, providing an overview of the Tutte polynomial and the necessary background for the rest of the handbook. Part II is concerned with questions of computation, complexity, and approximation for the Tutte polynomial; Part III covers a selection of related graph polynomials; Part IV discusses a range of applications of the Tutte polynomial to mathematics, physics, and biology; Part V includes various extensions and generalizations of the Tutte polynomial; and Part VI provides a history of the development of the Tutte polynomial. Features Written in an accessible style for non-experts, yet extensive enough for experts Serves as a comprehensive and accessible introduction to the theory of graph polynomials for researchers in mathematics, physics, and computer science Provides an extensive reference volume for the evaluations, theorems, and properties of the Tutte polynomial and related graph, matroid, and knot invariants Offers broad coverage, touching on the wide range of applications of the Tutte polynomial and its various specializations




Handbook of Algebra


Book Description

Handbook of Algebra defines algebra as consisting of many different ideas, concepts and results. Even the nonspecialist is likely to encounter most of these, either somewhere in the literature, disguised as a definition or a theorem or to hear about them and feel the need for more information. Each chapter of the book combines some of the features of both a graduate-level textbook and a research-level survey. This book is divided into eight sections. Section 1A focuses on linear algebra and discusses such concepts as matrix functions and equations and random matrices. Section 1B cover linear dependence and discusses matroids. Section 1D focuses on fields, Galois Theory, and algebraic number theory. Section 1F tackles generalizations of fields and related objects. Section 2A focuses on category theory, including the topos theory and categorical structures. Section 2B discusses homological algebra, cohomology, and cohomological methods in algebra. Section 3A focuses on commutative rings and algebras. Finally, Section 3B focuses on associative rings and algebras. This book will be of interest to mathematicians, logicians, and computer scientists.




Handbook of Combinatorics Volume 1


Book Description

Handbook of Combinatorics, Volume 1 focuses on basic methods, paradigms, results, issues, and trends across the broad spectrum of combinatorics. The selection first elaborates on the basic graph theory, connectivity and network flows, and matchings and extensions. Discussions focus on stable sets and claw free graphs, nonbipartite matching, multicommodity flows and disjoint paths, minimum cost circulations and flows, special proof techniques for paths and circuits, and Hamilton paths and circuits in digraphs. The manuscript then examines coloring, stable sets, and perfect graphs and embeddings and minors. The book takes a look at random graphs, hypergraphs, partially ordered sets, and matroids. Topics include geometric lattices, structural properties, linear extensions and correlation, dimension and posets of bounded degree, hypergraphs and set systems, stability, transversals, and matchings, and phase transition. The manuscript also reviews the combinatorial number theory, point lattices, convex polytopes and related complexes, and extremal problems in combinatorial geometry. The selection is a valuable reference for researchers interested in combinatorics.




Handbook of Combinatorics


Book Description

Handbook of Combinatorics




Handbook of Enumerative Combinatorics


Book Description

Presenting the state of the art, the Handbook of Enumerative Combinatorics brings together the work of today's most prominent researchers. The contributors survey the methods of combinatorial enumeration along with the most frequent applications of these methods.This important new work is edited by Miklos Bona of the University of Florida where he




Iterative Optimization in Inverse Problems


Book Description

Iterative Optimization in Inverse Problems brings together a number of important iterative algorithms for medical imaging, optimization, and statistical estimation. It incorporates recent work that has not appeared in other books and draws on the author’s considerable research in the field, including his recently developed class of SUMMA algorithms. Related to sequential unconstrained minimization methods, the SUMMA class includes a wide range of iterative algorithms well known to researchers in various areas, such as statistics and image processing. Organizing the topics from general to more specific, the book first gives an overview of sequential optimization, the subclasses of auxiliary-function methods, and the SUMMA algorithms. The next three chapters present particular examples in more detail, including barrier- and penalty-function methods, proximal minimization, and forward-backward splitting. The author also focuses on fixed-point algorithms for operators on Euclidean space and then extends the discussion to include distance measures other than the usual Euclidean distance. In the final chapters, specific problems illustrate the use of iterative methods previously discussed. Most chapters contain exercises that introduce new ideas and make the book suitable for self-study. Unifying a variety of seemingly disparate algorithms, the book shows how to derive new properties of algorithms by comparing known properties of other algorithms. This unifying approach also helps researchers—from statisticians working on parameter estimation to image scientists processing scanning data to mathematicians involved in theoretical and applied optimization—discover useful related algorithms in areas outside of their expertise.




Stochastic Cauchy Problems in Infinite Dimensions


Book Description

Stochastic Cauchy Problems in Infinite Dimensions: Generalized and Regularized Solutions presents stochastic differential equations for random processes with values in Hilbert spaces. Accessible to non-specialists, the book explores how modern semi-group and distribution methods relate to the methods of infinite-dimensional stochastic analysis. It also shows how the idea of regularization in a broad sense pervades all these methods and is useful for numerical realization and applications of the theory. The book presents generalized solutions to the Cauchy problem in its initial form with white noise processes in spaces of distributions. It also covers the "classical" approach to stochastic problems involving the solution of corresponding integral equations. The first part of the text gives a self-contained introduction to modern semi-group and abstract distribution methods for solving the homogeneous (deterministic) Cauchy problem. In the second part, the author solves stochastic problems using semi-group and distribution methods as well as the methods of infinite-dimensional stochastic analysis.




Modeling and Inverse Problems in the Presence of Uncertainty


Book Description

Modeling and Inverse Problems in the Presence of Uncertainty collects recent research—including the authors’ own substantial projects—on uncertainty propagation and quantification. It covers two sources of uncertainty: where uncertainty is present primarily due to measurement errors and where uncertainty is present due to the modeling formulation itself. After a useful review of relevant probability and statistical concepts, the book summarizes mathematical and statistical aspects of inverse problem methodology, including ordinary, weighted, and generalized least-squares formulations. It then discusses asymptotic theories, bootstrapping, and issues related to the evaluation of correctness of assumed form of statistical models. The authors go on to present methods for evaluating and comparing the validity of appropriateness of a collection of models for describing a given data set, including statistically based model selection and comparison techniques. They also explore recent results on the estimation of probability distributions when they are embedded in complex mathematical models and only aggregate (not individual) data are available. In addition, they briefly discuss the optimal design of experiments in support of inverse problems for given models. The book concludes with a focus on uncertainty in model formulation itself, covering the general relationship of differential equations driven by white noise and the ones driven by colored noise in terms of their resulting probability density functions. It also deals with questions related to the appropriateness of discrete versus continuum models in transitions from small to large numbers of individuals. With many examples throughout addressing problems in physics, biology, and other areas, this book is intended for applied mathematicians interested in deterministic and/or stochastic models and their interactions. It is also suitable for scientists in biology, medicine, engineering, and physics working on basic modeling and inverse problems, uncertainty in modeling, propagation of uncertainty, and statistical modeling.




The Mathematics of Chip-Firing


Book Description

The Mathematics of Chip-firing is a solid introduction and overview of the growing field of chip-firing. It offers an appreciation for the richness and diversity of the subject. 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. The Fundamental properties of chip-firing are covered from a variety of perspectives. This gives the reader both a broad context of the field and concrete entry points from different backgrounds. Broken into two sections, the first examines the fundamentals of chip-firing, while the second half presents more general frameworks for chip-firing. Instructors and students will discover that this book provides a comprehensive background to approaching original sources. Features: Provides a broad introduction for researchers interested in the subject of chip-firing The text includes historical and current perspectives Exercises included at the end of each chapter About the Author: Caroline J. Klivans received a BA degree in mathematics from Cornell University and a PhD in applied mathematics from MIT. Currently, she is an Associate Professor in the Division of Applied Mathematics at Brown University. She is also an Associate Director of ICERM (Institute for Computational and Experimental Research in Mathematics). Before coming to Brown she held positions at MSRI, Cornell and the University of Chicago. Her research is in algebraic, geometric and topological combinatorics.




Diagram Genus, Generators, and Applications


Book Description

In knot theory, diagrams of a given canonical genus can be described by means of a finite number of patterns ("generators"). Diagram Genus, Generators and Applications presents a self-contained account of the canonical genus: the genus of knot diagrams. The author explores recent research on the combinatorial theory of knots and supplies proofs for a number of theorems. The book begins with an introduction to the origin of knot tables and the background details, including diagrams, surfaces, and invariants. It then derives a new description of generators using Hirasawa’s algorithm and extends this description to push the compilation of knot generators one genus further to complete their classification for genus 4. Subsequent chapters cover applications of the genus 4 classification, including the braid index, polynomial invariants, hyperbolic volume, and Vassiliev invariants. The final chapter presents further research related to generators, which helps readers see applications of generators in a broader context.