"Based on a lecture series given by the authors at a satellite meeting of the 2006 International Congress of Mathematicians and on many articles written by them and their collaborators, this volume provides a comprehensive up-to-date survey of several core areas of combinatorial geometry. It describes the beginnings of the subject, going back to the nineteenth century (if not to Euclid), and explains why counting incidences and estimating the combinatorial complexity of various arrangements of geometric objects became the theoretical backbone of computational geometry in the 1980s and 1990s. The combinatorial techniques outlined in this book have found applications in many areas of computer science from graph drawing through hidden surface removal and motion planning to frequency allocation in cellular networks. "Combinatorial Geometry and Its Algorithmic Applications" is intended as a source book for professional mathematicians and computer scientists as well as for graduate students interested in combinatorics and geometry. Most chapters start with an attractive, simply formulated, but often difficult and only partially answered mathematical question, and describes the most efficient techniques developed for its solution. The text includes many challenging open problems, figures, and an extensive bibliography."--BOOK JACKET.

'Points, questions, stories, and occasional rants introduce the 24 chapters of this engaging volume. With a focus on mathematics and peppered with a scattering of computer science settings, the entries range from lightly humorous to curiously thought-provoking. Each chapter includes sections and sub-sections that illustrate and supplement the point at hand. Most topics are self-contained within each chapter, and a solid high school mathematics background is all that is needed to enjoy the discussions. There certainly is much to enjoy here.'CHOICEEver notice how people sometimes use math words inaccurately? Or how sometimes you instinctively know a math statement is false (or not known)?Each chapter of this book makes a point like those above and then illustrates the point by doing some real mathematics through step-by-step mathematical techniques.This book gives readers valuable information about how mathematics and theoretical computer science work, while teaching them some actual mathematics and computer science through examples and exercises. Much of the mathematics could be understood by a bright high school student. The points made can be understood by anyone with an interest in math, from the bright high school student to a Field's medal winner.

Presents a Morse theoretic study of a very general class of homogeneous operators that includes the $p$-Laplacian as a special case. The $p$-Laplacian operator is a quasilinear differential operator that arises in many applications such as non-Newtonian fluid flows. Working with a new sequence of eigenvalues that uses the cohomological index, the authors systematically develop alternative tools such as nonlinear linking and local splitting theories in order to effectively apply Morse theory to quasilinear problems.

A study of ergodic, measure preserving actions of countable discrete groups on standard probability spaces. It explores a direction that emphasizes a global point of view, concentrating on the structure of the space of measure preserving actions of a given group and its associated cocycle spaces.

This book provides a self-contained presentation of classical and new methods for studying wave phenomena that are related to the existence and stability of solitary and periodic travelling wave solutions for nonlinear dispersive evolution equations. Simplicity, concrete examples, and applications are emphasized throughout in order to make the material easily accessible. The list of classical nonlinear dispersive equations studied include Korteweg-de Vries, Benjamin-Ono, and Schrodinger equations. Many special Jacobian elliptic functions play a role in these examples. The author brings the reader to the forefront of knowledge about some aspects of the theory and motivates future developments in this fascinating and rapidly growing field. The book can be used as an instructive study guide as well as a reference by students and mature scientists interested in nonlinear wave phenomena.

Descriptive Set Theory is the study of sets in separable, complete metric spaces that can be defined (or constructed), and so can be expected to have special properties not enjoyed by arbitrary pointsets. This subject was started by the French analysts at the turn of the 20th century, most prominently Lebesgue, and, initially, was concerned primarily with establishing regularity properties of Borel and Lebesgue measurable functions, and analytic, coanalytic, and projective sets. Its rapid development came to a halt in the late 1930s, primarily because it bumped against problems which were independent of classical axiomatic set theory. The field became very active again in the 1960s, with the introduction of strong set-theoretic hypotheses and methods from logic (especially recursion theory), which revolutionized it. This monograph develops Descriptive Set Theory systematically, from its classical roots to the modern ?effective? theory and the consequences of strong (especially determinacy) hypotheses. The book emphasizes the foundations of the subject, and it sets the stage for the dramatic results (established since the 1980s) relating large cardinals and determinacy or allowing applications of Descriptive Set Theory to classical mathematics. The book includes all the necessary background from (advanced) set theory, logic and recursion theory.

Involves important and non-trivial results in contemporary probability theory motivated by polymer models, as well as other topics of importance in physics and chemistry.

Parabolic geometries encompass a very diverse class of geometric structures, including such important examples as conformal, projective, and almost quaternionic structures, hypersurface type CR-structures and various types of generic distributions. The characteristic feature of parabolic geometries is an equivalent description by a Cartan geometry modeled on a generalized flag manifold (the quotient of a semisimple Lie group by a parabolic subgroup). Background on differential geometry, with a view towards Cartan connections, and on semisimple Lie algebras and their representations, which play a crucial role in the theory, is collected in two introductory chapters. The main part discusses the equivalence between Cartan connections and underlying structures, including a complete proof of Kostant's version of the Bott–Borel–Weil theorem, which is used as an important tool. For many examples, the complete description of the geometry and its basic invariants is worked out in detail. The constructions of correspondence spaces and twistor spaces and analogs of the Fefferman construction are presented both in general and in several examples. The last chapter studies Weyl structures, which provide classes of distinguished connections as well as an equivalent description of the Cartan connection in terms of data associated to the underlying geometry. Several applications are discussed throughout the text.

Focusing on the study of real connective $K$-theory including $ko^*(BG)$ as a ring and $ko_*(BG)$ as a module over it, the authors define equivariant versions of connective $KO$-theory and connective $K$-theory with reality, in the sense of Atiyah, which give well-behaved, Noetherian, uncompleted versions of the theory.

This book constitutes the refereed proceedings of the 23rd International Symposium on Algorithms and Computation, ISAAC 2012, held in Taipei, Taiwan, in December 2012. The 68 revised full papers presented together with three invited talks were carefully reviewed and selected from 174 submissions for inclusion in the book. This volume contains topics such as graph algorithms; online and streaming algorithms; combinatorial optimization; computational complexity; computational geometry; string algorithms; approximation algorithms; graph drawing; data structures; randomized algorithms; and algorithmic game theory.