Volume of geometric objects plays an important role in applied and theoretical mathematics. This is particularly true in the relatively new branch of discrete geometry, where volume is often used to find new topics for research. Volumetric Discrete Geometry demonstrates the recent aspects of volume, introduces problems related to it, and presents methods to apply it to other geometric problems. Part I of the text consists of survey chapters of selected topics on volume and is suitable for advanced undergraduate students. Part II has chapters of selected proofs of theorems stated in Part I and is oriented for graduate level students wishing to learn about the latest research on the topic. Chapters can be studied independently from each other. Provides a list of 30 open problems to promote research Features more than 60 research exercises Ideally suited for researchers and students of combinatorics, geometry and discrete mathematics

Spectral sequences are among the most elegant, most powerful, and most complicated methods of computation in mathematics. This book describes some of the most important examples of spectral sequences and some of their most spectacular applications. The first third of the book treats the algebraic foundations for this sort of homological algebra, starting from informal calculations, to give the novice a familiarity with the range of applications possible. The heart of the book is an exposition of the classical examples from homotopy theory, with chapters on the Leray-Serre spectral sequence, the Eilenberg-Moore spectral sequence, the Adams spectral sequence, and, in this new edition, the Bockstein spectral sequence. The last part of the book treats applications throughout mathematics, including the theory of knots and links, algebraic geometry, differential geometry and algebra. This is an excellent reference for students and researchers in geometry, topology, and algebra.

The origins of the word problem are in group theory, decidability and complexity. But through the vision of M. Gromov and the language of filling functions, the topic now impacts the world of large-scale geometry. This book contains accounts of many recent developments in Geometric Group Theory and shows the interaction between the word problem and geometry continues to be a central theme. It contains many figures, numerous exercises and open questions.

In this monograph the author presents a coherent exposition of recent results on complete characterization of Kobayashi-hyperbolic manifolds with high-dimensional groups of holomorphic automorphisms. These classification results can be viewed as complex-geometric analogues of those known for Riemannian manifolds with high-dimensional isotropy groups that were extensively studied in the 1950s-70s.

This book constitutes the refereed proceedings of the 4th International Conference on Geometric Modeling and Processing, GMP 2006, held in Pittsburgh, PA, USA, July 2006. The book presents 36 revised full papers and 21 revised short papers addressing current issues in geometric modeling and processing are addressed. The papers are organized in topical sections on shape reconstruction, curves and surfaces, geometric processing, shape deformation, shape description, shape recognition, and more.

The author uses modern methods from computational group theory and representation theory to treat this classical topic of function theory. He provides classifications of all automorphism groups up to genus 48. The book also classifies the ordinary characters for several groups, arising from the action of automorphisms on the space of holomorphic abelian differentials of a compact Reimann surface. This book is suitable for graduate students and researchers in group theory, representation theory, complex analysis and computer algebra.

The study of geodesic flows on homogenous spaces is an area of research that has yielded some fascinating developments. This book, first published in 2000, focuses on many of these, and one of its highlights is an elementary and complete proof (due to Margulis and Dani) of Oppenheim's conjecture. Also included here: an exposition of Ratner's work on Raghunathan's conjectures; a complete proof of the Howe-Moore vanishing theorem for general semisimple Lie groups; a new treatment of Mautner's result on the geodesic flow of a Riemannian symmetric space; Mozes' result about mixing of all orders and the asymptotic distribution of lattice points in the hyperbolic plane; Ledrappier's example of a mixing action which is not a mixing of all orders. The treatment is as self-contained and elementary as possible. It should appeal to graduate students and researchers interested in dynamical systems, harmonic analysis, differential geometry, Lie theory and number theory.

Fractalize That! A Visual Essay on Statistical Geometry brings a new class of geometric fractals to a wider audience of mathematicians and scientists. It describes a recently discovered random fractal space-filling algorithm. Connections with tessellations and known fractals such as Sierpinski are developed. And, the mathematical development is illustrated by a large number of colorful images that will charm the readers.The algorithm claims to be universal in scope, in that it can fill any spatial region with smaller and smaller fill regions of any shape. The filling is complete in the limit of an infinite number of fill regions. This book presents a descriptive development of the subject using the traditional shapes of geometry such as discs, squares, and triangles. It contains a detailed mathematical treatment of all that is currently known about the algorithm, as well as a chapter on software implementation of the algorithm.The mathematician will find a wealth of interesting conjectures supported by numerical computation. Physicists are offered a model looking for an application. The patterns generated are often quite interesting as abstract art. Readers can also create these computer-generated art with the advice and examples provided.

The origami introduced in this book is based on simple techniques. Some were previously known by origami artists and some were discovered by the author. Curved-Folding Origami Design shows a way to explore new area of origami composed of curved folds. Each technique is introduced in a step-by-step fashion, followed by some beautiful artwork examples. A commentary explaining the theory behind the technique is placed at the end of each chapter. Features Explains the techniques for designing curved-folding origami in seven chapters Contains many illustrations and photos (over 140 figures), with simple instructions Contains photos of 24 beautiful origami artworks, as well as their crease patterns Some basic theories behind the techniques are introduced

This book investigates the high degree of symmetry that lies hidden in integrable systems. To that end, differential equations arising from classical mechanics, such as the KdV equation and the KP equations, are used here by the authors to introduce the notion of an infinite dimensional transformation group acting on spaces of integrable systems. Chapters discuss the work of M. Sato on the algebraic structure of completely integrable systems, together with developments of these ideas in the work of M. Kashiwara. The text should be accessible to anyone with a knowledge of differential and integral calculus and elementary complex analysis, and it will be a valuable resource to both novice and expert alike.

Polyhedra have cropped up in many different guises throughout recorded history. Recently, polyhedra and their symmetries have been cast in a new light by combinatorics and group theory. This unique text comprehensively documents the many and varied ways that polyhedra have come to the fore throughout the development of mathematics. The author strikes a balance between covering the historical development of the theory surrounding polyhedra and rigorous treatment of the mathematics involved. Attractively illustrated--including 16 color plates--Polyhedra elucidates ideas that have proven difficult to grasp. Mathematicians, as well as historians of mathematics, will find this book fascinating.

This book is the first volume in a two-volume set, which will provide the complete proof of classification of two important classes of geometries, closely related to each other: Petersen and tilde geometries. There is an infinite family of tilde geometries associated with nonsplit extensions of symplectic groups over a field of two elements. Besides that there are twelve exceptional Petersen and tilde geometries. These exceptional geometries are related to sporadic simple groups, including the famous Monster group and this volume gives a construction for each of the Petersen and tilde geometries that provides an independent existence proof for the corresponding automorphism group. Important applications of Petersen and tilde geometries are considered, including the so-called Y-presentations for the Monster and related groups, and a complete identification of Y-groups is given. This is an essential purchase for researchers in finite group theory, finite geometries and algebraic combinatorics.

This volume consists of the refereed proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG 2004) held at Tokai University in Tokyo, Japan, October, 8-11, 2004, to honor Jan ' os Pach on his 50th year. J' anos Pach has generously supported the e?orts to promote research in discrete and computational geometry among mathematicians in Asia for many years. The conference was attended by close to 100 participants from 20 countries. Since it was ?rst organized in 1997, the annual JCDCG has attracted a growing international participation. The earlier conferences were held in Tokyo, followed by conferences in Manila, Philippines, and Bandung, Indonesia. The proceedings of JCDCG 1998, 2000, 2002 and IJCCGGT 2003 were published by SpringeraspartoftheseriesLectureNotesinComputerScience(LNCS)volumes 1763, 2098, 2866 and 3330, respectively, while the proceedings of JCDCG 2001 were also published by Springer as a special issue of the journal Graphs and Combinatorics, Vol. 18, No. 4, 2002. The organizers of JCDCG 2004 gratefully acknowledge the sponsorship of Tokai University, the support of the conference secretariat and the partici- tion of the principal speakers: Ferran Hurtado, Hiro Ito, Alberto M' arquez, Ji? r' ? Matou? sek, Ja 'nos Pach, Jonathan Shewchuk, William Steiger, Endre Szemer' edi, G' eza T' oth, Godfried Toussaint and Jorge Urrutia.

Convex geometry is at once simple and amazingly rich. While the classical results go back many decades, during that previous to this book's publication in 1999, the integral geometry of convex bodies had undergone a dramatic revitalization, brought about by the introduction of methods, results and, most importantly, new viewpoints, from probability theory, harmonic analysis and the geometry of finite-dimensional normed spaces. This book is a collection of research and expository articles on convex geometry and probability, suitable for researchers and graduate students in several branches of mathematics coming under the broad heading of 'Geometric Functional Analysis'. It continues the Israel GAFA Seminar series, which is widely recognized as the most useful research source in the area. The collection reflects the work done at the program in Convex Geometry and Geometric Analysis that took place at MSRI in 1996.

The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed account of newer topics, including Szemer\'edi's Regularity Lemma and its use, Shelah's extension of the Hales-Jewett Theorem, the precise nature of the phase transition in a random graph process, the connection between electrical networks and random walks on graphs, and the Tutte polynomial and its cousins in knot theory. In no other branch of mathematics is it as vital to tackle and solve challenging exercises in order to master the subject. To this end, the book contains an unusually large number of well thought-out exercises: over 600 in total. Although some are straightforward, most of them are substantial, and others will stretch even the most able reader.

There has been a resurgence of interest in classical invariant theory driven by several factors: new theoretical developments; a revival of computational methods coupled with powerful new computer algebra packages; and a wealth of new applications, ranging from number theory to geometry, physics to computer vision. This book provides readers with a self-contained introduction to the classical theory as well as modern developments and applications. The text concentrates on the study of binary forms (polynomials) in characteristic zero, and uses analytical as well as algebraic tools to study and classify invariants, symmetry, equivalence and canonical forms. A variety of innovations make this text of interest even to veterans of the subject; these include the use of differential operators and the transform approach to the symbolic method, extension of results to arbitrary functions, graphical methods for computing identities and Hilbert bases, complete systems of rationally and functionally independent covariants, introduction of Lie group and Lie algebra methods, as well as a new geometrical theory of moving frames and applications. Aimed at advanced undergraduate and graduate students the book includes many exercises and historical details, complete proofs of the fundamental theorems, and a lively and provocative exposition.

New variational methods by Aubry, Mather, and Mane, discovered in the last twenty years, gave deep insight into the dynamics of convex Lagrangian systems. This book shows how this Principle of Least Action appears in a variety of settings (billiards, length spectrum, Hofer geometry, modern symplectic geometry). Thus, topics from modern dynamical systems and modern symplectic geometry are linked in a new and sometimes surprising way. The central object is Mather 's minimal action functional. The level is for graduate students onwards, but also for researchers in any of the subjects touched in the book.

Algebraic projective geometry, with its multilinear relations and its embedding into Grassmann-Cayley algebra, has become the basic representation of multiple view geometry, resulting in deep insights into the algebraic structure of geometric relations, as well as in efficient and versatile algorithms for computer vision and image analysis.

This book provides a coherent integration of algebraic projective geometry and spatial reasoning under uncertainty with applications in computer vision. Beyond systematically introducing the theoretical foundations from geometry and statistics and clear rules for performing geometric reasoning under uncertainty, the author provides a collection of detailed algorithms.

The book addresses researchers and advanced students interested in algebraic projective geometry for image analysis, in statistical representation of objects and transformations, or in generic tools for testing and estimating within the context of geometric multiple-view analysis.

In recent years, geometry has played a lesser role in undergraduate courses than it has ever done. Nevertheless, it still plays a leading role in mathematics at a higher level. Its central role in the history of mathematics has never been disputed. It is important, therefore, to introduce some geometry into university syllabuses. There are several ways of doing this, it can be incorporated into existing courses that are primarily devoted to other topics, it can be taught at a first year level or it can be taught in higher level courses devoted to differential geometry or to more classical topics. These notes are intended to fill a rather obvious gap in the literature. It treats the classical topics of Euclidean, projective and hyperbolic geometry but uses the material commonly taught to undergraduates: linear algebra, group theory, metric spaces and complex analysis. The notes are based on a course whose aim was two fold, firstly, to introduce the students to some geometry and secondly to deepen their understanding of topics that they have already met. What is required from the earlier material is a familiarity with the main ideas, specific topics that are used are usually redone.

This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Automated Deduction in Geometry, ADG 2002, held at Hagenberg Castle, Austria in September 2002.

The 13 revised full papers presented were carefully selected during two rounds of reviewing and improvement. Among the issues addressed are theoretical and methodological topics, such as the resolution of singularities, algebraic geometry and computer algebra; various geometric theorem proving systems are explored; and applications of automated deduction in geometry are demonstrated in fields like computer-aided design and robotics.

This text takes a practical, step-by-step approach to algebraic curves and surface interpolation motivated by the understanding of the many practical applications in engineering analysis, approximation, and curve plotting problems. Because of its usefulness for computing, the algebraic approach is the main theme, but a brief discussion of the synthetic approach is also presented as a way of gaining additional insight before proceeding with the algebraic manipulation. The authors start with simple interpolation, including splines, and extend this in an intuitive fashion to the production of conic sections. They then introduce projective co-ordinates as tools for dealing with higher order curves and singular points. They present many applications and concrete examples, including parabolic interpolation, geometric approximation, and the numerical solution of trajectory problems. In the final chapter they apply the basic theory to the construction of finite element basis functions and surface interpolants over non-regular shapes.

Among the intuitively appealing aspects of graph theory is its close connection to drawings and geometry. The development of computer technology has become a source of motivation to reconsider these connections, in particular geometric graphs are emerging as a new subfield of graph theory. Arrangements of points and lines are the objects for many challenging problems and surprising solutions in combinatorial geometry. The book is a collection of beautiful and partly very recent results from the intersection of geometry, graph theory and combinatorics.

The Morse-Sard theorem is a rather subtle result and the interplay between the high-order analytic structure of the mappings involved and their geometry rarely becomes apparent. The main reason is that the classical Morse-Sard theorem is basically qualitative. This volume gives a proof and also an "explanation" of the quantitative Morse-Sard theorem and related results, beginning with the study of polynomial (or tame) mappings. The quantitative questions, answered by a combination of the methods of real semialgebraic and tame geometry and integral geometry, turn out to be nontrivial and highly productive. The important advantage of this approach is that it allows the separation of the role of high differentiability and that of algebraic geometry in a smooth setting: all the geometrically relevant phenomena appear already for polynomial mappings. The geometric properties obtained are "stable with respect to approximation," and can be imposed on smooth functions via polynomial approximation.

Spaces of holomorphic functions have been a prominent theme in analysis since early in the twentieth century. Of interest to complex analysts, functional analysts, operator theorists, and systems theorists, their study is now flourishing. This volume, an outgrowth of a 1995 program at the Mathematical Sciences Research Institute, contains expository articles by program participants describing the present state of the art. Here researchers and graduate students will encounter Hardy spaces, Bergman spaces, Dirichlet spaces, Hankel and Toeplitz operators, and a sampling of the role these objects play in modern analysis.

Since it was ?rst organized in 1997, the Japan Conference on Discrete and C- putational Geometry (JCDCG) continues to attract an international audience. The ?rst ?ve conferences of the series were held in Tokyo, the sixth in Manila, Philippines. This volume consists of the refereed papers presented at the seventh conference, JCDCG 2002, held in Tokai University, Tokyo, December 6-9, 2002. An eighth conference is planned to be held in Bandung, Indonesia. The proceedings of JCDCG 1998 and JCDCG 2000 were published by Springer-Verlag as part of the series Lecture Notes in Computer Science: LNCS volumes 1763 and 2098, respectively. The proceedings of JCDCG 2001 were also published by Springer-Verlag as a special issue of the journal Graphs and C- binatorics, Vol. 18, No. 4, 2002. The organizers are grateful to Tokai University for sponsoring the conf- ence. They wish to thank all the people who contributed to the success of the conference, in particular, Chie Nara, who headed the conference secretariat, and the principal speakers: Takao Asano, David Avis, Greg N. Frederickson, Ferran Hurtado, Joseph O'Rourke, J anos Pach, Rom Pinchasi, and Jorge Urrutia."