Threshold graphs have a beautiful structure and possess many important mathematical properties. They have applications in many areas including computer science and psychology. Over the last 20 years the interest in threshold graphs has increased significantly, and the subject continues to attract much attention.

The book contains many open problems and research ideas which will appeal to graduate students and researchers interested in graph theory. But above all "Threshold Graphs and Related Topics" provides a valuable source of information for all those working in this field.

This volume presents recent advances in the field of matrix analysis based on contributions at the MAT-TRIAD 2015 conference. Topics covered include interval linear algebra and computational complexity, Birkhoff polynomial basis, tensors, graphs, linear pencils, K-theory and statistic inference, showing the ubiquity of matrices in different mathematical areas. With a particular focus on matrix and operator theory, statistical models and computation, the International Conference on Matrix Analysis and its Applications 2015, held in Coimbra, Portugal, was the sixth in a series of conferences. Applied and Computational Matrix Analysis will appeal to graduate students and researchers in theoretical and applied mathematics, physics and engineering who are seeking an overview of recent problems and methods in matrix analysis.

This treatise presents an integrated perspective on the interplay of set theory and graph theory, providing an extensive selection of examples that highlight how methods from one theory can be used to better solve problems originated in the other. Features: explores the interrelationships between sets and graphs and their applications to finite combinatorics; introduces the fundamental graph-theoretical notions from the standpoint of both set theory and dyadic logic, and presents a discussion on set universes; explains how sets can conveniently model graphs, discussing set graphs and set-theoretic representations of claw-free graphs; investigates when it is convenient to represent sets by graphs, covering counting and encoding problems, the random generation of sets, and the analysis of infinite sets; presents excerpts of formal proofs concerning graphs, whose correctness was verified by means of an automated proof-assistant; contains numerous exercises, examples, definitions, problems and insight panels.

This book offers an original and broad exploration of the fundamental methods in Clustering and Combinatorial Data Analysis, presenting new formulations and ideas within this very active field. With extensive introductions, formal and mathematical developments and real case studies, this book provides readers with a deeper understanding of the mutual relationships between these methods, which are clearly expressed with respect to three facets: logical, combinatorial and statistical. Using relational mathematical representation, all types of data structures can be handled in precise and unified ways which the author highlights in three stages: Clustering a set of descriptive attributes Clustering a set of objects or a set of object categories Establishing correspondence between these two dual clusterings Tools for interpreting the reasons of a given cluster or clustering are also included. Foundations and Methods in Combinatorial and Statistical Data Analysis and Clustering will be a valuable resource for students and researchers who are interested in the areas of Data Analysis, Clustering, Data Mining and Knowledge Discovery.

The study of network theory is a highly interdisciplinary field, which has emerged as a major topic of interest in various disciplines ranging from physics and mathematics, to biology and sociology. This book promotes the diverse nature of the study of complex networks by balancing the needs of students from very different backgrounds. It references the most commonly used concepts in network theory, provides examples of their applications in solving practical problems, and clear indications on how to analyse their results. In the first part of the book, students and researchers will discover the quantitative and analytical tools necessary to work with complex networks, including the most basic concepts in network and graph theory, linear and matrix algebra, as well as the physical concepts most frequently used for studying networks. They will also find instruction on some key skills such as how to proof analytic results and how to manipulate empirical network data. The bulk of the text is focused on instructing readers on the most useful tools for modern practitioners of network theory. These include degree distributions, random networks, network fragments, centrality measures, clusters and communities, communicability, and local and global properties of networks. The combination of theory, example and method that are presented in this text, should ready the student to conduct their own analysis of networks with confidence and allow teachers to select appropriate examples and problems to teach this subject in the classroom.

This work is concerned with combinatorial aspects arising in the theory of exactly solvable models and representation theory. Recent developments in integrable models reveal an unexpected link between representation theory and statistical mechanics through combinatorics. For example, Young tableaux, which describe the basis of irreducible representations, appear in the Bethe Ansatz method in quantum spin chains as labels for the eigenstates for Hamiltonians.

Taking into account the various criss-crossing among mathematical subject, Physical Combinatorics presents new results and exciting ideas from three viewpoints; representation theory, integrable models, and combinatorics.

This volume will be of interest to mathematical physicists and graduate students in the the above-mentioned fields.

Contributors to the volume: T.H. Baker, O. Foda, G. Hatayama, Y. Komori, A. Kuniba, T. Nakanishi, M. Okado, A. Schilling, J. Suzuki, T. Takagi, D. Uglov, O. Warnaar, T.A. Welsh, A. Zabrodin

This book is the second edition of the third and last volume of a treatise on projective spaces over a finite field, also known as Galois geometries. This volume completes the trilogy comprised of plane case (first volume) and three dimensions (second volume). This revised edition includes much updating and new material. It is a mostly self-contained study of classical varieties over a finite field, related incidence structures and particular point sets in finite n-dimensional projective spaces. General Galois Geometries is suitable for PhD students and researchers in combinatorics and geometry. The separate chapters can be used for courses at postgraduate level.

This volume presents easy-to-understand yet surprising properties obtained using topological, geometric and graph theoretic tools in the areas covered by the Geometry Conference that took place in Mulhouse, France from September 7-11, 2014 in honour of Tudor Zamfirescu on the occasion of his 70th anniversary. The contributions address subjects in convexity and discrete geometry, in distance geometry or with geometrical flavor in combinatorics, graph theory or non-linear analysis. Written by top experts, these papers highlight the close connections between these fields, as well as ties to other domains of geometry and their reciprocal influence. They offer an overview on recent developments in geometry and its border with discrete mathematics, and provide answers to several open questions. The volume addresses a large audience in mathematics, including researchers and graduate students interested in geometry and geometrical problems.

This book covers novel research on construction and analysis of optimal cryptographic functions such as almost perfect nonlinear (APN), almost bent (AB), planar and bent functions. These functions have optimal resistance to linear and/or differential attacks, which are the two most powerful attacks on symmetric cryptosystems. Besides cryptographic applications, these functions are significant in many branches of mathematics and information theory including coding theory, combinatorics, commutative algebra, finite geometry, sequence design and quantum information theory. The author analyzes equivalence relations for these functions and develops several new methods for construction of their infinite families. In addition, the book offers solutions to two longstanding open problems, including the problem on characterization of APN and AB functions via Boolean, and the problem on the relation between two classes of bent functions.

This book collects the scientific contributions of a group of leading experts who took part in the INdAM Meeting held in Cortona in September 2014. With combinatorial techniques as the central theme, it focuses on recent developments in configuration spaces from various perspectives. It also discusses their applications in areas ranging from representation theory, toric geometry and geometric group theory to applied algebraic topology.

Nolan Wallach's mathematical research is remarkable in both its breadth and depth. His contributions to many fields include representation theory, harmonic analysis, algebraic geometry, combinatorics, number theory, differential equations, Riemannian geometry, ring theory, and quantum information theory. The touchstone and unifying thread running through all his work is the idea of symmetry. This volume is a collection of invited articles that pay tribute to Wallach's ideas, and show symmetry at work in a large variety of areas. The articles, predominantly expository, are written by distinguished mathematicians and contain sufficient preliminary material to reach the widest possible audiences. Graduate students, mathematicians, and physicists interested in representation theory and its applications will find many gems in this volume that have not appeared in print elsewhere. Contributors: D. Barbasch, K. Baur, O. Bucicovschi, B. Casselman, D. Ciubotaru, M. Colarusso, P. Delorme, T. Enright, W.T. Gan, A Garsia, G. Gour, B. Gross, J. Haglund, G. Han, P. Harris, J. Hong, R. Howe, M. Hunziker, B. Kostant, H. Kraft, D. Meyer, R. Miatello, L. Ni, G. Schwarz, L. Small, D. Vogan, N. Wallach, J. Wolf, G. Xin, O. Yacobi.

This volume provides a wide selection of problems (and solutions) to all those interested in mathematical problem solving and is accessible to readers from high school students to professionals.It is a resource for those interested in mathematical competitions ranging from high school level to the William Lowell Putnam Mathematical Competition (for undergraduate students). The collection offers challenges for students, teachers, and recreational mathematicians.

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.

This volume contains two types of papers-a selection of contributions from the "Second International Conference in Network Analysis" held in Nizhny Novgorod on May 7-9, 2012, and papers submitted to an "open call for papers" reflecting the activities of LATNA at the Higher School for Economics. This volume contains many new results in modeling and powerful algorithmic solutions applied to problems in * vehicle routing * single machine scheduling * modern financial markets * cell formation in group technology * brain activities of left- and right-handers * speeding up algorithms for the maximum clique problem * analysis and applications of different measures in clustering The broad range of applications that can be described and analyzed by means of a network brings together researchers, practitioners, and other scientific communities from numerous fields such as Operations Research, Computer Science, Transportation, Energy, Social Sciences, and more. The contributions not only come from different fields, but also cover a broad range of topics relevant to the theory and practice of network analysis. Researchers, students, and engineers from various disciplines will benefit from the state-of-the-art in models, algorithms, technologies, and techniques presented.

This book is an authoritative handbook of current topics, technologies and methodological approaches that may be used for the study of scholarly impact. The included methods cover a range of fields such as statistical sciences, scientific visualization, network analysis, text mining, and information retrieval. The techniques and tools enable researchers to investigate metric phenomena and to assess scholarly impact in new ways. Each chapter offers an introduction to the selected topic and outlines how the topic, technology or methodological approach may be applied to metrics-related research. Comprehensive and up-to-date, Measuring Scholarly Impact: Methods and Practice is designed for researchers and scholars interested in informetrics, scientometrics, and text mining. The hands-on perspective is also beneficial to advanced-level students in fields from computer science and statistics to information science.

This textbook for mathematics undergraduates, graduates and researchers discusses the proof of the four-colour theorem - one of the most famous of the long-standing mathematical problems solved in the 20th century.

This book contains recent contributions to the fields of rigidity and symmetry with two primary focuses: to present the mathematically rigorous treatment of rigidity of structures and to explore the interaction of geometry, algebra and combinatorics. Contributions present recent trends and advances in discrete geometry, particularly in the theory of polytopes. The rapid development of abstract polytope theory has resulted in a rich theory featuring an attractive interplay of methods and tools from discrete geometry, group theory, classical geometry, hyperbolic geometry and topology. Overall, the book shows how researchers from diverse backgrounds explore connections among the various discrete structures with symmetry as the unifying theme. The volume will be a valuable source as an introduction to the ideas of both combinatorial and geometric rigidity theory and its applications, incorporating the surprising impact of symmetry. It will appeal to students at both the advanced undergraduate and graduate levels, as well as post docs, structural engineers and chemists.

This richly illustrated textbook explores the amazing interaction between combinatorics, geometry, number theory, and analysis which arises in the interplay between polyhedra and lattices. Highly accessible to advanced undergraduates, as well as beginning graduate students, this second edition is perfect for a capstone course, and adds two new chapters, many new exercises, and updated open problems. For scientists, this text can be utilized as a self-contained tooling device. The topics include a friendly invitation to Ehrhart's theory of counting lattice points in polytopes, finite Fourier analysis, the Frobenius coin-exchange problem, Dedekind sums, solid angles, Euler-Maclaurin summation for polytopes, computational geometry, magic squares, zonotopes, and more. With more than 300 exercises and open research problems, the reader is an active participant, carried through diverse but tightly woven mathematical fields that are inspired by an innocently elementary question: What are the relationships between the continuous volume of a polytope and its discrete volume? Reviews of the first edition: "You owe it to yourself to pick up a copy of Computing the Continuous Discretely to read about a number of interesting problems in geometry, number theory, and combinatorics." - MAA Reviews "The book is written as an accessible and engaging textbook, with many examples, historical notes, pithy quotes, commentary integrating the mate rial, exercises, open problems and an extensive bibliography." - Zentralblatt MATH "This beautiful book presents, at a level suitable for advanced undergraduates, a fairly complete introduction to the problem of counting lattice points inside a convex polyhedron." - Mathematical Reviews "Many departments recognize the need for capstone courses in which graduating students can see the tools they have acquired come together in some satisfying way. Beck and Robins have written the perfect text for such a course." - CHOICE

For the first two editions of the book Probability (GTM 95), each chapter included a comprehensive and diverse set of relevant exercises. While the work on the third edition was still in progress, it was decided that it would be more appropriate to publish a separate book that would comprise all of the exercises from previous editions, in addition tomany new exercises.

Most of the material in this book consists of exercises created by Shiryaev, collected and compiled over the course of many years while working on many interesting topics.Many of the exercises resulted from discussions that took place during special seminars for graduate and undergraduate students. Many of the exercises included in the book contain helpful hints and other relevant information.

Lastly, the author has included an appendix at the end of the book that contains a summary of the main results, notation and terminology from Probability Theory that are used throughout the present book. This Appendix also contains additional material from Combinatorics, Potential Theory and Markov Chains, which is not covered in the book, but is nevertheless needed for many of the exercises included here."

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 book not only discusses the important topics in the area of machine learning and combinatorial optimization, it also combines them into one. This was decisive for choosing the material to be included in the book and determining its order of presentation. Decision trees are a popular method of classification as well as of knowledge representation. At the same time, they are easy to implement as the building blocks of an ensemble of classifiers. Admittedly, however, the task of constructing a near-optimal decision tree is a very complex process. The good results typically achieved by the ant colony optimization algorithms when dealing with combinatorial optimization problems suggest the possibility of also using that approach for effectively constructing decision trees. The underlying rationale is that both problem classes can be presented as graphs. This fact leads to option of considering a larger spectrum of solutions than those based on the heuristic. Moreover, ant colony optimization algorithms can be used to advantage when building ensembles of classifiers. This book is a combination of a research monograph and a textbook. It can be used in graduate courses, but is also of interest to researchers, both specialists in machine learning and those applying machine learning methods to cope with problems from any field of R&D.

Three major branches of number theory are included in the volume: namely analytic number theory, algebraic number theory, and transcendental number theory. Original research is presented that discusses modern techniques and survey papers from selected academic scholars.