![]() |
![]() |
Your cart is empty |
||
Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Combinatorics on words, or finite sequences, is a field that grew from the disparate mathematics branches of group theory and probability. In recent times, it has gained recognition as an independent theory and has found substantial applications in computer science automata theory and linguistics. This volume is the first to present a thorough treatment of this theory and includes discussions of Thue's square free words, Van der Waerden's theorem, and Ramsey's theorem. This volume is an accessible text for undergraduate and graduate level students in mathematics and computer science as well as specialists in all branches of applied mathematics.
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 book A Guide to Graph Algorithms offers high-quality content in the research area of graph algorithms and explores the latest developments in graph algorithmics. The reader will gain a comprehensive understanding of how to use algorithms to explore graphs. It is a collection of texts that have proved to be trend setters and good examples of that. The book aims at providing the reader with a deep understanding of the structural properties of graphs that are useful for the design of efficient algorithms. These algorithms have applications in finite state machine modelling, social network theory, biology, and mathematics. The book contains many exercises, some up at present-day research-level. The exercises encourage the reader to discover new techniques by putting things in a clear perspective. A study of this book will provide the reader with many powerful tools to model and tackle problems in real-world scenarios.
This volume comprises 16 contributions that present advanced topics in graph domination, featuring open problems, modern techniques, and recent results. The focus is on primary dominating sets such as paired domination, connected domination, restrained domination, dominating functions, Roman domination, and power domination. Additionally, surveys include known results with a sample of proof techniques for each parameter. Of extra benefit to the reader, the first chapter includes a glossary of commonly used terms; the second chapter provides an overview of models of domination from which the parameters are defined. The book is intended to provide a reference for established researchers in the fields of domination and graph theory and graduate students who wish to gain knowledge of the topics covered as well as an overview of the major accomplishments in the field and proof techniques used.
This book provides an extensive set of tools for applying fuzzy mathematics and graph theory to real-life problems. Balancing the basics and latest developments in fuzzy graph theory, this book starts with existing fundamental theories such as connectivity, isomorphism, products of fuzzy graphs, and different types of paths and arcs in fuzzy graphs to focus on advanced concepts such as planarity in fuzzy graphs, fuzzy competition graphs, fuzzy threshold graphs, fuzzy tolerance graphs, fuzzy trees, coloring in fuzzy graphs, bipolar fuzzy graphs, intuitionistic fuzzy graphs, m-polar fuzzy graphs, applications of fuzzy graphs, and more. Each chapter includes a number of key representative applications of the discussed concept. An authoritative, self-contained, and inspiring read on the theory and modern applications of fuzzy graphs, this book is of value to advanced undergraduate and graduate students of mathematics, engineering, and computer science, as well as researchers interested in new developments in fuzzy logic and applied mathematics.
Strongly regular graphs lie at the intersection of statistical design, group theory, finite geometry, information and coding theory, and extremal combinatorics. This monograph collects all the major known results together for the first time in book form, creating an invaluable text that researchers in algebraic combinatorics and related areas will refer to for years to come. The book covers the theory of strongly regular graphs, polar graphs, rank 3 graphs associated to buildings and Fischer groups, cyclotomic graphs, two-weight codes and graphs related to combinatorial configurations such as Latin squares, quasi-symmetric designs and spherical designs. It gives the complete classification of rank 3 graphs, including some new constructions. More than 100 graphs are treated individually. Some unified and streamlined proofs are featured, along with original material including a new approach to the (affine) half spin graphs of rank 5 hyperbolic polar spaces.
This book focusses on techniques for automating the procedure of creating external labelings, also known as callout labelings. In this labeling type, the features within an illustration are connected by thin leader lines (called leaders) with their labels, which are placed in the empty space surrounding the image. In general, textual labels describing graphical features in maps, technical illustrations (such as assembly instructions or cutaway illustrations), or anatomy drawings are an important aspect of visualization that convey information on the objects of the visualization and help the reader understand what is being displayed. Most labeling techniques can be classified into two main categories depending on the "distance" of the labels to their associated features. Internal labels are placed inside or in the direct neighborhood of features, while external labels, which form the topic of this book, are placed in the margins outside the illustration, where they do not occlude the illustration itself. Both approaches form well-studied topics in diverse areas of computer science with several important milestones. The goal of this book is twofold. The first is to serve as an entry point for the interested reader who wants to get familiar with the basic concepts of external labeling, as it introduces a unified and extensible taxonomy of labeling models suitable for a wide range of applications. The second is to serve as a point of reference for more experienced people in the field, as it brings forth a comprehensive overview of a wide range of approaches to produce external labelings that are efficient either in terms of different algorithmic optimization criteria or in terms of their usability in specific application domains. The book mostly concentrates on algorithmic aspects of external labeling, but it also presents various visual aspects that affect the aesthetic quality and usability of external labeling.
This textbook teaches readers how to turn geometry into an image on a computer screen. This exciting journey begins in the schools of the ancient Greek philosophers, and describes the major events that changed people's perception of geometry. The readers will learn how to see geometry and colors beyond simple mathematical formulas and how to represent geometric shapes, transformations and motions by digital sampling of various mathematical functions.Special multiplatform visualization software developed by the author will allow readers to explore the exciting world of visual immersive mathematics, and the book software repository will provide a starting point for their own sophisticated visualization applications. Making Images with Mathematics serves as a self-contained text for a one-semester computer graphics and visualization course for computer science and engineering students, as well as a reference manual for researchers and developers.
Mahler measure, a height function for polynomials, is the central theme of this book. It has many interesting properties, obtained by algebraic, analytic and combinatorial methods. It is the subject of several longstanding unsolved questions, such as Lehmer's Problem (1933) and Boyd's Conjecture (1981). This book contains a wide range of results on Mahler measure. Some of the results are very recent, such as Dimitrov's proof of the Schinzel-Zassenhaus Conjecture. Other known results are included with new, streamlined proofs. Robinson's Conjectures (1965) for cyclotomic integers, and their associated Cassels height function, are also discussed, for the first time in a book.One way to study algebraic integers is to associate them with combinatorial objects, such as integer matrices. In some of these combinatorial settings the analogues of several notorious open problems have been solved, and the book sets out this recent work. Many Mahler measure results are proved for restricted sets of polynomials, such as for totally real polynomials, and reciprocal polynomials of integer symmetric as well as symmetrizable matrices. For reference, the book includes appendices providing necessary background from algebraic number theory, graph theory, and other prerequisites, along with tables of one- and two-variable integer polynomials with small Mahler measure. All theorems are well motivated and presented in an accessible way. Numerous exercises at various levels are given, including some for computer programming. A wide range of stimulating open problems is also included. At the end of each chapter there is a glossary of newly introduced concepts and definitions. Around the Unit Circle is written in a friendly, lucid, enjoyable style, without sacrificing mathematical rigour. It is intended for lecture courses at the graduate level, and will also be a valuable reference for researchers interested in Mahler measure. Essentially self-contained, this textbook should also be accessible to well-prepared upper-level undergraduates.
This volume collects together research and survey papers written by invited speakers of the conference celebrating the 70th birthday of Laszlo Lovasz. The topics covered include classical subjects such as extremal graph theory, coding theory, design theory, applications of linear algebra and combinatorial optimization, as well as recent trends such as extensions of graph limits, online or statistical versions of classical combinatorial problems, and new methods of derandomization. Laszlo Lovasz is one of the pioneers in the interplay between discrete and continuous mathematics, and is a master at establishing unexpected connections, "building bridges" between seemingly distant fields. His invariably elegant and powerful ideas have produced new subfields in many areas, and his outstanding scientific work has defined and shaped many research directions in the last 50 years. The 14 contributions presented in this volume, all of which are connected to Laszlo Lovasz's areas of research, offer an excellent overview of the state of the art of combinatorics and related topics and will be of interest to experienced specialists as well as young researchers.
This open access book offers an innovative account of how relief organizations' visual depiction of Syrian displacement contributes to reproduce and reinforce a securitized account of refugees. Through visual analysis, the book demonstrates how the securitization process takes place in three different ways. First of all, even if marginally, it occurs through the reproduction of mainstream media and political accounts that have depicted refugees in terms of threats. Secondly, and more consistently, through a representation of Syrian displaced people that, despite the undeniable innovative aesthetic patterns focusing on dignity and empowerment, continue to reinforce a visual narrative around refugees in terms of victimhood and passivity. The reproduction of a securitized account takes also place through the dialectic between what is made visible in the pictures and what is not. At the same time the book identifies visual glimmers and minor displacements in the humanitarian discourse that have the potentiality to produce alternative discourses on refugees and displacement beyond the mainstream securitized ones. By showing how relief organizations' visual representation contributes to the securitization of the refugee issue, this book provides a great resource to students and academics in migration, visuality, humanitarianism and securitization, as well as social scientists and policy-makers.
This book gives the state-of-the-art on transversals in linear uniform hypergraphs. The notion of transversal is fundamental to hypergraph theory and has been studied extensively. Very few articles have discussed bounds on the transversal number for linear hypergraphs, even though these bounds are integral components in many applications. This book is one of the first to give strong non-trivial bounds on the transversal number for linear hypergraphs. The discussion may lead to further study of those problems which have not been solved completely, and may also inspire the readers to raise new questions and research directions. The book is written with two readerships in mind. The first is the graduate student who may wish to work on open problems in the area or is interested in exploring the field of transversals in hypergraphs. This exposition will go far to familiarize the student with the subject, the research techniques, and the major accomplishments in the field. The photographs included allow the reader to associate faces with several researchers who made important discoveries and contributions to the subject. The second audience is the established researcher in hypergraph theory who will benefit from having easy access to known results and latest developments in the field of transversals in linear hypergraphs.
Impending technological advances will widen an adversary's attack plane over the next decade. Visualizing what the future will hold, and what new threat vectors could emerge, is a task that traditional planning mechanisms struggle to accomplish given the wide range of potential issues. Understanding and preparing for the future operating environment is the basis of an analytical method known as Threatcasting. It is a method that gives researchers a structured way to envision and plan for risks ten years in the future. Threatcasting uses input from social science, technical research, cultural history, economics, trends, expert interviews, and even a little science fiction to recognize future threats and design potential futures. During this human-centric process, participants brainstorm what actions can be taken to identify, track, disrupt, mitigate, and recover from the possible threats. Specifically, groups explore how to transform the future they desire into reality while avoiding an undesired future. The Threatcasting method also exposes what events could happen that indicate the progression toward an increasingly possible threat landscape. This book begins with an overview of the Threatcasting method with examples and case studies to enhance the academic foundation. Along with end-of-chapter exercises to enhance the reader's understanding of the concepts, there is also a full project where the reader can conduct a mock Threatcasting on the topic of "the next biological public health crisis." The second half of the book is designed as a practitioner's handbook. It has three separate chapters (based on the general size of the Threatcasting group) that walk the reader through how to apply the knowledge from Part I to conduct an actual Threatcasting activity. This book will be useful for a wide audience (from student to practitioner) and will hopefully promote new dialogues across communities and novel developments in the area.
This volume provides accessible and self-contained research problems designed for undergraduate student projects, and simultaneously promotes the development of sustainable undergraduate research programs. The chapters in this work span a variety of topical areas of pure and applied mathematics and mathematics education. Each chapter gives a self-contained introduction on a research topic with an emphasis on the specific tools and knowledge needed to create and maintain fruitful research programs for undergraduates. Some of the topics discussed include:* Disease modeling* Tropical curves and surfaces* Numerical semigroups* Mathematics EducationThis volume will primarily appeal to undergraduate students interested in pursuing research projects and faculty members seeking to mentor them. It may also aid students and faculty participating in independent studies and capstone projects.
Paul Erdos published more papers during his lifetime than any other mathematician, especially in discrete mathematics. He had a nose for beautiful, simply-stated problems with solutions that have far-reaching consequences across mathematics. This captivating book, written for students, provides an easy-to-understand introduction to discrete mathematics by presenting questions that intrigued Erdos, along with his brilliant ways of working toward their answers. It includes young Erdos's proof of Bertrand's postulate, the Erdos-Szekeres Happy End Theorem, De Bruijn-Erdos theorem, Erdos-Rado delta-systems, Erdos-Ko-Rado theorem, Erdos-Stone theorem, the Erdos-Renyi-Sos Friendship Theorem, Erdos-Renyi random graphs, the Chvatal-Erdos theorem on Hamilton cycles, and other results of Erdos, as well as results related to his work, such as Ramsey's theorem or Deza's theorem on weak delta-systems. Its appendix covers topics normally missing from introductory courses. Filled with personal anecdotes about Erdos, this book offers a behind-the-scenes look at interactions with the legendary collaborator.
The contributions included in the volume are drawn from presentations at ODS2019 - International Conference on Optimization and Decision Science, which was the 49th annual meeting of the Italian Operations Research Society (AIRO) held at Genoa, Italy, on 4-7 September 2019. This book presents very recent results in the field of Optimization and Decision Science. While the book is addressed primarily to the Operations Research (OR) community, the interdisciplinary contents ensure that it will also be of very high interest for scholars and researchers from many scientific disciplines, including computer sciences, economics, mathematics, and engineering. Operations Research is known as the discipline of optimization applied to real-world problems and to complex decision-making fields. The focus is on mathematical and quantitative methods aimed at determining optimal or near-optimal solutions in acceptable computation times. This volume not only presents theoretical results but also covers real industrial applications, making it interesting for practitioners facing decision problems in logistics, manufacturing production, and services. Readers will accordingly find innovative ideas from both a methodological and an applied perspective.
This book covers pattern recognition techniques applied to various areas of biomedicine, including disease diagnosis and prognosis, and several problems of classification, with a special focus on-but not limited to-pattern recognition modeling of biomedical signals and images. Multidisciplinary by definition, the book's topic blends computing, mathematics and other technical sciences towards the development of computational tools and methodologies that can be applied to pattern recognition processes. In this work, the efficacy of such methods and techniques for processing medical information is analyzed and compared, and auxiliary criteria for determining the correct diagnosis and treatment strategies are recommended and applied. Researchers in applied mathematics, the computer sciences, engineering and related fields with a focus on medical applications will benefit from this book, as well as professionals with a special interest in state-of-the-art pattern recognition techniques as applied to biomedicine.
Die Theorie der regularen Graphen (The Theory of Regular Graphs), written by the Danish Mathematician Julius Petersen in 1891, is often considered the first strictly theoretical paper dealing with graphs. In the 130 years since then, regular graphs have been a common and popular area of study. While regular graphs are typically considered to be graphs whose vertices all have the same degree, a more general interpretation is that of graphs possessing some common characteristic throughout their structure. During the past several decades, however, there has been some increased interest in investigating graphs possessing a property that is, in a sense, opposite to regularity. It is this topic with which this book deals, giving rise to a study of what might be called irregularity in graphs. Here, various irregularity concepts dealing with several topics in graph theory are described, such as degrees of vertices, graph labelings, weightings, colorings, graph structures, Eulerian and Hamiltonian properties, graph decompositions, and Ramsey-type problems.
Introduction to Chemical Graph Theory is a concise introduction to the main topics and techniques in chemical graph theory, specifically the theory of topological indices. These include distance-based, degree-based, and counting-based indices. The book covers some of the most commonly used mathematical approaches in the subject. It is also written with the knowledge that chemical graph theory has many connections to different branches of graph theory (such as extremal graph theory, spectral graph theory). The authors wrote the book in an appealing way that attracts people to chemical graph theory. In doing so, the book is an excellent playground and general reference text on the subject, especially for young mathematicians with a special interest in graph theory. Key Features: A concise introduction to topological indices of graph theory Appealing to specialists and non-specialists alike Provides many techniques from current research About the Authors: Stephan Wagner grew up in Graz (Austria), where he also received his PhD from Graz University of Technology in 2006. Shortly afterwards, he moved to South Africa, where he started his career at Stellenbosch University as a lecturer in January 2007. His research interests lie mostly in combinatorics and related areas, including connections to other scientific fields such as physics, chemistry and computer science. Hua Wang received his PhD from University of South Carolina in 2005. He held a Visiting Research Assistant Professor position at University of Florida before joining Georgia Southern University in 2008. His research interests include combinatorics and graph theory, elementary number theory, and related problems
This concise monograph present the complete history of the domination game and its variants up to the most recent developments and will stimulate research on closely related topics, establishing a key reference for future developments. The crux of the discussion surrounds new methods and ideas that were developed within the theory, led by the imagination strategy, the Continuation Principle, and the discharging method of Bujtas, to prove results about domination game invariants. A toolbox of proof techniques is provided for the reader to obtain results on the domination game and its variants. Powerful proof methods such as the imagination strategy are presented. The Continuation Principle is developed, which provides a much-used monotonicity property of the game domination number. In addition, the reader is exposed to the discharging method of Bujtas. The power of this method was shown by improving the known upper bound, in terms of a graph's order, on the (ordinary) domination number of graphs with minimum degree between 5 and 50. The book is intended primarily for students in graph theory as well as established graph theorists and it can be enjoyed by anyone with a modicum of mathematical maturity. The authors include exact results for several families of graphs, present what is known about the domination game played on subgraphs and trees, and provide the reader with the computational complexity aspects of domination games. Versions of the games which involve only the "slow" player yield the Grundy domination numbers, which connect the topic of the book with some concepts from linear algebra such as zero-forcing sets and minimum rank. More than a dozen other related games on graphs and hypergraphs are presented in the book. In all these games there are problems waiting to be solved, so the area is rich for further research. The domination game belongs to the growing family of competitive optimization graph games. The game is played by two competitors who take turns adding a vertex to a set of chosen vertices. They collaboratively produce a special structure in the underlying host graph, namely a dominating set. The two players have complementary goals: one seeks to minimize the size of the chosen set while the other player tries to make it as large as possible. The game is not one that is either won or lost. Instead, if both players employ an optimal strategy that is consistent with their goals, the cardinality of the chosen set is a graphical invariant, called the game domination number of the graph. To demonstrate that this is indeed a graphical invariant, the game tree of a domination game played on a graph is presented for the first time in the literature.
Constraint Satisfaction Problems (CSPs) are natural computational problems that appear in many areas of theoretical computer science. Exploring which CSPs are solvable in polynomial time and which are NP-hard reveals a surprising link with central questions in universal algebra. This monograph presents a self-contained introduction to the universal-algebraic approach to complexity classification, treating both finite and infinite-domain CSPs. It includes the required background from logic and combinatorics, particularly model theory and Ramsey theory, and explains the recently discovered link between Ramsey theory and topological dynamics and its implications for CSPs. The book will be of interest to graduate students and researchers in theoretical computer science and to mathematicians in logic, combinatorics, and dynamics who wish to learn about the applications of their work in complexity theory.
The emergence of multilayer networks as a concept from the field of complex systems provides many new opportunities for the visualization of network complexity, and has also raised many new exciting challenges. The multilayer network model recognizes that the complexity of relationships between entities in real-world systems is better embraced as several interdependent subsystems (or layers) rather than a simple graph approach. Despite only recently being formalized and defined, this model can be applied to problems in the domains of life sciences, sociology, digital humanities, and more. Within the domain of network visualization there already are many existing systems, which visualize data sets having many characteristics of multilayer networks, and many techniques, which are applicable to their visualization. In this Synthesis Lecture, we provide an overview and structured analysis of contemporary multilayer network visualization. This is not only for researchers in visualization, but also for those who aim to visualize multilayer networks in the domain of complex systems, as well as those solving problems within application domains. We have explored the visualization literature to survey visualization techniques suitable for multilayer network visualization, as well as tools, tasks, and analytic techniques from within application domains. We also identify the research opportunities and examine outstanding challenges for multilayer network visualization along with potential solutions and future research directions for addressing them.
This book provides a detailed description of network science concepts applied to power systems and electricity markets, offering an appropriate blend of theoretical background and practical applications for operation and power system planning. It discusses an approach to understanding power systems from a network science perspective using the direct recognition of the interconnectivity provided by the transmission system. Further, it explores the network properties in detail and characterizes them as a tool for online and offline applications for power system operation. The book includes an in-depth explanation of electricity markets problems that can be addressed from a graph theory perspective. It is intended for advanced undergraduate and graduate students in the fields of electric energy systems, operations research, management science and economics. Practitioners in the electric energy sector also benefit from the concepts and techniques presented here.
This book constitutes the proceedings of the 26th International Conference on Computing and Combinatorics, COCOON 2020, held in Atlanta, GA, USA, in August 2020. Due to the COVID-19 pandemic COCOON 2020 was organized as a fully online conference. The 54 papers presented in this volume were carefully reviewed and selected from 126 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph theory, complexity theory, problem solving, optimization, computational biology, computational learning, communication network, logic, and game theory.
The primary purpose of this textbook is to introduce the reader to a wide variety of elementary permutation statistical methods. Permutation methods are optimal for small data sets and non-random samples, and are free of distributional assumptions. The book follows the conventional structure of most introductory books on statistical methods, and features chapters on central tendency and variability, one-sample tests, two-sample tests, matched-pairs tests, one-way fully-randomized analysis of variance, one-way randomized-blocks analysis of variance, simple regression and correlation, and the analysis of contingency tables. In addition, it introduces and describes a comparatively new permutation-based, chance-corrected measure of effect size. Because permutation tests and measures are distribution-free, do not assume normality, and do not rely on squared deviations among sample values, they are currently being applied in a wide variety of disciplines. This book presents permutation alternatives to existing classical statistics, and is intended as a textbook for undergraduate statistics courses or graduate courses in the natural, social, and physical sciences, while assuming only an elementary grasp of statistics. |
![]() ![]() You may like...
Graded Algebras in Algebraic Geometry
Aron Simis, Zaqueu Ramos
Hardcover
R4,263
Discovery Miles 42 630
Air Pollution Modeling and its…
Clemens Mensink, Volker Matthias
Hardcover
R5,636
Discovery Miles 56 360
The Singer's Guide to German Diction
Valentin Lanzrein, Richard Cross
Hardcover
R3,072
Discovery Miles 30 720
|