Author: Leonidas S. Pitsoulis

Publisher: Springer Science & Business Media

ISBN: 1461489571

Category: Mathematics

Page: 127

View: 4278

Skip to content
# Nothing Found

### Topics in Matroid Theory

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

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.

### Selected topics in discrete mathematics: Proceedings of the Moscow Discrete Mathematics Seminar, 1972-1990

This is a collection of translations of a variety of papers on discrete mathematics by members of the Moscow Seminar on Discrete Mathematics. This seminar, begun in 1972, was marked by active participation and intellectual ferment. Mathematicians in the USSR often encountered difficulties in publishing, so many interesting results in discrete mathematics remained unknown in the West for some years, and some are unknown even to the present day. To help fill this communication gap, this collection offers papers that were obscurely published and very hard to find. Among the topics covered here are: graph theory, network flow and multicommodity flow, linear programming and combinatorial optimization, matroid theory and submodular systems, matrix theory and combinatorics, parallel computing, complexity of algorithms, random graphs and statistical mechanics, coding theory, and algebraic combinatorics and group theory.

### Nonnegative Matrices and Applications

This book provides an integrated treatment of the theory of nonnegative matrices (matrices with only positive numbers or zero as entries) and some related classes of positive matrices, concentrating on connections with game theory, combinatorics, inequalities, optimisation and mathematical economics. The wide variety of applications, which include price fixing, scheduling and the fair division problem, have been carefully chosen both for their elegant mathematical content and for their accessibility to students with minimal preparation. Many results in matrix theory are also presented. The treatment is rigorous and almost all results are proved completely. These results and applications will be of great interest to researchers in linear programming, statistics and operations research. The minimal prerequisites also make the book accessible to first-year graduate students.

### A Source Book in Matroid Theory

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 Applications

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

### Linear Programming Duality

This book presents an elementary introduction to the theory of oriented matroids. The way oriented matroids are intro- duced emphasizes that they are the most general - and hence simplest - structures for which linear Programming Duality results can be stated and proved. The main theme of the book is duality. Using Farkas' Lemma as the basis the authors start withre- sults on polyhedra in Rn and show how to restate the essence of the proofs in terms of sign patterns of oriented ma- troids. Most of the standard material in Linear Programming is presented in the setting of real space as well as in the more abstract theory of oriented matroids. This approach clarifies the theory behind Linear Programming and proofs become simpler. The last part of the book deals with the facial structure of polytopes respectively their oriented matroid counterparts. It is an introduction to more advanced topics in oriented matroid theory. Each chapter contains suggestions for furt- herreading and the references provide an overview of the research in this field.

### Matroid Theory

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.

### Matroid Theory

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.

### Graphs

This adaptation of an earlier work by the authors is a graduate text and professional reference on the fundamentals of graph theory. It covers the theory of graphs, its applications to computer networks and the theory of graph algorithms. Also includes exercises and an updated bibliography.

### Topics in Combinatorics and Graph Theory

Graph Theory is a part of discrete mathematics characterized by the fact of an extremely rapid development during the last 10 years. The number of graph theoretical paper as well as the number of graph theorists increase very strongly. The main purpose of this book is to show the reader the variety of graph theoretical methods and the relation to combinatorics and to give him a survey on a lot of new results, special methods, and interesting informations. This book, which grew out of contributions given by about 130 authors in honour to the 70th birthday of Gerhard Ringel, one of the pioneers in graph theory, is meant to serve as a source of open problems, reference and guide to the extensive literature and as stimulant to further research on graph theory and combinatorics.

### Matroid Theory

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.

### Topics in Algebra

### Analysis and Design of Algorithms in Combinatorial Optimization

### Topics in combinatorial packing and covering

### Theory of Matroids

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.

### Game Theory and Related Topics

### Algebraic Geometry Modeling in Information Theory

Algebraic & geometry methods have constituted a basic background and tool for people working on classic block coding theory and cryptography. Nowadays, new paradigms on coding theory and cryptography have arisen such as: Network coding, S-Boxes, APN Functions, Steganography and decoding by linear programming. Again understanding the underlying procedure and symmetry of these topics needs a whole bunch of non trivial knowledge of algebra and geometry that will be used to both, evaluate those methods and search for new codes and cryptographic applications. This book shows those methods in a self-contained form.

### Kombinatorische Optimierung

Das Lehrbuch ist die deutsche Übersetzung der 4., wesentlich erweiterten Auflage des Titels „Combinatorial Optimization – Theory and Algorithms". Es gibt den neuesten Stand der kombinatorischen Optimierung wieder und liefert vornehmlich theoretische Resultate und Algorithmen mit beweisbar guten Laufzeiten und Ergebnissen, jedoch keine Heuristiken. Enthalten sind vollständige Beweise, auch für viele tiefe und neue Resultate, von denen einige bisher in der Lehrbuchliteratur noch nicht erschienen sind. Mit Übungen und umfassendem Literaturverzeichnis.

Full PDF eBook Download Free

Author: Leonidas S. Pitsoulis

Publisher: Springer Science & Business Media

ISBN: 1461489571

Category: Mathematics

Page: 127

View: 4278

Author: J. G. Oxley

Publisher: Oxford University Press, USA

ISBN: 9780199202508

Category: Mathematics

Page: 532

View: 6156

Author: Alexander K. Kelmans

Publisher: American Mathematical Soc.

ISBN: 9780821895924

Category:

Page: N.A

View: 8710

Author: R. B. Bapat,T. E. S. Raghavan

Publisher: Cambridge University Press

ISBN: 9780521571678

Category: Mathematics

Page: 336

View: 4671

Author: KUNG

Publisher: Springer Science & Business Media

ISBN: 1468491997

Category: Mathematics

Page: 413

View: 4965

Author: Neil White

Publisher: Cambridge University Press

ISBN: 9780521381659

Category: Mathematics

Page: 363

View: 8036

*An Introduction to Oriented Matroids*

Author: Achim Bachem,Walter Kern

Publisher: Springer Science & Business Media

ISBN: 3642581528

Category: Business & Economics

Page: 218

View: 3806

*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: 7804

Author: D. J. A. Welsh

Publisher: Courier Corporation

ISBN: 0486474399

Category: Mathematics

Page: 433

View: 4312

*Theory and Algorithms*

Author: K. Thulasiraman,M. N. S. Swamy

Publisher: John Wiley & Sons

ISBN: 1118030257

Category: Mathematics

Page: 480

View: 3465

*Essays in Honour of Gerhard Ringel*

Author: Rainer Bodendiek,Rudolf Henn

Publisher: Springer Science & Business Media

ISBN: 3642469086

Category: Mathematics

Page: 792

View: 5668

Author: James Oxley

Publisher: OUP Oxford

ISBN: 0198566948

Category: Mathematics

Page: 544

View: 583

Author: Jan Krempa,Stanisław Balcerzyk,Daniel Simson,Wolfgang Vogel,International Conference on Representations of Algebras

Publisher: N.A

ISBN: 9788301095796

Category: Rings (Algebra)

Page: N.A

View: 5979

Author: Giorgio Ausiello,M. Lucertini

Publisher: Springer

ISBN: 3709127483

Category: Science

Page: 209

View: 2786

Author: Odile Marie-Claude Marcotte

Publisher: N.A

ISBN: N.A

Category: Mathematics

Page: 204

View: 1788

Author: Neil White

Publisher: Cambridge University Press

ISBN: 0521309379

Category: Mathematics

Page: 316

View: 3161

*Proceedings of the Seminar on Game Theory and Related Topics, Bonn/Hagen, 26-29 September, 1978*

Author: Otto Moeschlin,Diethard Pallaschke

Publisher: North-Holland

ISBN: 9780444853424

Category: Game theory

Page: 399

View: 5876

Author: Edgar Martínez-Moro

Publisher: World Scientific

ISBN: 9814335754

Category: Mathematics

Page: 325

View: 7657

*Theorie und Algorithmen*

Author: Bernhard Korte,Jens Vygen

Publisher: Springer-Verlag

ISBN: 3540769196

Category: Mathematics

Page: 675

View: 2457