eBook PDF Download Digital Library
Author: Department of Mathematics Senior Lecturer in Mathematics Ian Anderson, PhD
Publisher:
Published: 2014-05-14
Total Pages: 182
ISBN-13: 9781107087729
DOWNLOAD EBOOK →This volume contains the invited papers at the 1985 British Combinatorial Conference presented by several distinguished mathematicians.
Author: Ian Anderson
Publisher: Cambridge University Press
Published: 1985-07-25
Total Pages: 180
ISBN-13: 9780521315241
DOWNLOAD EBOOK →The British Combinatorial Conference is an established biennial international gathering. This volume contains the invited papers presented, by several distinguished mathematicians, at the 1985 conference. The papers cover a broad range of combinatorial topics, including cryptography, greedy algorithms, graph minors, flows through random networks, (0, 1)-distance problems, irregularities of point distributions and reconstruction of infinite graphs.
Author: Ian Anderson (Ph. D.)
Publisher:
Published: 1985
Total Pages: 173
ISBN-13: 9781107093966
DOWNLOAD EBOOK →This volume contains the invited papers at the 1985 British Combinatorial Conference presented by several distinguished mathematicians.
Author: J. W. P. Hirschfeld
Publisher: Cambridge University Press
Published: 2001-07-05
Total Pages: 324
ISBN-13: 9780521002707
DOWNLOAD EBOOK →This volume contains the invited talks from the 18th British Combinatorial Conference, held in 2001.
Author: J. Siemons
Publisher: Cambridge University Press
Published: 1989-08-03
Total Pages: 232
ISBN-13: 9780521378239
DOWNLOAD EBOOK →Many areas of current research activity in combinatorics and its applications, including graph theory, designs and probabilistic graphs, are surveyed in lectures presented at the 12th British Combinatorial Conference.
Author: Rabe v. Randow
Publisher: Springer Science & Business Media
Published: 2012-12-06
Total Pages: 522
ISBN-13: 3642516548
DOWNLOAD EBOOK →The fields of integer programming and combinatorial optimization continue to be areas of great vitality, with an ever increasing number of publications and journals appearing. A classified bibliography thus continues to be necessary and useful today, even more so than it did when the project, of which this is the fifth volume, was started in 1970 in the Institut fur Okonometrie und Operations Research of the University of Bonn. The pioneering first volume was compiled by Claus Kastning during the years 1970 - 1975 and appeared in 1976 as Volume 128 of the series Lecture Notes in Economics and Mathematical Systems published by the Springer Verlag. Work on the project was continued by Dirk Hausmann, Reinhardt Euler, and Rabe von Randow, and resulted in the publication of the second, third, and fourth volumes in 1978, 1982, and 1985 (Volumes 160, 197, and 243 of the above series). The present book constitutes the fifth volume of the bibliography and covers the period from autumn 1984 to the end of 1987. It contains 5864 new publications by 4480 authors and was compiled by Rabe von Randow. Its form is practically identical to that of the first four volumes, some additions having been made to the subject list.
Author: A. D. Keedwell
Publisher: Cambridge University Press
Published: 1991-08-22
Total Pages: 324
ISBN-13: 9780521407663
DOWNLOAD EBOOK →This volume contains the invited papers presented at the British Combinatorial Conference, held at the University of Surrey in July 1991.
Author: Frank Dehne
Publisher: Springer Science & Business Media
Published: 2004-09-06
Total Pages: 300
ISBN-13: 3540230718
DOWNLOAD EBOOK →This book constitutes the refereed proceedings of the First International Workshop on Parameterized and Exact Computation, IWPEC 2004, held in Bergen, Norway, in September 2004. The 25 revised full papers presented together with an invited paper were carefully reviewed and selected from 47 submissions. The topics addressed focus on all current issues in this new approach to designing algorithms.
Author: Robin Wilson
Publisher: OUP Oxford
Published: 2013-06-27
Total Pages: 392
ISBN-13: 0191630624
DOWNLOAD EBOOK →Who first presented Pascal's triangle? (It was not Pascal.) Who first presented Hamiltonian graphs? (It was not Hamilton.) Who first presented Steiner triple systems? (It was not Steiner.) The history of mathematics is a well-studied and vibrant area of research, with books and scholarly articles published on various aspects of the subject. Yet, the history of combinatorics seems to have been largely overlooked. This book goes some way to redress this and serves two main purposes: 1) it constitutes the first book-length survey of the history of combinatorics; and 2) it assembles, for the first time in a single source, researches on the history of combinatorics that would otherwise be inaccessible to the general reader. Individual chapters have been contributed by sixteen experts. The book opens with an introduction by Donald E. Knuth to two thousand years of combinatorics. This is followed by seven chapters on early combinatorics, leading from Indian and Chinese writings on permutations to late-Renaissance publications on the arithmetical triangle. The next seven chapters trace the subsequent story, from Euler's contributions to such wide-ranging topics as partitions, polyhedra, and latin squares to the 20th century advances in combinatorial set theory, enumeration, and graph theory. The book concludes with some combinatorial reflections by the distinguished combinatorialist, Peter J. Cameron. This book is not expected to be read from cover to cover, although it can be. Rather, it aims to serve as a valuable resource to a variety of audiences. Combinatorialists with little or no knowledge about the development of their subject will find the historical treatment stimulating. A historian of mathematics will view its assorted surveys as an encouragement for further research in combinatorics. The more general reader will discover an introduction to a fascinating and too little known subject that continues to stimulate and inspire the work of scholars today.
