Matroid Theory

Author: J. G. Oxley

Publisher: Oxford University Press, USA

ISBN: 9780199202508

Category: Mathematics

Page: 532

View: 6637

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.

Matroid Theory

Author: D. J. A. Welsh

Publisher: Courier Corporation

ISBN: 0486474399

Category: Mathematics

Page: 433

View: 4139

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.

Matroid Theory

Author: James Oxley

Publisher: OUP Oxford

ISBN: 0198566948

Category: Mathematics

Page: 544

View: 946

This major revision of James Oxley's classic Matroid Theory provides a comprehensive introduction to the subject, covering the basics to more advanced topics. With over 700 exercises and proofs of all relevant major theorems, this book is the ideal reference and class text for academics and graduate students in mathematics and computer science.

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: 9820

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 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: 957

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.

Topics in Matroid Theory

Author: Leonidas S. Pitsoulis

Publisher: Springer Science & Business Media

ISBN: 1461489571

Category: Mathematics

Page: 127

View: 1455

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.

A Source Book in Matroid Theory

Author: KUNG

Publisher: Springer Science & Business Media

ISBN: 1468491997

Category: Mathematics

Page: 413

View: 1064

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: J. G. Oxley

Publisher: Peterson's

ISBN: 9780198535638

Category: Architecture

Page: 532

View: 9231

What is the essence of the similarity between forests in a graph and linearly independent sets of columns in a matrix? Why does the greedy algorithm produce a spanning tree of minimum weight in a connected graph? Is it possible to test in polynomial time whether a matrix is totally unimodular?These questions form the basis of Matroid theory. 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 book falls into two parts: the first provides a comprehensive introduction to the basics of matroid theory, while the second treats more advanced topics. The book contains over five hundred exercises and includes, for the first time in one place, short proofs of all but one of the majortheorems in the subject. The final chapter lists sixty unsolved problems and describes progress towards their solutions.

Theory of Matroids

Author: Neil White

Publisher: Cambridge University Press

ISBN: 0521309379

Category: Mathematics

Page: 316

View: 8958

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

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

Publisher: N.A


Category: Science

Page: 438

View: 9312

Combinatorial & Computational Mathematics

Present and Future : Pohang, the Republic of Korea, 15-17 February 2000

Author: Sungpyo Hong

Publisher: World Scientific

ISBN: 9789812799890

Category: Combinatorial analysis

Page: 277

View: 5445

This book describes and summarizes past work in important areas of combinatorics and computation, as well as gives directions for researchers working in these areas in the 21st century. It contains primarily survey papers and presents original research by Peter Fishburn, Jim Ho Kwak, Jaeun Lee, K H Kim, F W Roush and Susan Williams. The papers deal with some of the most exciting and promising developments in the areas of coding theory in relation to number theory, lattice theory and its applications, graph theory and its applications, topological techniques in combinatorics, symbolic dynamics and mathematical social science. Contents: Monte-Carlo and Quasi-Monte-Carlo Methods for Numerical Integration (H Faure); Theoretical Approaches to Judgement and Choice (P Fishburn); Combinatorial Aspects of Mathematical Social Science (K H Kim & F W Roush); Twelve Views of Matroid Theory (J P S Kung); Enumeration of Graph Coverings, Surface Branched Coverings and Related Group Theory (J H Kwak & J Lee); An Overview of the Poset of Irreducibles (G Markowsky); Number Theory and Public-Key Cryptography (D Pointcheval); Some Applications of Graph Theory (F Roberts); Duality and Its Consequences for Ordered Cohomology of Finite Type Subshifts (K H Kim et al.); Simple Maximum Likelihood Methods for the Optical Mapping Problem (V Danc k & M S Waterman). Readership: Researchers, graduate students and advanced undergraduates in combinatorics and computational mathematics."

A Lost Mathematician, Takeo Nakasawa

The Forgotten Father of Matroid Theory

Author: Hirokazu Nishimura,Susumu Kuroda

Publisher: Springer Science & Business Media

ISBN: 9783764385736

Category: Mathematics

Page: 236

View: 6125

Matroid theory was invented in the middle of the 1930s by two mathematicians independently, namely, Hassler Whitney in the USA and Takeo Nakasawa in Japan. Whitney became famous, but Nakasawa remained anonymous until two decades ago. He left only four papers to the mathematical community, all of them written in the middle of the 1930s. It was a bad time to have lived in a country that had become as eccentric as possible. Just as Nazism became more and more flamboyant in Europe in the 1930s, Japan became more and more esoteric and fanatical in the same time period. This book explains the little that is known about Nakasawa’s personal life in a Japan that had, among other failures, lost control over its military. This book contains his four papers in German and their English translations as well as some extended commentary on the history of Japan during those years. The book also contains 14 photos of him or his family. Although the veil of mystery surrounding Nakasawa’s life has only been partially lifted, the work presented in this book speaks eloquently of a tragic loss to the mathematical community.

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms

Author: N.A

Publisher: SIAM

ISBN: 9780898713299

Category: Science

Page: 735

View: 9590

The January 1994 Symposium was jointly sponsored by the ACM Special Interest Group for Automata and Computability Theory and the SIAM Activity Group on Discrete Mathematics. Among the topics in 79 (unrefereed) papers: comparing point sets under projection; on-line search in a simple polygon; low- degree tests; maximal empty ellipsoids; roots of a polynomial and its derivatives; dynamic algebraic algorithms; fast comparison of evolutionary trees; an efficient algorithm for dynamic text editing; and tight bounds for dynamic storage allocation. No index. Annotation copyright by Book News, Inc., Portland, OR

Matroid Applications

Author: Neil White

Publisher: Cambridge University Press

ISBN: 9780521381659

Category: Mathematics

Page: 363

View: 2798

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).

Moderne Algebra

Author: Bartel Eckmann L. Van der van der Waerden,Emil Artin,Emmy Noether

Publisher: Springer-Verlag

ISBN: 3662364344

Category: Mathematics

Page: 274

View: 3439

Dieser Buchtitel ist Teil des Digitalisierungsprojekts Springer Book Archives mit Publikationen, die seit den Anfängen des Verlags von 1842 erschienen sind. Der Verlag stellt mit diesem Archiv Quellen für die historische wie auch die disziplingeschichtliche Forschung zur Verfügung, die jeweils im historischen Kontext betrachtet werden müssen. Dieser Titel erschien in der Zeit vor 1945 und wird daher in seiner zeittypischen politisch-ideologischen Ausrichtung vom Verlag nicht beworben.

Matroids: A Geometric Introduction

Author: Gary Gordon,Jennifer McNulty

Publisher: Cambridge University Press

ISBN: 1139536087

Category: Mathematics

Page: N.A

View: 9532

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 basic introduction to matroids, the book quickly familiarizes the reader with the breadth of the subject, and specific examples are used to illustrate the theory and to help students see matroids as more than just generalizations of graphs. Over 300 exercises are included, with many hints and solutions so students can test their understanding of the materials covered. The authors have also included several projects and open-ended research problems for independent study.

Combinatorial Optimization

Networks and Matroids

Author: Eugene Lawler

Publisher: Courier Corporation

ISBN: 048614366X

Category: Mathematics

Page: 400

View: 1522

Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity.