Lins S. Gems, Computers and Attractors for 3-Manifolds

формат djvu
размер 4.72 МБ
добавлен 16 мая 2011 г.

World Scientific Publishing Company, 1995. - 450 Pages.

This text provides a guide to dealing with 3-manifolds by computers. Its emphasis is on presenting algorithms which are used for solving (in practice) the homeomorphism problem for the smallest of these objects. The key concept is the 3-gem, a special kind of edge-colored graph, which encodes the manifold via a ball complex. Passages between 3-gems and more standard presentations like Heegaard diagrams and surgery descriptions are provided. A catalogue of all closed orientable 3-manifolds induced by 3-gems up to 30 vertices is included. In order to help the classification, various invariants are presented, including the new quantum invariants.

Похожие разделы

Смотрите также

Chung F.R.K. Lectures on Spectral Graph Theory

формат pdf
размер 190.11 КБ
добавлен 01 декабря 2011 г.

Eigenvalues and the Laplacian of a graph. The Laplacian and eigenvalues. Basic facts about the spectrum of a graph. Eigenvalues of weighted graphs. Eigenvalues and random walks. Isoperimetric problems. History. The Cheeger constant of a graph. The edge expansion of a graph. The vertex expansion of a graph. A characterization of the Cheeger constant. Isoperimetric inequalities for cartesian products. Diameters and eigenvalues. The diameter of a gr...

Davis M.D., Weyuker E.J. Computability, Complexity, and Languages

формат djvu
размер 2.47 МБ
добавлен 24 октября 2011 г.

Издательство Academic Press, 1983, -435 pp. Theoretical computer science is the mathematical study of models of computation. As such, it originated in the 1930s, well before the existence of modern computers, in the work of the logicians Church, Godel, Kleene, Post, and Turing. This early work has had a profound influence on the practical and theoretical development of computer science. Not only has the Turing-machine model proved basic for theo...

Fulton W. Young Tableaux: With Applications to Representation Theory and Geometry

формат djvu
размер 2.24 МБ
добавлен 31 января 2012 г.

Cambridge University Press, 1997. - 270 Pages. This book develops the combinatorics of Young tableaux and shows them in action in the algebra of symmetric functions, representations of the symmetric and general linear groups, and the geometry of flag varieties. The first part of the book is a self-contained presentation of the basic combinatorics of Young tableaux, including the remarkable constructions of "bumping" and "sliding", and several i...

Graham R.L., Gr?tschel M., Lov?sz L. (eds.) Handbook of Combinatorics. Volume 1

Справочник

формат djvu
размер 14.35 МБ
добавлен 06 октября 2011 г.

Издательство Elsevier, 1995, -1120 pp. Combinatorics belongs to those areas of mathematics having experienced a most impressive growth in recent years. This growth has been fuelled in large part by the increasing importance of computers, the needs of computer science and demands from applications where discrete models play more and more important roles. But also more classical branches of mathematics have come to recognize that combinatorial str...

Graham R.L., Gr?tschel M., Lov?sz L. (eds.) Handbook of Combinatorics. Volume 2

Справочник

формат djvu
размер 19.61 МБ
добавлен 04 октября 2011 г.

Издательство Elsevier, 1995, -1280 pp. Combinatorics belongs to those areas of mathematics having experienced a most impressive growth in recent years. This growth has been fuelled in large part by the increasing importance of computers, the needs of computer science and demands from applications where discrete models play more and more important roles. But also more classical branches of mathematics have come to recognize that combinatorial str...

Jukna S. Boolean Function Complexity. Advances and Frontiers

формат pdf
размер 2.98 МБ
добавлен 24 октября 2011 г.

Издательство Springer, 2011, -633 pp. Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this complexity Waterloo that have been discovered over the past several decades, right up to results from the last year or two. Many open problems...

Liu Yanpei. Introductory Map Theory

формат pdf
размер 2.28 МБ
добавлен 12 января 2011 г.

Kapa & Omega, Glendale, AZ, USA, 2010. - 503 p. Abstract: A Smarandache system (G;R) is such a mathematical system with at least one Smarandachely denied rule r in R such that it behaves in at least two different ways within the same set G, i.e. , validated and invalided, or only invalided but in multiple distinct ways. A map is a 2-cell decomposition of surface, which can be seen as a connected graphs in development from partition to permuta...

Lovasz L. An Algorithmic Theory of Numbers, Graphs, and Convexity

формат djvu
размер 824.05 КБ
добавлен 28 октября 2011 г.

Society for Industrial and Applied Mathematics, 1986, -96 pp. There is little doubt that the present explosion of interest in the algorithmic aspects of mathematics is due to the development of computers — even though special algorithms and their study can be traced back all the way through the history of mathematics. Mathematics started out in Egypt and Babylon as a clearly algorithmic science. In ancient Greece the foundations of its "descript...

Savage J.E. Models of Computation. Exploring the Power of Computing

формат pdf
размер 4.2 МБ
добавлен 28 октября 2011 г.

Издательство Addison-Wesley, 1998, -699 pp. Theoretical computer science treats any computational subject for which a good model can be created. Research on formal models of computation was initiated in the 1930s and 1940s by Turing, Post, Kleene, Church, and others. In the 1950s and 1960s programming languages, language translators, and operating systems were under development and therefore became both the subject and basis for a great deal of...

Sch?ning U., Prium R. Gems of Theoretical Computer Science

формат pdf
размер 1.57 МБ
добавлен 31 января 2012 г.

Издательство Springer, 1998, -327 pp. In the summer semester of 1993 at Universit?t Ulm, I tried out a new type of course, which I called Theory lab, as part of the computer science major program. As in an experimental laboratory with written preparatory materials (including exercises), as well as materials for the actual meeting, in which an isolated research result is represented with its complete proof and all of its facets and false leads th...