This book offers a complete and streamlined treatment of the central principles of abelian harmonic analysis: Pontryagin duality, the Plancherel theorem and the Poisson summation formula, as well as their respective generalizations to non-abelian groups, including the Selberg trace formula. The principles are then applied to spectral analysis of Heisenberg manifolds and Riemann surfaces. This new edition contains a new chapter on p-adic and adelic groups, as well as a complementary section on direct and projective limits. Many of the supporting proofs have been revised and refined. The book is an excellent resource for graduate students who wish to learn and understand harmonic analysis and for researchers seeking to apply it.

Writing Virtual Environments for Software Visualization book describes the software for a networked, 3D multi-user virtual environment that allows users to create and share remotely visualizations of program behavior. Collaborative virtual environments such as World of Warcraft or Second Life are a popular way to share interactive internet experiences, but they are complex and difficult to create. Software visualization is an area that may enable important advances in our ability to understand and reduce the costs of maintaining software. Applying the former technology to this problem area will be valuable to distributed and multi-institutional software development and educational users. The author covers the major features of collaborative virtual environments and how to program them in a very high level language. The book also examines the application of popular game-like software technologies.

Visualization research aims to provide insight into large, complicated data sets and the phenomena behind them. While there are di?erent methods of reaching this goal, topological methods stand out for their solid mathem- ical foundation, which guides the algorithmic analysis and its presentation. Topology-based methods in visualization have been around since the beg- ning of visualization as a scienti?c discipline, but they initially played only a minor role. In recent years,interest in topology-basedvisualization has grown andsigni?cantinnovationhasledto newconceptsandsuccessfulapplications. The latest trends adapt basic topological concepts to precisely express user interests in topological properties of the data. This book is the outcome of the second workshop on Topological Methods in Visualization, which was held March 4-6, 2007 in Kloster Nimbschen near Leipzig,Germany.Theworkshopbroughttogethermorethan40international researchers to present and discuss the state of the art and new trends in the ?eld of topology-based visualization. Two inspiring invited talks by George Haller, MIT, and Nelson Max, LLNL, were accompanied by 14 presentations by participants and two panel discussions on current and future trends in visualization research. This book contains thirteen research papers that have been peer-reviewed in a two-stage review process. In the ?rst phase, submitted papers where peer-reviewed by the international program committee. After the workshop accepted papers went through a revision and a second review process taking into account comments from the ?rst round and discussions at the workshop. Abouthalfthepapersconcerntopology-basedanalysisandvisualizationof ?uid?owsimulations;twopapersconcernmoregeneraltopologicalalgorithms, while the remaining papers discuss topology-based visualization methods in application areas like biology, medical imaging and electromagnetism.

Projective geometry is one of the most fundamental and at the same time most beautiful branches of geometry. It can be considered the common foundation of many other geometric disciplines like Euclidean geometry, hyperbolic and elliptic geometry or even relativistic space-time geometry. This book offers a comprehensive introduction to this fascinating field and its applications. In particular, it explains how metric concepts may be best understood in projective terms. One of the major themes that appears throughout this book is the beauty of the interplay between geometry, algebra and combinatorics. This book can especially be used as a guide that explains how geometric objects and operations may be most elegantly expressed in algebraic terms, making it a valuable resource for mathematicians, as well as for computer scientists and physicists. The book is based on the author's experience in implementing geometric software and includes hundreds of high-quality illustrations.

For some time, medicine has been an important driver for the development of data processing and visualization techniques. Improved technology offers the capacity to generate larger and more complex data sets related to imaging and simulation. This, in turn, creates the need for more effective visualization tools for medical practitioners to interpret and utilize data in meaningful ways. The first edition of Visualization in Medicine and Life Sciences (VMLS) emerged from a workshop convened to explore the significant data visualization challenges created by emerging technologies in the life sciences. The workshop and the book addressed questions of whether medical data visualization approaches can be devised or improved to meet these challenges, with the promise of ultimately being adopted by medical experts. Visualization in Medicine and Life Sciences II follows the second international VMLS workshop, held in Bremerhaven, Germany, in July 2009. Internationally renowned experts from the visualization and driving application areas came together for this second workshop. The book presents peer-reviewed research and survey papers which document and discuss the progress made, explore new approaches to data visualization, and assess new challenges and research directions.

Mathematics in the Real World is a self-contained, accessible introduction to the world of mathematics for non-technical majors. With a focus on everyday applications and context, the topics in this textbook build in difficulty and are presented sequentially, starting with a brief review of sets and numbers followed by an introduction to elementary statistics, models, and graph theory. Data and identification numbers are then covered, providing the pathway to voting and finance. Each subject is covered in a concise and clear fashion through the use of real-world applications and the introduction of relevant terminology. Many sample problems - both writing exercises and multiple-choice questions - are included to help develop students' level of understanding and to offer a variety of options to instructors. Covering six major units and outlining a one-semester course, Mathematics in the Real World is aimed at undergraduate liberal art students fulfilling the mathematics requirement in their degree program. This introductory text will be an excellent resource for such courses, and will show students where mathematics arises in their everyday lives.

As a student moves from basic calculus courses into upper-division courses in linear and abstract algebra, real and complex analysis, number theory, topology, and so on, a "bridge" course can help ensure a smooth transition. Introduction to Mathematical Structures and Proofs is a textbook intended for such a course, or for self-study. This book introduces an array of fundamental mathematical structures. It also explores the delicate balance of intuition and rigor-and the flexible thinking-required to prove a nontrivial result. In short, this book seeks to enhance the mathematical maturity of the reader. The new material in this second edition includes a section on graph theory, several new sections on number theory (including primitive roots, with an application to card-shuffling), and a brief introduction to the complex numbers (including a section on the arithmetic of the Gaussian integers). Solutions for even numbered exercises are available on springer.com for instructors adopting the text for a course.

This monograph covers some of the most important developments in Ramsey theory from its beginnings in the early 20th century via its many breakthroughs to recent important developments in the early 21st century. The book first presents a detailed discussion of the roots of Ramsey theory before offering a thorough discussion of the role of parameter sets. It presents several examples of structures that can be interpreted in terms of parameter sets and features the most fundamental Ramsey-type results for parameter sets: Hales-Jewett's theorem and Graham-Rothschild(1)s Ramsey theorem as well as their canonical versions and several applications. Next, the book steps back to the most basic structure, to sets. It reviews classic results as well as recent progress on Ramsey numbers and the asymptotic behavior of classical Ramsey functions. In addition, it presents product versions of Ramsey's theorem, a combinatorial proof of the incompleteness of Peano arithmetic, provides a digression to discrepancy theory and examines extensions of Ramsey's theorem to larger cardinals. The next part of the book features an in-depth treatment of the Ramsey problem for graphs and hypergraphs. It gives an account on the existence of sparse and restricted Ramsey theorem's using sophisticated constructions as well as probabilistic methods. Among others it contains a proof of the induced Graham-Rothschild theorem and the random Ramsey theorem. The book closes with a chapter on one of the recent highlights of Ramsey theory: a combinatorial proof of the density Hales-Jewett theorem. This book provides graduate students as well as advanced researchers with a solid introduction and reference to the field.

This book introduces novel techniques and algorithms necessary to support the formation of social networks. Concepts such as link prediction, graph patterns, recommendation systems based on user reputation, strategic partner selection, collaborative systems and network formation based on 'social brokers' are presented. Chapters cover a wide range of models and algorithms, including graph models and a personalized PageRank model. Extensive experiments and scenarios using real world datasets from GitHub, Facebook, Twitter, Google Plus and the European Union ICT research collaborations serve to enhance reader understanding of the material with clear applications. Each chapter concludes with an analysis and detailed summary. Social Network-Based Recommender Systems is designed as a reference for professionals and researchers working in social network analysis and companies working on recommender systems. Advanced-level students studying computer science, statistics or mathematics will also find this books useful as a secondary text.

The problem of counting the number of self-avoiding polygons on a square grid, - therbytheirperimeterortheirenclosedarea,is aproblemthatis soeasytostate that, at ?rst sight, it seems surprising that it hasn't been solved. It is however perhaps the simplest member of a large class of such problems that have resisted all attempts at their exact solution. These are all problems that are easy to state and look as if they should be solvable. They include percolation, in its various forms, the Ising model of ferromagnetism, polyomino enumeration, Potts models and many others. These models are of intrinsic interest to mathematicians and mathematical physicists, but can also be applied to many other areas, including economics, the social sciences, the biological sciences and even to traf?c models. It is the widespread applicab- ity of these models to interesting phenomena that makes them so deserving of our attention. Here however we restrict our attention to the mathematical aspects. Here we are concerned with collecting together most of what is known about polygons, and the closely related problems of polyominoes. We describe what is known, taking care to distinguish between what has been proved, and what is c- tainlytrue,but has notbeenproved. Theearlierchaptersfocusonwhatis knownand on why the problems have not been solved, culminating in a proof of unsolvability, in a certain sense. The next chapters describe a range of numerical and theoretical methods and tools for extracting as much information about the problem as possible, in some cases permittingexactconjecturesto be made.

This book shows how to look at ways of visualizing large datasets, whether large in numbers of cases, or large in numbers of variables, or large in both. All ideas are illustrated with displays from analyses of real datasets and the importance of interpreting displays effectively is emphasized. Graphics should be drawn to convey information and the book includes many insightful examples. New approaches to graphics are needed to visualize the information in large datasets and most of the innovations described in this book are developments of standard graphics. The book is accessible to readers with some experience of drawing statistical graphics.

This is the first comprehensive monograph on the mathematical theory of the solitaire game "The Tower of Hanoi" which was invented in the 19th century by the French number theorist Edouard Lucas. The book comprises a survey of the historical development from the game's predecessors up to recent research in mathematics and applications in computer science and psychology. Apart from long-standing myths it contains a thorough, largely self-contained presentation of the essential mathematical facts with complete proofs, including also unpublished material. The main objects of research today are the so-called Hanoi graphs and the related Sierpinski graphs. Acknowledging the great popularity of the topic in computer science, algorithms and their correctness proofs form an essential part of the book. In view of the most important practical applications of the Tower of Hanoi and its variants, namely in physics, network theory, and cognitive (neuro)psychology, other related structures and puzzles like, e.g., the "Tower of London", are addressed. Numerous captivating integer sequences arise along the way, but also many open questions impose themselves. Central among these is the famed Frame-Stewart conjecture. Despite many attempts to decide it and large-scale numerical experiments supporting its truth, it remains unsettled after more than 70 years and thus demonstrates the timeliness of the topic. Enriched with elaborate illustrations, connections to other puzzles and challenges for the reader in the form of (solved) exercises as well as problems for further exploration, this book is enjoyable reading for students, educators, game enthusiasts and researchers alike.

The authors present tools and concepts of multivariate data analysis by means of exercises and their solutions. The first part is devoted to graphical techniques. The second part deals with multivariate random variables and presents the derivation of estimators and tests for various practical situations. The last part introduces a wide variety of exercises in applied multivariate data analysis. The book demonstrates the application of simple calculus and basic multivariate methods in real life situations. It contains altogether more than 250 solved exercises which can assist a university teacher in setting up a modern multivariate analysis course. All computer-based exercises are available in the R language. All data sets are included in the library SMSdata that may be downloaded via the quantlet download center www.quantlet.org. Data sets are available also via the Springer webpage. For interactive display of low-dimensional projections of a multivariate data set, we recommend GGobi.

Interest in visualization design has increased in recent years. While there is a large body of existing work from which visualization designers can draw, much of the past research has focused on developing new tools and techniques that are aimed at specific contexts. Less focus has been placed on developing holistic frameworks, models, and theories that can guide visualization design at a general level-a level that transcends domains, data types, users, and other contextual factors. In addition, little emphasis has been placed on the thinking processes of designers, including the concepts that designers use, while they are engaged in a visualization design activity. In this book we present a general, holistic framework that is intended to support visualization design for human-information interaction. The framework is composed of a number of conceptual elements that can aid in design thinking. The core of the framework is a pattern language-consisting of a set of 14 basic, abstract patterns-and a simple syntax for describing how the patterns are blended. We also present a design process, made up of four main stages, for creating static or interactive visualizations. The 4-stage design process places the patterns at the core of designers' thinking, and employs a number of conceptual tools that help designers think systematically about creating visualizations based on the information they intend to represent. Although the framework can be used to design static visualizations for simple tasks, its real utility can be found when designing visualizations with interactive possibilities in mind-in other words, designing to support a human-information interactive discourse. This is especially true in contexts where interactive visualizations need to support complex tasks and activities involving large and complex information spaces. The framework is intended to be general and can thus be used to design visualizations for diverse domains, users, information spaces, and tasks in different fields such as business intelligence, health and medical informatics, digital libraries, journalism, education, scientific discovery, and others. Drawing from research in multiple disciplines, we introduce novel concepts and terms that can positively contribute to visualization design practice and education, and will hopefully stimulate further research in this area.

This textbook provides an introduction to the Catalan numbers and their remarkable properties, along with their various applications in combinatorics. Intended to be accessible to students new to the subject, the book begins with more elementary topics before progressing to more mathematically sophisticated topics. Each chapter focuses on a specific combinatorial object counted by these numbers, including paths, trees, tilings of a staircase, null sums in Zn+1, interval structures, partitions, permutations, semiorders, and more. Exercises are included at the end of book, along with hints and solutions, to help students obtain a better grasp of the material. The text is ideal for undergraduate students studying combinatorics, but will also appeal to anyone with a mathematical background who has an interest in learning about the Catalan numbers. "Roman does an admirable job of providing an introduction to Catalan numbers of a different nature from the previous ones. He has made an excellent choice of topics in order to convey the flavor of Catalan combinatorics. [Readers] will acquire a good feeling for why so many mathematicians are enthralled by the remarkable ubiquity and elegance of Catalan numbers." - From the foreword by Richard Stanley

This book constitutes the thoroughly refereed post-workshop proceedings for the 26 International Workshop on combinatorial Algorithms, IWOCA 2015, held in Verona, Italy, in October 2015. The 29 revised full papers presented were carefully reviewed and selected from a total of 90 submissions. The topics of the papers include algorithms and data structures (including sequential, parallel, distributed, approximation, probabilistic, randomised, and on-line algorithms), algorithms on strings and graphs; applications (bioinformatics, music analysis, networking, and others); combinatorics on words; combinatorial enumeration; combinatorial optimization; complexity theory; computational biology; compression and information retrieval; cryptography and information security; decompositions and combinatorial designs; discrete and computational geometry; graph drawing and labeling; graph theory.

With the unifying theme of abstract evolutionary equations, both linear and nonlinear, in a complex environment, the book presents a multidisciplinary blend of topics, spanning the fields of theoretical and applied functional analysis, partial differential equations, probability theory and numerical analysis applied to various models coming from theoretical physics, biology, engineering and complexity theory. Truly unique features of the book are: the first simultaneous presentation of two complementary approaches to fragmentation and coagulation problems, by weak compactness methods and by using semigroup techniques, comprehensive exposition of probabilistic methods of analysis of long term dynamics of dynamical systems, semigroup analysis of biological problems and cutting edge pattern formation theory. The book will appeal to postgraduate students and researchers specializing in applications of mathematics to problems arising in natural sciences and engineering.

This book constitutes the refereed proceedings of the 10th International Conference on Combinatorics on Words, WORDS 2015, held in Kiel, Germany, in September 2015 under the auspices of the EATCS. The 14 revised full papers presented were carefully reviewed and selected from 22 submissions. The main object in the contributions are words, finite or infinite sequences of symbols over a finite alphabet. The papers reflect both theoretical contributions related to combinatorial, algebraic, and algorithmic aspects of words, as well as to contributions presenting applications of the theory of words in other field of computer science, linguistics, biology, bioinformatics, or physics.

In the last decade, the areas of quadratic and higher degree forms have witnessed dramatic advances. This volume is an outgrowth of three seminal conferences on these topics held in 2009, two at the University of Florida and one at the Arizona Winter School. The volume also includes papers from the two focused weeks on quadratic forms and integral lattices at the University of Florida in 2010.Topics discussed include the links between quadratic forms and automorphic forms, representation of integers and forms by quadratic forms, connections between quadratic forms and lattices, and algorithms for quaternion algebras and quadratic forms. The book will be of interest to graduate students and mathematicians wishing to study quadratic and higher degree forms, as well as to established researchers in these areas. Quadratic and Higher Degree Forms contains research and semi-expository papers that stem from the presentations at conferences at the University of Florida as well as survey lectures on quadratic forms based on the instructional workshop for graduate students held at the Arizona Winter School. The survey papers in the volume provide an excellent introduction to various aspects of the theory of quadratic forms starting from the basic concepts and provide a glimpse of some of the exciting questions currently being investigated. The research and expository papers present the latest advances on quadratic and higher degree forms and their connections with various branches of mathematics.

This volume, as Andrew M. Odlzyko writes in the foreword, "commemorates and celebrates the life and achievements of an extraordinary person." Originally conceived as an 80th birthday tribute to Herbert Wilf, the well-known combinatorialist, the book has evolved beyond the proceeds of the W80 tribute. Professor Wilf was an award-winning teacher, who was supportive of women mathematicians, and who had an unusually high proportion of women among his PhD candidates. He was Editor-in-chief of the American Mathematical Monthly and a founder of both the Journal of Algorithms and of the Electronic Journal of Combinatorics. But he was first a researcher, driven by his desire to know and explain the inner workings of the mathematical world. The book collects high-quality, refereed research contributions by some of Professor Wilf's colleagues, students, and collaborators. Many of the papers presented here were featured in the Third Waterloo Workshop on Computer Algebra (WWCA 2011, W80), held May 26-29, 2011 at Wilfrid Laurier University, Waterloo, Canada. Others were included because of their relationship to his important work in combinatorics. All are presented as a tribute to Herb Wilf's contributions to mathematics and mathematical life.

This is the most comprehensive survey of the mathematical life of the legendary Paul Erdos (1913-1996), one of the most versatile and prolific mathematicians of our time. For the first time, all the main areas of Erdos' research are covered in a single project. Because of overwhelming response from the mathematical community, the project now occupies over 1000 pages, arranged into two volumes. These volumes contain both high level research articles as well as key articles that survey some of the cornerstones of Erdos' work, each written by a leading world specialist in the field. A special chapter "Early Days", rare photographs, and art related to Erdos complement this striking collection. A unique contribution is the bibliography on Erdos' publications: the most comprehensive ever published. This new edition, dedicated to the 100th anniversary of Paul Erdos' birth, contains updates on many of the articles from the two volumes of the first edition, several new articles from prominent mathematicians, a new introduction, and more biographical information about Paul Erdos with an updated list of publications. The second volume contains chapters on graph theory and combinatorics, extremal and Ramsey theory, and a section on infinity that covers Erdos' research on set theory. All of these chapters are essentially updated, particularly the extremal theory chapter that contains a survey of flag algebras, a new technique for solving extremal problems.

This textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. The author describes and analyses some of the best-known algorithms for colouring graphs, focusing on whether these heuristics can provide optimal solutions in some cases; how they perform on graphs where the chromatic number is unknown; and whether they can produce better solutions than other algorithms for certain types of graphs, and why. The introductory chapters explain graph colouring, complexity theory, bounds and constructive algorithms. The author then shows how advanced, graph colouring techniques can be applied to classic real-world operational research problems such as designing seating plans, sports scheduling, and university timetabling. He includes many examples, suggestions for further reading, and historical notes, and the book is supplemented by an online suite of downloadable code. The book is of value to researchers, graduate students, and practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence. The reader should have elementary knowledge of sets, matrices, and enumerative combinatorics.

The discrete Fourier transform (DFT) is an extremely useful tool that finds application in many different disciplines. However, its use requires caution. The aim of this book is to explain the DFT and its various artifacts and pitfalls and to show how to avoid these (whenever possible), or at least how to recognize them in order to avoid misinterpretations. This concentrated treatment of the DFT artifacts and pitfalls in a single volume is, indeed, new, and it makes this book a valuable source of information for the widest possible range of DFT users. Special attention is given to the one and two dimensional cases due to their particular importance, but the discussion covers the general multidimensional case, too. The book favours a pictorial, intuitive approach which is supported by mathematics, and the discussion is accompanied by a large number of figures and illustrative examples, some of which are visually attractive and even spectacular. Mastering the Discrete Fourier Transform in One, Two or Several Dimensions is intended for scientists, engineers, students and any readers who wish to widen their knowledge of the DFT and its practical use. This book will also be very useful for 'naive' users from various scientific or technical disciplines who have to use the DFT for their respective applications. The prerequisite mathematical background is limited to an elementary familiarity with calculus and with the continuous and discrete Fourier theory.

Explaining how graph theory and social network analysis can be applied to team sports analysis, This book presents useful approaches, models and methods that can be used to characterise the overall properties of team networks and identify the prominence of each team player. Exploring the different possible network metrics that can be utilised in sports analysis, their possible applications and variances from situation to situation, the respective chapters present an array of illustrative case studies. Identifying the general concepts of social network analysis and network centrality metrics, readers are shown how to generate a methodological protocol for data collection. As such, the book provides a valuable resource for students of the sport sciences, sports engineering, applied computation and the social sciences.

This image-rich book explores the practice as well as the theory of visual representation and presents us with the importance of designing appropriate images for communication to specific target audiences. This includes the appropriate choice of high-tech digital or low-tech analogue technologies in image-making for communication within the medical education, biological research and community health contexts. We hear from medical students about the value of using clay modelling in their understanding of anatomy, from educators and curriculum designers about visual affordances in medical education and from a community-driven project in South Africa about their innovative use of locally designed images and culture-specific narratives for communicating important health information to marginalised communities. A chapter explores the evolution of scientific visualisation and representation of big data to a variety of audiences, and another presents the innovative 3D construction of internal cellular structures from microscopic 2D slices. As we embrace blended learning in anatomy education, a timely chapter prompts us to think further about and contribute to the ongoing discourse around important ethical considerations in the use and sharing of digital images of body donors. This book will appeal to educators, medical illustrators, curriculum designers, post-graduate students, community health practitioners and biomedical researchers.