The new 6th edition of Applied Combinatorics builds on the previous editions with more in depth analysis of computer systems in order to help develop proficiency in basic discrete math problem solving.

As one of the most widely used book in combinatorial problems, this edition explains how to reason and model combinatorically while stressing the systematic analysis of different possibilities, exploration of the logical structure of a problem, and ingenuity. Although important uses of combinatorics in computer science, operations research, and finite probability are mentioned, these applications are often used solely for motivation. Numerical examples involving the same concepts use more interesting settings such as poker probabilities or logical games.

This book is designed for use by students with a wide range of ability and maturity (sophomores through beginning graduate students). The stronger the students, the harder the exercises that can be assigned. The book can be used for one-quarter, two-quarter, or one-semester course depending on how much material is used.

In the world of mathematics and computer science, technological advancements are constantly being researched and applied to ongoing issues. Setbacks in social networking, engineering, and automation are themes that affect everyday life, and researchers have been looking for new techniques in which to solve these challenges. Graph theory is a widely studied topic that is now being applied to real-life problems. Advanced Applications of Graph Theory in Modern Society is an essential reference source that discusses recent developments on graph theory, as well as its representation in social networks, artificial neural networks, and many complex networks. The book aims to study results that are useful in the fields of robotics and machine learning and will examine different engineering issues that are closely related to fuzzy graph theory. Featuring research on topics such as artificial neural systems and robotics, this book is ideally designed for mathematicians, research scholars, practitioners, professionals, engineers, and students seeking an innovative overview of graphic theory.

This book surveys the mathematical and computational properties of finite sets of points in the plane, covering recent breakthroughs on important problems in discrete geometry, and listing many open problems. It unifies these mathematical and computational views using forbidden configurations, which are patterns that cannot appear in sets with a given property, and explores the implications of this unified view. Written with minimal prerequisites and featuring plenty of figures, this engaging book will be of interest to undergraduate students and researchers in mathematics and computer science. Most topics are introduced with a related puzzle or brain-teaser. The topics range from abstract issues of collinearity, convexity, and general position to more applied areas including robust statistical estimation and network visualization, with connections to related areas of mathematics including number theory, graph theory, and the theory of permutation patterns. Pseudocode is included for many algorithms that compute properties of point sets.

MESH ist ein mathematisches Video ber vielfl chige Netzwerke und ihre Rolle in der Geometrie, der Numerik und der Computergraphik. Der unter Anwendung der neuesten Technologie vollst ndig computergenierte Film spannt einen Bogen von der antiken griechischen Mathematik zum Gebiet der heutigen geometrischen Modellierung. MESH hat zahlreiche wissenschaftliche Preise weltweit gewonnen. Die Autoren sind Konrad Polthier, ein Professor der Mathematik, und Beau Janzen, ein professioneller Filmdirektor.

Der Film ist ein ausgezeichnetes Lehrmittel f r Kurse in Geometrie, Visualisierung, wissenschaftlichem Rechnen und geometrischer Modellierung an Universit ten, Zentren f r wissenschaftliches Rechnen, kann jedoch auch an Schulen genutzt werden.

A magician appears able to banish chaos at will: a deck of cards arranged in order is shuffled--apparently randomly--by a member of the audience. Then, hey presto! The deck is suddenly put back in its original order! Magic tricks like this are easy to perform and have an interesting mathematical foundation. In this rich, colorfully illustrated volume, Ehrhard Behrends presents around 30 card tricks and number games that are easy to learn, with no prior knowledge required. This is math as you've never experienced it before: entertaining and fun!

Simulating for a crisis is far more than creating a simulation of a crisis situation. In order for a simulation to be useful during a crisis, it should be created within the space of a few days to allow decision makers to use it as quickly as possible. Furthermore, during a crisis the aim is not to optimize just one factor, but to balance various, interdependent aspects of life. In the COVID-19 crisis, decisions had to be made concerning e.g. whether to close schools and restaurants, and the (economic) consequences of a 3 or 4-week lock-down had to be considered. As such, rather than one simulation focusing on a very limited aspect, a framework allowing the simulation of several different scenarios focusing on different aspects of the crisis was required. Moreover, the results of the simulations needed to be easily understandable and explainable: if a simulation indicates that closing schools has no effect, this can only be used if the decision makers can explain why this is the case. This book describes how a simulation framework was created for the COVID-19 crisis, and demonstrates how it was used to simulate a wide range of scenarios that were relevant for decision makers at the time. It also discusses the usefulness of the approach, and explains the decisions that had to be made along the way as well as the trade-offs. Lastly, the book examines the lessons learned and the directions for the further development of social simulation frameworks to make them better suited to crisis situations, and to foster a more resilient society.

This book is the essential companion to Counting (2nd Edition) (World Scientific, 2013), an introduction to combinatorics for secondary to undergraduate students. The book gives solutions to the exercises in Counting (2nd Edition). There is often more than one method to solve a particular problem and the authors have included alternative solutions whenever they are of interest. The rigorous and clear solutions will aid the reader in further understanding the concepts and applications in Counting (2nd Edition). An introductory section on problem solving as described by George P lya will be useful in helping the lay person understand how mathematicians think and solve problems.

This book in its Second Edition is a useful, attractive introduction to basic counting techniques for upper secondary to undergraduate students, as well as teachers. Younger students and lay people who appreciate mathematics, not to mention avid puzzle solvers, will also find the book interesting. The various problems and applications here are good for building up proficiency in counting. They are also useful for honing basic skills and techniques in general problem solving. Many of the problems avoid routine and the diligent reader will often discover more than one way of solving a particular problem, which is indeed an important awareness in problem solving. The book thus helps to give students an early start to learning problem-solving heuristics and thinking skills.New chapters originally from a supplementary book have been added in this edition to substantially increase the coverage of counting techniques. The new chapters include the Principle of Inclusion and Exclusion, the Pigeonhole Principle, Recurrence Relations, the Stirling Numbers and the Catalan Numbers. A number of new problems have also been added to this edition.

The Workshop for Women in Graph Theory and Applications was held at the Institute for Mathematics and Its Applications (University of Minnesota, Minneapolis) on August 19-23, 2019. During this five-day workshop, 42 participants performed collaborative research, in six teams, each focused on open problems in different areas of graph theory and its applications. The research work of each team was led by two experts in the corresponding area, who prior to the workshop, carefully selected relevant and meaningful open problems that would yield high-quality research and results of strong impact. As a result, all six teams have made significant contributions to several open problems in their respective areas. The workshop led to the creation of the Women in Graph Theory and Applications Research Collaboration Network, which provided the framework to continue collaborating and to produce this volume. This book contains six chapters, each of them on one of the different areas of research at the Workshop for Women in Graph Theory and Applications, and written by participants of each team.

Updated to reflect current research, Algebraic Number Theory and Fermat's Last Theorem, Fourth Edition introduces fundamental ideas of algebraic numbers and explores one of the most intriguing stories in the history of mathematics-the quest for a proof of Fermat's Last Theorem. The authors use this celebrated theorem to motivate a general study of the theory of algebraic numbers from a relatively concrete point of view. Students will see how Wiles's proof of Fermat's Last Theorem opened many new areas for future work. New to the Fourth Edition Provides up-to-date information on unique prime factorization for real quadratic number fields, especially Harper's proof that Z( 14) is Euclidean Presents an important new result: Mihailescu's proof of the Catalan conjecture of 1844 Revises and expands one chapter into two, covering classical ideas about modular functions and highlighting the new ideas of Frey, Wiles, and others that led to the long-sought proof of Fermat's Last Theorem Improves and updates the index, figures, bibliography, further reading list, and historical remarks Written by preeminent mathematicians Ian Stewart and David Tall, this text continues to teach students how to extend properties of natural numbers to more general number structures, including algebraic number fields and their rings of algebraic integers. It also explains how basic notions from the theory of algebraic numbers can be used to solve problems in number theory.

This book presents original peer-reviewed contributions from the London Mathematical Society (LMS) Midlands Regional Meeting and Workshop on 'Galois Covers, Grothendieck-Teichmuller Theory and Dessinsd'Enfants', which took place at the University of Leicester, UK, from 4 to 7 June, 2018. Within the theme of the workshop, the collected articles cover a broad range of topics and explore exciting new links between algebraic geometry, representation theory, group theory, number theory and algebraic topology. The book combines research and overview articles by prominent international researchers and provides a valuable resource for researchers and students alike.

Secret sharing schemes form one of the most important topic in Cryptography. These protocols are used in many areas, applied mathematics, computer science, electrical engineering. A secret is divided into several pieces called shares. Each share is given to a user of the system. Each user has no information about the secret, but the secret can be retrieved by certain authorized coalition of users.This book is devoted to such schemes inspired by Coding Theory. The classical schemes of Shamir, Blakley, Massey are recalled. Survey is made of research in Combinatorial Coding Theory they triggered, mostly self-dual codes, and minimal codes. Applications to engineering like image processing, and key management of MANETs are highlighted.

This book focuses on the latest developments in behaviormetrics and data science, covering a wide range of topics in data analysis and related areas of data science, including analysis of complex data, analysis of qualitative data, methods for high-dimensional data, dimensionality reduction, visualization of such data, multivariate statistical methods, analysis of asymmetric relational data, and various applications to real data. In addition to theoretical and methodological results, it also shows how to apply the proposed methods to a variety of problems, for example in consumer behavior, decision making, marketing data, and social network structures. Moreover, it discuses methodological aspects and applications in a wide range of areas, such as behaviormetrics; behavioral science; psychology; and marketing, management and social sciences. Combining methodological advances with real-world applications collected from a variety of research fields, the book is a valuable resource for researchers and practitioners, as well as for applied statisticians and data analysts.

This volume highlights the mathematical research presented at the 2019 Association for Women in Mathematics (AWM) Research Symposium held at Rice University, April 6-7, 2019. The symposium showcased research from women across the mathematical sciences working in academia, government, and industry, as well as featured women across the career spectrum: undergraduates, graduate students, postdocs, and professionals. The book is divided into eight parts, opening with a plenary talk and followed by a combination of research paper contributions and survey papers in the different areas of mathematics represented at the symposium: algebraic combinatorics and graph theory algebraic biology commutative algebra analysis, probability, and PDEs topology applied mathematics mathematics education

This two-volume set presents combinatorial functional equations using an algebraic approach, and illustrates their applications in combinatorial maps, graphs, networks, etc. The first volume mainly presents basic concepts and the theoretical background. Differential (ordinary and partial) equations and relevant topics are discussed in detail.

This book describes active illumination techniques in computer vision. We can classify computer vision techniques into two classes: passive and active techniques. Passive techniques observe the scene statically and analyse it as is. Active techniques give the scene some actions and try to facilitate the analysis. In particular, active illumination techniques project specific light, for which the characteristics are known beforehand, to a target scene to enable stable and accurate analysis of the scene. Traditional passive techniques have a fundamental limitation. The external world surrounding us is three-dimensional; the image projected on a retina or an imaging device is two-dimensional. That is, reduction of one dimension has occurred. Active illumination techniques compensate for the dimensional reduction by actively controlling the illumination. The demand for reliable vision sensors is rapidly increasing in many application areas, such as robotics and medical image analysis. This book explains this new endeavour to explore the augmentation of reduced dimensions in computer vision. This book consists of three parts: basic concepts, techniques, and applications. The first part explains the basic concepts for understanding active illumination techniques. In particular, the basic concepts of optics are explained so that researchers and engineers outside the field can understand the later chapters. The second part explains currently available active illumination techniques, covering many techniques developed by the authors. The final part shows how such active illumination techniques can be applied to various domains, describing the issue to be overcome by active illumination techniques and the advantages of using these techniques. This book is primarily aimed at 4th year undergraduate and 1st year graduate students, and will also help engineers from fields beyond computer vision to use active illumination techniques. Additionally, the book is suitable as course material for technical seminars.

The spectral geometry of infinite graphs deals with three major themes and their interplay: the spectral theory of the Laplacian, the geometry of the underlying graph, and the heat flow with its probabilistic aspects. In this book, all three themes are brought together coherently under the perspective of Dirichlet forms, providing a powerful and unified approach. The book gives a complete account of key topics of infinite graphs, such as essential self-adjointness, Markov uniqueness, spectral estimates, recurrence, and stochastic completeness. A major feature of the book is the use of intrinsic metrics to capture the geometry of graphs. As for manifolds, Dirichlet forms in the graph setting offer a structural understanding of the interaction between spectral theory, geometry and probability. For graphs, however, the presentation is much more accessible and inviting thanks to the discreteness of the underlying space, laying bare the main concepts while preserving the deep insights of the manifold case. Graphs and Discrete Dirichlet Spaces offers a comprehensive treatment of the spectral geometry of graphs, from the very basics to deep and thorough explorations of advanced topics. With modest prerequisites, the book can serve as a basis for a number of topics courses, starting at the undergraduate level.

Algebraic combinatorics is the study of combinatorial objects as an extension of the study of finite permutation groups, or, in other words, group theory without groups. In the spirit of Delsarte's theory, this book studies combinatorial objects such as graphs, codes, designs, etc. in the general framework of association schemes, providing a comprehensive overview of the theory as well as pointing out to extensions.

This book comprehensively covers the important efforts in improving the quality of images in visual cryptography (VC), with a focus on cases with gray scale images. It not only covers schemes in traditional VC and extended VC for binary secret images, but also the latest development in the analysis-by-synthesis approach. This book distinguishes itself from the existing literature in three ways. First, it not only reviews traditional VC for binary secret images, but also covers recent efforts in improving visual quality for gray scale secret images. Second, not only traditional quality measures are reviewed, but also measures that were not used for measuring perceptual quality of decrypted secret images, such as Radially Averaged Power Spectrum Density (RAPSD) and residual variance, are employed for evaluating and guiding the design of VC algorithms. Third, unlike most VC books following a mathematical formal style, this book tries to make a balance between engineering intuition and mathematical reasoning. All the targeted problems and corresponding solutions are fully motivated by practical applications and evaluated by experimental tests, while important security issues are presented as mathematical proof. Furthermore, important algorithms are summarized as pseudocodes, thus enabling the readers to reproduce the results in the book. Therefore, this book serves as a tutorial for readers with an engineering background as well as for experts in related areas to understand the basics and research frontiers in visual cryptography.

This book provides an introduction to the inverse eigenvalue problem for graphs (IEP-$G$) and the related area of zero forcing, propagation, and throttling. The IEP-$G$ grew from the intersection of linear algebra and combinatorics and has given rise to both a rich set of deep problems in that area as well as a breadth of ""ancillary'' problems in related areas. The IEP-$G$ asks a fundamental mathematical question expressed in terms of linear algebra and graph theory, but the significance of such questions goes beyond these two areas, as particular instances of the IEP-$G$ also appear as major research problems in other fields of mathematics, sciences and engineering. One approach to the IEP-$G$ is through rank minimization, a relevant problem in itself and with a large number of applications. During the past 10 years, important developments on the rank minimization problem, particularly in relation to zero forcing, have led to significant advances in the IEP-$G$. The monograph serves as an entry point and valuable resource that will stimulate future developments in this active and mathematically diverse research area.

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.

Over a career that spanned 60 years, Ronald L. Graham (known to all as Ron) made significant contributions to the fields of discrete mathematics, number theory, Ramsey theory, computational geometry, juggling and magical mathematics, and many more. Ron also was a mentor to generations of mathematicians, he gave countless talks and helped bring mathematics to a wider audience, and he held signifi cant leadership roles in the mathematical community. This volume is dedicated to the life and memory of Ron Graham, and includes 20-articles by leading scientists across a broad range of subjects that refl ect some of the many areas in which Ron worked.

Magic and antimagic labelings are among the oldest labeling schemes in graph theory. This book takes readers on a journey through these labelings, from early beginnings with magic squares up to the latest results and beyond. Starting from the very basics, the book offers a detailed account of all magic and antimagic type labelings of undirected graphs. Long-standing problems are surveyed and presented along with recent results in classical labelings. In addition, the book covers an assortment of variations on the labeling theme, all in one self-contained monograph. Assuming only basic familiarity with graphs, this book, complete with carefully written proofs of most results, is an ideal introduction to graph labeling for students learning the subject. More than 150 open problems and conjectures make it an invaluable guide for postgraduate and early career researchers, as well as an excellent reference for established graph theorists.