Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Convex Polytopes
"The original edition [...] inspired a whole generation of grateful workers in polytope theory. Without it, it is doubtful whether many of the subsequent advances in the subject would have been made. The many seeds it sowed have since grown into healthy trees, with vigorous branches and luxuriant foliage. It is good to see it in print once again." --Peter McMullen, University College London
Tilings and Patterns
Tilings and Patterns: An Introduction presents in convenient paperback form the first half of Tilings and Patterns. Omitting the more specialized material of the earlier volume, this abbreviated edition make's the authors' contributions to tiling theory and its practical applications accessible to a wide audience.
Configurations of Points and Lines
This book discusses the topic of geometric configurations of points and lines. It presents in detail the history of the topic, with its surges and declines, since its beginning in 1876. It covers all advances in the field since the revival of interest in geometric configurations some 20 years ago.
Configurations of Points and Lines
This is the only book on the topic of geometric configurations of points and lines. It presents in detail the history of the topic, with its surges and declines since its beginning in 1876. It covers all the advances in the field since the revival of interest in geometric configurations some 20 years ago. The author's contributions are central to this revival. In particular, he initiated the study of 4-configurations (that is, those that contain four points on each line, and four lines through each point); the results are fully described in the text. The main novelty in the approach to all geometric configurations is the concentration on their symmetries, which make it possible to deal with configurations of rather large sizes. The book brings the readers to the limits of present knowledge in a leisurely way, enabling them to enjoy the material as well as entice them to try their hand at expanding it.
Tilings and Patterns
semesterhylde.
Geometric Folding Algorithms
Did you know that any straight-line drawing on paper can be folded so that the complete drawing can be cut out with one straight scissors cut? That there is a planar linkage that can trace out any algebraic curve, or even 'sign your name'? Or that a 'Latin cross' unfolding of a cube can be refolded to 23 different convex polyhedra? Over the past decade, there has been a surge of interest in such problems, with applications ranging from robotics to protein folding. With an emphasis on algorithmic or computational aspects, this treatment gives hundreds of results and over 60 unsolved 'open problems' to inspire further research. The authors cover one-dimensional (1D) objects (linkages), 2D objects (paper), and 3D objects (polyhedra). Aimed at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from school students to researchers.
Lectures on Polytopes
Based on a graduate course at the Technische Universität, Berlin, these lectures present a wealth of material on the modern theory of convex polytopes. The straightforward exposition features many illustrations, and complete proofs for most theorems. With only linear algebra as a prerequisite, it takes the reader quickly from the basics to topics of recent research. The lectures introduce basic facts about polytopes, with an emphasis on methods that yield the results, discuss important examples and elegant constructions, and show the excitement of current work in the field. They will provide interesting and enjoyable reading for researchers as well as students.
Graph Structure Theory
This volume contains the proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, held at the University of Washington in Seattle in the summer of 1991. Among the topics covered are: algorithms on tree-structured graphs, well-quasi-ordering, logic, infinite graphs, disjoint path problems, surface embeddings, knot theory, graph polynomials, matroid theory, and combinatorial optimization.
