Matroid Applications

Author: Neil White

Publisher: Cambridge University Press

ISBN: 9780521381659

Category: Mathematics

Page: 363

View: 8795

This volume, the third in a sequence that began with The Theory of Matroids and Combinatorial Geometries, concentrates on the applications of matroid theory to a variety of topics from engineering (rigidity and scene analysis), combinatorics (graphs, lattices, codes and designs), topology and operations research (the greedy algorithm).

Matroid Applications

Author: Neil White

Publisher: Cambridge University Press

ISBN: 9780521119672

Category: Mathematics

Page: 376

View: 5889

This volume, the third in a sequence that began with The Theory of Matroids (1986) and Combinatorial Geometries (1987), concentrates on the applications of matroid theory to a variety of topics from geometry (rigidity and lattices), combinatorics (graphs, codes, and designs) and operations research (the greedy algorithm).

Oriented Matroids

Author: Anders Björner

Publisher: Cambridge University Press

ISBN: 9780521777506

Category: Mathematics

Page: 548

View: 3035

First comprehensive, accessible account; second edition has expanded bibliography and a new appendix surveying recent research.

Theory of Matroids

Author: Neil White

Publisher: Cambridge University Press

ISBN: 0521309379

Category: Mathematics

Page: 316

View: 3370

The theory of matroids is unique in the extent to which it connects such disparate branches of combinatorial theory and algebra as graph theory, lattice theory, design theory, combinatorial optimization, linear algebra, group theory, ring theory and field theory. Furthermore, matroid theory is alone among mathematical theories because of the number and variety of its equivalent axiom systems. Indeed, matroids are amazingly versatile and the approaches to the subject are varied and numerous. This book is a primer in the basic axioms and constructions of matroids. The contributions by various leaders in the field include chapters on axiom systems, lattices, basis exchange properties, orthogonality, graphs and networks, constructions, maps, semi-modular functions and an appendix on cryptomorphisms. The authors have concentrated on giving a lucid exposition of the individual topics; explanations of theorems are preferred to complete proofs and original work is thoroughly referenced. In addition, exercises are included for each topic.

Matroid Theory

AMS-IMS-SIAM Joint Summer Research Conference on Matroid Theory, July 2-6, 1995, University of Washington, Seattle

Author: Joseph Edmond Bonin

Publisher: American Mathematical Soc.

ISBN: 0821805088

Category: Mathematics

Page: 418

View: 2068

This volume contains the proceedings of the 1995 AMS-IMS-SIAM Joint Summer Research Conference on Matroid Theory held at the University of Washington, Seattle. The book features three comprehensive surveys that bring the reader to the forefront of research in matroid theory. Joseph Kung's encyclopedic treatment of the critical problem traces the development of this problem from its origins through its numerous links with other branches of mathematics to the current status of its many aspects. James Oxley's survey of the role of connectivity and structure theorems in matroid theory stresses the influence of the Wheels and Whirls Theorem of Tutte and the Splitter Theorem of Seymour. Walter Whiteley's article unifies applications of matroid theory to constrained geometrical systems, including the rigidity of bar-and-joint frameworks, parallel drawings, and splines. These widely accessible articles contain many new results and directions for further research and applications. The surveys are complemented by selected short research papers. The volume concludes with a chapter of open problems. Features self-contained, accessible surveys of three active research areas in matroid theory; many new results; pointers to new research topics; a chapter of open problems; mathematical applications; and applications and connections to other disciplines, such as computer-aided design and electrical and structural engineering.

Matrices and Matroids for Systems Analysis

Author: Kazuo Murota

Publisher: Springer Science & Business Media

ISBN: 3642039944

Category: Mathematics

Page: 483

View: 6020

A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique introduction to matroid theory, emphasizing motivations from matrix theory and applications to systems analysis. This book serves also as a comprehensive presentation of the theory and application of mixed matrices, developed primarily by the present author in the 1990's. A mixed matrix is a convenient mathematical tool for systems analysis, compatible with the physical observation that "fixed constants" and "system parameters" are to be distinguished in the description of engineering systems. This book will be extremely useful to graduate students and researchers in engineering, mathematics and computer science. From the reviews: "...The book has been prepared very carefully, contains a lot of interesting results and is highly recommended for graduate and postgraduate students." András Recski, Mathematical Reviews Clippings 2000m:93006

Computational Oriented Matroids

Equivalence Classes of Matrices Within a Natural Framework

Author: Jürgen Bokowski

Publisher: Cambridge University Press

ISBN: 0521849306

Category: Computers

Page: 323

View: 4422

Oriented matroids play the role of matrices in discrete geometry, when metrical properties, such as angles or distances, are neither required nor available. Thus they are of great use in such areas as graph theory, combinatorial optimization and convex geometry. The variety of applications corresponds to the variety of ways they can be defined. Each of these definitions corresponds to a differing data structure for an oriented matroid, and handling them requires computational support, best realised through a functional language. Haskell is used here, and, for the benefit of readers, the book includes a primer on it. The combination of concrete applications and computation, the profusion of illustrations, many in colour, and the large number of examples and exercises make this an ideal introductory text on the subject. It will also be valuable for self-study for mathematicians and computer scientists working in discrete and computational geometry.

Matroid Theory

Author: J. G. Oxley

Publisher: Oxford University Press, USA

ISBN: 9780199202508

Category: Mathematics

Page: 532

View: 2507

The study of matroids is a branch of discrete mathematics with basic links to graphs, lattices, codes, transversals, and projective geometries. Matroids are of fundamental importance in combinatorial optimization and their applications extend into electrical engineering and statics. This new in paperback version of the classic "Matroid Theory" by James Oxley provides a comprehensive introduction to matroid theory, covering the very basics to more advanced topics. With over 500 exercisesand proofs of major theorems, this book is the ideal reference and class text for academics and graduate students in mathematics and computer science. The final chapter lists sixty unsolved problems and describes progress towards their solutions.

Matroids: A Geometric Introduction

Author: Gary Gordon,Jennifer McNulty

Publisher: Cambridge University Press

ISBN: 0521145686

Category: Language Arts & Disciplines

Page: 393

View: 7242

This friendly introduction helps undergraduate students understand and appreciate matroid theory and its connections to geometry.

Matroid Theory

Author: László Lovász,András Recski

Publisher: North Holland

ISBN: N.A

Category: Analyse combinatoire - Congrès

Page: 438

View: 2209


Topics in Matroid Theory

Author: Leonidas S. Pitsoulis

Publisher: Springer Science & Business Media

ISBN: 1461489571

Category: Mathematics

Page: 127

View: 2710

Topics in Matroid Theory provides a brief introduction to matroid theory with an emphasis on algorithmic consequences.Matroid theory is at the heart of combinatorial optimization and has attracted various pioneers such as Edmonds, Tutte, Cunningham and Lawler among others. Matroid theory encompasses matrices, graphs and other combinatorial entities under a common, solid algebraic framework, thereby providing the analytical tools to solve related difficult algorithmic problems. The monograph contains a rigorous axiomatic definition of matroids along with other necessary concepts such as duality, minors, connectivity and representability as demonstrated in matrices, graphs and transversals. The author also presents a deep decomposition result in matroid theory that provides a structural characterization of graphic matroids, and show how this can be extended to signed-graphic matroids, as well as the immediate algorithmic consequences.

Matroid Theory and Its Applications

Lectures given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in Varenna (Como), Italy, August 24 - September 2, 1980

Author: A. Barlotti

Publisher: Springer Science & Business Media

ISBN: 9783642111105

Category: Mathematics

Page: 424

View: 7824

Lectures: T.H. Brylawski: The Tutte polynomial.- D.J.A. Welsh: Matroids and combinatorial optimisation.- Seminars: M. Barnabei, A. Brini, G.-C. Rota: Un’introduzione alla teoria delle funzioni di Möbius.- A. Brini: Some remarks on the critical problem.- J. Oxley: On 3-connected matroids and graphs.- R. Peele: The poset of subpartitions and Cayley’s formula for the complexity of a complete graph.- A. Recski: Engineering applications of matroids.- T. Zaslavisky: Voltage-graphic matroids.

Matroid Decomposition

Author: K. Truemper

Publisher: Leibniz Company

ISBN: 1483276627

Category: Mathematics

Page: 408

View: 837

Matroid Decomposition deals with decomposition and composition of matroids. The emphasis is on binary matroids, which are produced by the matrices over the binary field GF(2). Different classes of matroids are described (graphic, regular, almost regular, max-flow min-cut), along with polynomial testing algorithms. Representative applications and, except for the almost-regular case, characterizations in terms of excluded minors are given. In addition, excluded minor characterizations of both binary and ternary matroids are presented. Comprised of 13 chapters, this book begins with an introduction to basic definitions concerning graphs and matrices, followed by a discussion on binary matroids. Subsequent chapters focus on some elementary constructions of graphs and binary matroids; a simple yet effective method called the path shortening technique for establishing basic connectivity relationships and certain results about the intersection and partitioning of matroids; an algorithm for identifying certain matroid separations; and the so-called splitter theorem. Fundamental notions and theorems about matroid decomposition and composition are described, along with a very important property of real matrices called total unimodularity. The book concludes with an analysis of flows in matroids based on ideas from flows in graphs. This monograph will be of interest to students and practitioners in diverse fields such as civil, electrical, and mechanical engineering, as well as computer science and mathematics.

Encyclopaedia of Mathematics

Supplement

Author: Michiel Hazewinkel

Publisher: Springer Science & Business Media

ISBN: 9401512795

Category: Mathematics

Page: 632

View: 3759

This is the second supplementary volume to Kluwer's highly acclaimed eleven-volume Encyclopaedia of Mathematics. This additional volume contains nearly 500 new entries written by experts and covers developments and topics not included in the previous volumes. These entries are arranged alphabetically throughout and a detailed index is included. This supplementary volume enhances the existing eleven volumes, and together these twelve volumes represent the most authoritative, comprehensive and up-to-date Encyclopaedia of Mathematics available.

Discrete Convex Analysis

Author: Kazuo Murota

Publisher: SIAM

ISBN: 9780898718508

Category: Convex functions

Page: 389

View: 5659

Discrete Convex Analysis is a novel paradigm for discrete optimization that combines the ideas in continuous optimization (convex analysis) and combinatorial optimization (matroid/submodular function theory) to establish a unified theoretical framework for nonlinear discrete optimization. The study of this theory is expanding with the development of efficient algorithms and applications to a number of diverse disciplines like matrix theory, operations research, and economics. This self-contained book is designed to provide a novel insight into optimization on discrete structures and should reveal unexpected links among different disciplines. It is the first and only English-language monograph on the theory and applications of discrete convex analysis.

Iterative Methods in Combinatorial Optimization

Author: Lap Chi Lau,R. Ravi,Mohit Singh

Publisher: Cambridge University Press

ISBN: 1139499394

Category: Computers

Page: N.A

View: 8997

With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.

Connections in Combinatorial Optimization

Author: András Frank

Publisher: OUP Oxford

ISBN: 0199205272

Category: Mathematics

Page: 664

View: 2020

Filling the gap between introductory and encyclopedic treatments, this book provides rich and appealing material for a second course in combinatorial optimization. This book is suitable for graduate students as well as a reference for established researchers.

A Source Book in Matroid Theory

Author: KUNG

Publisher: Springer Science & Business Media

ISBN: 1468491997

Category: Mathematics

Page: 413

View: 719

by Gian-Carlo Rota The subjects of mathematics, like the subjects of mankind, have finite lifespans, which the historian will record as he freezes history at one instant of time. There are the old subjects, loaded with distinctions and honors. As their problems are solved away and the applications reaped by engineers and other moneymen, ponderous treatises gather dust in library basements, awaiting the day when a generation as yet unborn will rediscover the lost paradise in awe. Then there are the middle-aged subjects. You can tell which they are by roaming the halls of Ivy League universities or the Institute for Advanced Studies. Their high priests haughtily refuse fabulous offers from eager provin cial universities while receiving special permission from the President of France to lecture in English at the College de France. Little do they know that the load of technicalities is already critical, about to crack and submerge their theorems in the dust of oblivion that once enveloped the dinosaurs. Finally, there are the young subjects-combinatorics, for instance. Wild eyed individuals gingerly pick from a mountain of intractable problems, chil dishly babbling the first words of what will soon be a new language. Child hood will end with the first Seminaire Bourbaki. It could be impossible to find a more fitting example than matroid theory of a subject now in its infancy. The telltale signs, for an unfailing diagnosis, are the abundance of deep theorems, going together with a paucity of theories.

Matroid Theory

Author: D. J. A. Welsh

Publisher: Courier Corporation

ISBN: 0486474399

Category: Mathematics

Page: 433

View: 6842

The theory of matroids connects disparate branches of combinatorial theory and algebra such as graph and lattice theory, combinatorial optimization, and linear algebra. This text describes standard examples and investigation results, and it uses elementary proofs to develop basic matroid properties before advancing to a more sophisticated treatment. 1976 edition.