Combinatorial Algebraic Topology

Author: Dimitry Kozlov

Publisher: Springer Science & Business Media

ISBN: 9783540730514

Category: Mathematics

Page: 390

View: 3586

This volume is the first comprehensive treatment of combinatorial algebraic topology in book form. The first part of the book constitutes a swift walk through the main tools of algebraic topology. Readers - graduate students and working mathematicians alike - will probably find particularly useful the second part, which contains an in-depth discussion of the major research techniques of combinatorial algebraic topology. Although applications are sprinkled throughout the second part, they are principal focus of the third part, which is entirely devoted to developing the topological structure theory for graph homomorphisms.

Distributed Computing Through Combinatorial Topology

Author: Maurice Herlihy,Dmitry Kozlov,Sergio Rajsbaum

Publisher: Newnes

ISBN: 0124047289

Category: Computers

Page: 336

View: 8247

Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols. Today, a new student or researcher must assemble a collection of scattered conference publications, which are typically terse and commonly use different notations and terminologies. This book provides a self-contained explanation of the mathematics to readers with computer science backgrounds, as well as explaining computer science concepts to readers with backgrounds in applied mathematics. The first section presents mathematical notions and models, including message passing and shared-memory systems, failures, and timing models. The next section presents core concepts in two chapters each: first, proving a simple result that lends itself to examples and pictures that will build up readers' intuition; then generalizing the concept to prove a more sophisticated result. The overall result weaves together and develops the basic concepts of the field, presenting them in a gradual and intuitively appealing way. The book's final section discusses advanced topics typically found in a graduate-level course for those who wish to explore further. Named a 2013 Notable Computer Book for Computing Methodologies by Computing Reviews Gathers knowledge otherwise spread across research and conference papers using consistent notations and a standard approach to facilitate understanding Presents unique insights applicable to multiple computing fields, including multicore microprocessors, wireless networks, distributed systems, and Internet protocols Synthesizes and distills material into a simple, unified presentation with examples, illustrations, and exercises

Intuitive Combinatorial Topology

Author: V.G. Boltyanskii,V.A. Efremovich

Publisher: Springer Science & Business Media

ISBN: 1475756046

Category: Mathematics

Page: 142

View: 2061

Topology is a relatively young and very important branch of mathematics, which studies the properties of objects that are preserved through deformations, twistings, and stretchings. This book deals with the topology of curves and surfaces as well as with the fundamental concepts of homotopy and homology, and does this in a lively and well-motivated way. This book is well suited for readers who are interested in finding out what topology is all about.

Computational Algebraic Geometry

Author: Hal Schenck

Publisher: Cambridge University Press

ISBN: 9780521536509

Category: Mathematics

Page: 193

View: 404

This 2003 book investigates interplay between algebra and geometry. Covers: homological algebra, algebraic combinatorics and algebraic topology, and algebraic geometry.

Computations in Algebraic Geometry with Macaulay 2

Author: David Eisenbud,Daniel R. Grayson,Mike Stillman,Bernd Sturmfels

Publisher: Springer Science & Business Media

ISBN: 3662048515

Category: Mathematics

Page: 329

View: 2829

This book presents algorithmic tools for algebraic geometry, with experimental applications. It also introduces Macaulay 2, a computer algebra system supporting research in algebraic geometry, commutative algebra, and their applications. The algorithmic tools presented here are designed to serve readers wishing to bring such tools to bear on their own problems. The first part of the book covers Macaulay 2 using concrete applications; the second emphasizes details of the mathematics.

Triangulations

Structures for Algorithms and Applications

Author: Jesus De Loera,Joerg Rambau,Francisco Santos

Publisher: Springer Science & Business Media

ISBN: 9783642129711

Category: Mathematics

Page: 535

View: 2573

Triangulations presents the first comprehensive treatment of the theory of secondary polytopes and related topics. The text discusses the geometric structure behind the algorithms and shows new emerging applications, including hundreds of illustrations, examples, and exercises.

Gröbner Deformations of Hypergeometric Differential Equations

Author: Mutsumi Saito,Bernd Sturmfels,Nobuki Takayama

Publisher: Springer Science & Business Media

ISBN: 366204112X

Category: Mathematics

Page: 254

View: 2880

The theory of Gröbner bases is a main tool for dealing with rings of differential operators. This book reexamines the concept of Gröbner bases from the point of view of geometric deformations. The algorithmic methods introduced in this book are particularly useful for studying the systems of multidimensional hypergeometric PDE's introduced by Gelfand, Kapranov, and Zelevinsky. A number of original research results are contained in the book, and many open problems are raised for future research in this rapidly growing area of computational mathematics.

Geometry and Topology for Mesh Generation

Author: Herbert Edelsbrunner

Publisher: Cambridge University Press

ISBN: 9780521793094

Category: Mathematics

Page: 177

View: 9821

The book combines topics in mathematics (geometry and topology), computer science (algorithms), and engineering (mesh generation). The original motivation for these topics was the difficulty faced (both conceptually and in the technical execution) in any attempt to combine elements of combinatorial and of numerical algorithms. Mesh generation is a topic where a meaningful combination of these different approaches to problem solving is inevitable. The book develops methods from both areas that are amenable to combination, and explains recent breakthrough solutions to meshing that fit into this category.The book should be an ideal graduate text for courses on mesh generation. The specific material is selected giving preference to topics that are elementary, attractive, lend themselves to teaching, useful, and interesting.

Computational Homology

Author: Tomasz Kaczynski,Konstantin Mischaikow,Marian Mrozek

Publisher: Springer Science & Business Media

ISBN: 0387215972

Category: Mathematics

Page: 482

View: 8004

Homology is a powerful tool used by mathematicians to study the properties of spaces and maps that are insensitive to small perturbations. This book uses a computer to develop a combinatorial computational approach to the subject. The core of the book deals with homology theory and its computation. Following this is a section containing extensions to further developments in algebraic topology, applications to computational dynamics, and applications to image processing. Included are exercises and software that can be used to compute homology groups and maps. The book will appeal to researchers and graduate students in mathematics, computer science, engineering, and nonlinear dynamics.

Combinatorial and Computational Geometry

Author: Jacob E. Goodman,Janos Pach,Emo Welzl

Publisher: Cambridge University Press

ISBN: 9780521848626

Category: Computers

Page: 616

View: 9829

This 2005 book deals with interest topics in Discrete and Algorithmic aspects of Geometry.

Solving Polynomial Equations

Foundations, Algorithms, and Applications

Author: Alicia Dickenstein,Ioannis Z Emiris

Publisher: Springer Science & Business Media

ISBN: 3540273573

Category: Mathematics

Page: 426

View: 8997

The subject of this book is the solution of polynomial equations, that is, s- tems of (generally) non-linear algebraic equations. This study is at the heart of several areas of mathematics and its applications. It has provided the - tivation for advances in di?erent branches of mathematics such as algebra, geometry, topology, and numerical analysis. In recent years, an explosive - velopment of algorithms and software has made it possible to solve many problems which had been intractable up to then and greatly expanded the areas of applications to include robotics, machine vision, signal processing, structural molecular biology, computer-aided design and geometric modelling, as well as certain areas of statistics, optimization and game theory, and b- logical networks. At the same time, symbolic computation has proved to be an invaluable tool for experimentation and conjecture in pure mathematics. As a consequence, the interest in e?ective algebraic geometry and computer algebrahasextendedwellbeyonditsoriginalconstituencyofpureandapplied mathematicians and computer scientists, to encompass many other scientists and engineers. While the core of the subject remains algebraic geometry, it also calls upon many other aspects of mathematics and theoretical computer science, ranging from numerical methods, di?erential equations and number theory to discrete geometry, combinatorics and complexity theory. Thegoalofthisbookistoprovideageneralintroduction tomodernma- ematical aspects in computing with multivariate polynomials and in solving algebraic systems.

Algorithms in Real Algebraic Geometry

Author: Saugata Basu,Richard Pollack,Marie-Françoise Roy

Publisher: Springer Science & Business Media

ISBN: 9783540009733

Category: Mathematics

Page: 602

View: 5604

The algorithmic problems of real algebraic geometry such as real root counting, deciding the existence of solutions of systems of polynomial equations and inequalities, or deciding whether two points belong in the same connected component of a semi-algebraic set occur in many contexts. In this first-ever graduate textbook on the algorithmic aspects of real algebraic geometry, the main ideas and techniques presented form a coherent and rich body of knowledge, linked to many areas of mathematics and computing. Mathematicians already aware of real algebraic geometry will find relevant information about the algorithmic aspects, and researchers in computer science and engineering will find the required mathematical background. Being self-contained the book is accessible to graduate students and even, for invaluable parts of it, to undergraduate students.

Foundations of Combinatorial Topology

Author: L. S. Pontryagin

Publisher: Courier Dover Publications

ISBN: 0486803252

Category: Mathematics

Page: 112

View: 383

Hailed by The Mathematical Gazette as "an extremely valuable addition to the literature of algebraic topology," this concise but rigorous introductory treatment focuses on applications to dimension theory and fixed-point theorems. The lucid text examines complexes and their Betti groups, including Euclidean space, application to dimension theory, and decomposition into components; invariance of the Betti groups, with consideration of the cone construction and barycentric subdivisions of a complex; and continuous mappings and fixed points. Proofs are presented in a complete, careful, and elegant manner. In addition to its value as a one-semester text for graduate-level courses, this volume can also be used as a reference in preparing for seminars or examinations and as a source of basic information on combinatorial topology. Although considerable mathematical maturity is required of readers, formal prerequisites are merely a few simple facts about functions of a real variable, matrices, and commutative groups.

Computational Topology

An Introduction

Author: Herbert Edelsbrunner,John Harer

Publisher: American Mathematical Soc.

ISBN: 0821849255

Category: Mathematics

Page: 241

View: 1296

Combining concepts from topology and algorithms, this book delivers what its title promises: an introduction to the field of computational topology. Starting with motivating problems in both mathematics and computer science and building up from classic topics in geometric and algebraic topology, the third part of the text advances to persistent homology. This point of view is critically important in turning a mostly theoretical field of mathematics into one that is relevant to a multitude of disciplines in the sciences and engineering. The main approach is the discovery of topology through algorithms. The book is ideal for teaching a graduate or advanced undergraduate course in computational topology, as it develops all the background of both the mathematical and algorithmic aspects of the subject from first principles. Thus the text could serve equally well in a course taught in a mathematics department or computer science department.

Classical Topology and Combinatorial Group Theory

Author: John Stillwell

Publisher: Springer Science & Business Media

ISBN: 1461243726

Category: Mathematics

Page: 336

View: 5063

In recent years, many students have been introduced to topology in high school mathematics. Having met the Mobius band, the seven bridges of Konigsberg, Euler's polyhedron formula, and knots, the student is led to expect that these picturesque ideas will come to full flower in university topology courses. What a disappointment "undergraduate topology" proves to be! In most institutions it is either a service course for analysts, on abstract spaces, or else an introduction to homological algebra in which the only geometric activity is the completion of commutative diagrams. Pictures are kept to a minimum, and at the end the student still does nr~ understand the simplest topological facts, such as the rcason why knots exist. In my opinion, a well-balanced introduction to topology should stress its intuitive geometric aspect, while admitting the legitimate interest that analysts and algebraists have in the subject. At any rate, this is the aim of the present book. In support of this view, I have followed the historical development where practicable, since it clearly shows the influence of geometric thought at all stages. This is not to claim that topology received its main impetus from geometric recreations like the seven bridges; rather, it resulted from the l'isualization of problems from other parts of mathematics-complex analysis (Riemann), mechanics (Poincare), and group theory (Dehn). It is these connec tions to other parts of mathematics which make topology an important as well as a beautiful subject.

Directed Algebraic Topology and Concurrency

Author: Lisbeth Fajstrup,Eric Goubault,Emmanuel Haucourt,Samuel Mimram,Martin Raussen

Publisher: Springer

ISBN: 3319153986

Category: Computers

Page: 167

View: 7217

This monograph presents an application of concepts and methods from algebraic topology to models of concurrent processes in computer science and their analysis. Taking well-known discrete models for concurrent processes in resource management as a point of departure, the book goes on to refine combinatorial and topological models. In the process, it develops tools and invariants for the new discipline directed algebraic topology, which is driven by fundamental research interests as well as by applications, primarily in the static analysis of concurrent programs. The state space of a concurrent program is described as a higher-dimensional space, the topology of which encodes the essential properties of the system. In order to analyse all possible executions in the state space, more than “just” the topological properties have to be considered: Execution paths need to respect a partial order given by the time flow. As a result, tools and concepts from topology have to be extended to take privileged directions into account. The target audience for this book consists of graduate students, researchers and practitioners in the field, mathematicians and computer scientists alike.

Morse Theory

Smooth and Discrete

Author: Kevin P Knudson

Publisher: World Scientific Publishing Company

ISBN: 9814630985

Category: Mathematics

Page: 196

View: 6363

Morse Theory: Smooth and Discrete serves as an introduction to classical smooth Morse theory and to Forman's discrete Morse theory, highlighting the parallels between the two subjects. This is the first time both smooth and discrete Morse theory have been treated in a single volume. This makes the book a valuable resource for students and professionals working in topology and discrete mathematics. With a strong focus on examples, the text is suitable for advanced undergraduates or beginning graduate students.

Combinatorial Optimization

Algorithms and Complexity

Author: Christos H. Papadimitriou,Kenneth Steiglitz

Publisher: Courier Corporation

ISBN: 0486320138

Category: Mathematics

Page: 528

View: 1093

This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.

A Course in Topological Combinatorics

Author: Mark de Longueville

Publisher: Springer Science & Business Media

ISBN: 1441979107

Category: Mathematics

Page: 240

View: 6377

A Course in Topological Combinatorics is the first undergraduate textbook on the field of topological combinatorics, a subject that has become an active and innovative research area in mathematics over the last thirty years with growing applications in math, computer science, and other applied areas. Topological combinatorics is concerned with solutions to combinatorial problems by applying topological tools. In most cases these solutions are very elegant and the connection between combinatorics and topology often arises as an unexpected surprise. The textbook covers topics such as fair division, graph coloring problems, evasiveness of graph properties, and embedding problems from discrete geometry. The text contains a large number of figures that support the understanding of concepts and proofs. In many cases several alternative proofs for the same result are given, and each chapter ends with a series of exercises. The extensive appendix makes the book completely self-contained. The textbook is well suited for advanced undergraduate or beginning graduate mathematics students. Previous knowledge in topology or graph theory is helpful but not necessary. The text may be used as a basis for a one- or two-semester course as well as a supplementary text for a topology or combinatorics class.

Mathematics for Algorithm and Systems Analysis

Author: Edward A. Bender,Stanley Gill Williamson

Publisher: Courier Corporation

ISBN: 0486442500

Category: Mathematics

Page: 248

View: 5495

Discrete mathematics is fundamental to computer science, and this up-to-date text assists undergraduates in mastering the ideas and mathematical language to address problems that arise in the field's many applications. It consists of 4 units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.