Book Description
Combinatorics 79. Part I
Combinatorics 79. Part I
Author :
Publisher : Elsevier
Page : 333 pages
File Size : 32,22 MB
Release : 2011-08-26
Category : Mathematics
ISBN : 0080867715
Combinatorics '84
Author : M. Biliotti
Publisher : Elsevier
Page : 405 pages
File Size : 44,52 MB
Release : 1986-01-01
Category : Mathematics
ISBN : 0080872344
Book Description
Interest in combinatorial techniques has been greatly enhanced by the applications they may offer in connection with computer technology. The 38 papers in this volume survey the state of the art and report on recent results in Combinatorial Geometries and their applications.Contributors: V. Abatangelo, L. Beneteau, W. Benz, A. Beutelspacher, A. Bichara, M. Biliotti, P. Biondi, F. Bonetti, R. Capodaglio di Cocco, P.V. Ceccherini, L. Cerlienco, N. Civolani, M. de Soete, M. Deza, F. Eugeni, G. Faina, P. Filip, S. Fiorini, J.C. Fisher, M. Gionfriddo, W. Heise, A. Herzer, M. Hille, J.W.P. Hirschfield, T. Ihringer, G. Korchmaros, F. Kramer, H. Kramer, P. Lancellotti, B. Larato, D. Lenzi, A. Lizzio, G. Lo Faro, N.A. Malara, M.C. Marino, N. Melone, G. Menichetti, K. Metsch, S. Milici, G. Nicoletti, C. Pellegrino, G. Pica, F. Piras, T. Pisanski, G.-C. Rota, A. Sappa, D. Senato, G. Tallini, J.A. Thas, N. Venanzangeli, A.M. Venezia, A.C.S. Ventre, H. Wefelscheid, B.J. Wilson, N. Zagaglia Salvi, H. Zeitler.
Theory and Practice of Combinatorics
Author : J. Turgeon
Publisher : Elsevier
Page : 277 pages
File Size : 34,3 MB
Release : 1982-01-01
Category : Mathematics
ISBN : 0080871712
Book Description
Theory and Practice of Combinatorics
Algebraic and Geometric Combinatorics
Author : E. Mendelsohn
Publisher : Elsevier
Page : 393 pages
File Size : 46,2 MB
Release : 1982-01-01
Category : Mathematics
ISBN : 0080871763
Book Description
Algebraic and Geometric Combinatorics
Graphs and Order
Author : Ivan Rival
Publisher : Springer Science & Business Media
Page : 798 pages
File Size : 30,74 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 9400953151
Book Description
This volume contains the accounts of the principal survey papers presented at GRAPHS and ORDER, held at Banff, Canada from May 18 to May 31, 1984. This conference was supported by grants from the N.A.T.O. Advanced Study Institute programme, the Natural Sciences and Engineering Research Council of Canada and the University of Calgary. We are grateful for all of this considerable support. Almost fifty years ago the first Symposium on Lattice Theory was held in Charlottesville, U.S.A. On that occasion the principal lectures were delivered by G. Birkhoff, O. Ore and M.H. Stone. In those days the theory of ordered sets was thought to be a vigorous relative of group theory. Some twenty-five years ago the Symposium on Partially Ordered Sets and Lattice Theory was held in Monterey, U.S.A. Among the principal speakers at that meeting were R.P. Dilworth, B. Jonsson, A. Tarski and G. Birkhoff. Lattice theory had turned inward: it was concerned primarily with problems about lattices themselves. As a matter of fact the problems that were then posed have, by now, in many instances, been completely solved.
Algebraic and Combinatorial Methods in Operations Research
Author : R.E. Burkard
Publisher : Elsevier
Page : 393 pages
File Size : 35,5 MB
Release : 1984-01-01
Category : Mathematics
ISBN : 0080872069
Book Description
For the first time, this book unites different algebraic approaches for discrete optimization and operations research. The presentation of some fundamental directions of this new fast developing area shows the wide range of its applicability.Specifically, the book contains contributions in the following fields: semigroup and semiring theory applied to combinatorial and integer programming, network flow theory in ordered algebraic structures, extremal optimization problems, decomposition principles for discrete structures, Boolean methods in graph theory and applications.
Graph Theory
Author : B. Bollobás
Publisher : Elsevier
Page : 213 pages
File Size : 31,49 MB
Release : 1982-01-01
Category : Mathematics
ISBN : 0080871739
Book Description
The Cambridge Graph Theory Conference, held at Trinity College from 11 to 13 March 1981, brought together top ranking workers from diverse areas of the subject. The papers presented were by invitation only. This volume contains most of the contniutions, suitably refereed and revised. For many years now, graph theory has been developing at a great pace and in many directions. In order to emphasize the variety of questions and to preserve the freshness of research, the theme of the meeting was not restricted. Consequently, the papers in this volume deal with many aspects of graph theory, including colouring, connectivity, cycles, Ramsey theory, random graphs, flows, simplicial decompositions and directed graphs. A number of other papers are concerned with related areas, including hypergraphs, designs, algorithms, games and social models. This wealth of topics should enhance the attractiveness of the volume.
Orders: Description and Roles
Author : M. Pouzet
Publisher : Elsevier
Page : 599 pages
File Size : 17,9 MB
Release : 1984-01-01
Category : Mathematics
ISBN : 0080872107
Book Description
Orders: Description and Roles
Topics in the Theory of Computation
Author : M. Karpinski
Publisher : Elsevier
Page : 203 pages
File Size : 28,43 MB
Release : 1985-01-01
Category : Mathematics
ISBN : 0080872131
Book Description
This volume contains nine selected papers presented at the Borgholm conference. They were chosen on the basis of their immediate relevance to the most fundamental aspects of the theory of computation and the newest developments in this area.These papers, which have been extended and refereed, fall into eight categories: 1. Constructive Mathematics in Models of Computation and Programming; 2. Abstract Calculi and Denotational Semantics; 3. Theory of Machines, Computations and Languages; 4. Nondeterminism, Concurrency and Distributed Computing; 5. Abstract Algebras, Logics and Combinatorics in Computation Theory; 6. General Computability and Decidability; 7. Computational and Arithmetic Complexity; 8. Analysis of Algorithms and Feasible Computing.
Geometry of Cuts and Metrics
Author : Michel Marie Deza
Publisher : Springer
Page : 580 pages
File Size : 14,82 MB
Release : 2009-11-12
Category : Mathematics
ISBN : 3642042953
Book Description
Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections - in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, combinatorial matrix theory, statistical physics, VLSI design etc. This book presents a wealth of results, from different mathematical disciplines, in a unified comprehensive manner, and establishes new and old links, which cannot be found elsewhere. It provides a unique and invaluable source for researchers and graduate students. From the Reviews: "This book is definitely a milestone in the literature of integer programming and combinatorial optimization. It draws from the Interdisciplinarity of these fields [...]. With knowledge about the relevant terms, one can enjoy special subsections without being entirely familiar with the rest of the chapter. This makes it not only an interesting research book but even a dictionary. [...] The longer one works with it, the more beautiful it becomes." Optima 56, 1997.
