This volume consists of research papers and expository survey articles presented by the invited speakers of the Summer Workshop on Lattice Polytopes. Topics include enumerative, algebraic and geometric combinatorics on lattice polytopes, topological combinatorics, commutative algebra and toric varieties.Readers will find that this volume showcases current trends on lattice polytopes and stimulates further developments of many research areas surrounding this field. With the survey articles, research papers and open problems, this volume provides its fundamental materials for graduate students to learn and researchers to find exciting activities and avenues for further exploration on lattice polytopes.

An update of the most accessible introductory number theory text available, Fundamental Number Theory with Applications, Second Edition presents a mathematically rigorous yet easy-to-follow treatment of the fundamentals and applications of the subject. The substantial amount of reorganizing makes this edition clearer and more elementary in its coverage. New to the Second Edition * Removal of all advanced material to be even more accessible in scope * New fundamental material, including partition theory, generating functions, and combinatorial number theory * Expanded coverage of random number generation, Diophantine analysis, and additive number theory * More applications to cryptography, primality testing, and factoring * An appendix on the recently discovered unconditional deterministic polynomial-time algorithm for primality testing Taking a truly elementary approach to number theory, this text supplies the essential material for a first course on the subject. Placed in highlighted boxes to reduce distraction from the main text, nearly 70 biographies focus on major contributors to the field. The presentation of over 1,300 entries in the index maximizes cross-referencing so students can find data with ease.

Researchers and practitioners of cryptography and information security are constantly challenged to respond to new attacks and threats to information systems. Authentication Codes and Combinatorial Designs presents new findings and original work on perfect authentication codes characterized in terms of combinatorial designs, namely strong partially balanced designs (SPBD). Beginning with examples illustrating the concepts of authentication schemes and combinatorial designs, the book considers the probability of successful deceptions followed by schemes involving three and four participants, respectively. From this point, the author constructs the perfect authentication schemes and explores encoding rules for such schemes in some special cases. Using rational normal curves in projective spaces over finite fields, the author constructs a new family of SPBD. He then presents some established combinatorial designs that can be used to construct perfect schemes, such as t-designs, orthogonal arrays of index unity, and designs constructed by finite geometry. The book concludes by studying definitions of perfect secrecy, properties of perfectly secure schemes, and constructions of perfect secrecy schemes with and without authentication. Supplying an appendix of construction schemes for authentication and secrecy schemes, Authentication Codes and Combinatorial Designs points to new applications of combinatorial designs in cryptography.

Sums of Squares of Integers covers topics in combinatorial number theory as they relate to counting representations of integers as sums of a certain number of squares. The book introduces a stimulating area of number theory where research continues to proliferate. It is a book of "firsts" - namely it is the first book to combine Liouville's elementary methods with the analytic methods of modular functions to study the representation of integers as sums of squares. It is the first book to tell how to compute the number of representations of an integer n as the sum of s squares of integers for any s and n. It is also the first book to give a proof of Szemeredi's theorem, and is the first number theory book to discuss how the modern theory of modular forms complements and clarifies the classical fundamental results about sums of squares. The book presents several existing, yet still interesting and instructive, examples of modular forms. Two chapters develop useful properties of the Bernoulli numbers and illustrate arithmetic progressions, proving the theorems of van der Waerden, Roth, and Szemeredi. The book also explains applications of the theory to three problems that lie outside of number theory in the areas of cryptanalysis, microwave radiation, and diamond cutting. The text is complemented by the inclusion of over one hundred exercises to test the reader's understanding.

Based on talks from the 2015 and 2016 Combinatorial and Additive Number Theory (CANT) workshops at the City University of New York, these proceedings offer 19 peer-reviewed and edited papers on current topics in number theory. Held every year since 2003, the workshop series surveys state-of-the-art open problems in combinatorial and additive number theory and related parts of mathematics. Sumsets, partitions, convex polytopes and discrete geometry, Ramsey theory, primality testing, and cryptography are among the topics featured in this volume. Each contribution is dedicated to a specific topic that reflects the latest results by experts in the field. Researchers and graduate students interested in the current progress in number theory will find this selection of articles relevant and compelling.

This textbook explores probability and stochastic processes at a level that does not require any prior knowledge except basic calculus. It presents the fundamental concepts in a step-by-step manner, and offers remarks and warnings for deeper insights. The chapters include basic examples, which are revisited as the new concepts are introduced. To aid learning, figures and diagrams are used to help readers grasp the concepts, and the solutions to the exercises and problems. Further, a table format is also used where relevant for better comparison of the ideas and formulae. The first part of the book introduces readers to the essentials of probability, including combinatorial analysis, conditional probability, and discrete and continuous random variable. The second part then covers fundamental stochastic processes, including point, counting, renewal and regenerative processes, the Poisson process, Markov chains, queuing models and reliability theory. Primarily intended for undergraduate engineering students, it is also useful for graduate-level students wanting to refresh their knowledge of the basics of probability and stochastic processes.

Geometric Data Analysis designates the approach of Multivariate Statistics that conceptualizes the set of observations as a Euclidean cloud of points. Combinatorial Inference in Geometric Data Analysis gives an overview of multidimensional statistical inference methods applicable to clouds of points that make no assumption on the process of generating data or distributions, and that are not based on random modelling but on permutation procedures recasting in a combinatorial framework. It focuses particularly on the comparison of a group of observations to a reference population (combinatorial test) or to a reference value of a location parameter (geometric test), and on problems of homogeneity, that is the comparison of several groups for two basic designs. These methods involve the use of combinatorial procedures to build a reference set in which we place the data. The chosen test statistics lead to original extensions, such as the geometric interpretation of the observed level, and the construction of a compatibility region. Features: Defines precisely the object under study in the context of multidimensional procedures, that is clouds of points Presents combinatorial tests and related computations with R and Coheris SPAD software Includes four original case studies to illustrate application of the tests Includes necessary mathematical background to ensure it is self-contained This book is suitable for researchers and students of multivariate statistics, as well as applied researchers of various scientific disciplines. It could be used for a specialized course taught at either master or PhD level.

Computational Complexity of Counting and Sampling provides readers with comprehensive and detailed coverage of the subject of computational complexity. It is primarily geared toward researchers in enumerative combinatorics, discrete mathematics, and theoretical computer science. The book covers the following topics: Counting and sampling problems that are solvable in polynomial running time, including holographic algorithms; #P-complete counting problems; and approximation algorithms for counting and sampling. First, it opens with the basics, such as the theoretical computer science background and dynamic programming algorithms. Later, the book expands its scope to focus on advanced topics, like stochastic approximations of counting discrete mathematical objects and holographic algorithms. After finishing the book, readers will agree that the subject is well covered, as the book starts with the basics and gradually explores the more complex aspects of the topic. Features: Each chapter includes exercises and solutions Ideally written for researchers and scientists Covers all aspects of the topic, beginning with a solid introduction, before shifting to computational complexity's more advanced features, with a focus on counting and sampling

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.

The subject of this book is truly original. By encoding of algebraic equations into graphs-originally a purely pedagogical technique-the exploration of physics and physical chemistry reveals common pictures through all disciplines. The hidden structure of the scientific formalism that appears is a source of astonishment and provides efficient simplifications of the representation of physical laws. Understanding Physics and Physical Chemistry Using Formal Graphs is organized according to the structures emerging from formal graphs, from simple to elaborate, providing after each series of case studies the theoretical elements necessary for understanding their common features. More than 80 case studies are tackled in domains ranging from translational mechanics to Newtonian gravitation to chemical reactions. With the help of this new tool, the modeling of physical phenomena becomes a fascinating cross-disciplinary exploration. The graphs encourage a visual, unified comprehension of the relationships between physical concepts and variables, properties, and operators. Out-of-the-box and thought provoking, this book inspires lively discussions and fruitful thinking about the connections between mechanics, chemical reactivity, electrodynamics, thermodynamics, and more.

From Combinatorics to Philosophy: The Legacy of G. -C. Rota provides an assessment of G. -C. Rota's legacy to current international research issues in mathematics, philosophy and computer science.

This volume includes chapters by leading researchers, as well as a number of invited research papers. Rota's legacy connects European and Italian research communities to the USA by providing inspiration to several generations of researchers in combinatorics, philosophy and computer science.

From Combinatorics to Philosophy: The Legacy of G. -C. Rota is of valuable interest to research institutions and university libraries worldwide. This book is also designed for advanced-level students in mathematics, computer science, and philosophy.

This research monograph utilizes exact and Monte Carlo permutation statistical methods to generate probability values and measures of effect size for a variety of measures of association. Association is broadly defined to include measures of correlation for two interval-level variables, measures of association for two nominal-level variables or two ordinal-level variables, and measures of agreement for two nominal-level or two ordinal-level variables. Additionally, measures of association for mixtures of the three levels of measurement are considered: nominal-ordinal, nominal-interval, and ordinal-interval measures. Numerous comparisons of permutation and classical statistical methods are presented. Unlike classical statistical methods, permutation statistical methods do not rely on theoretical distributions, avoid the usual assumptions of normality and homogeneity of variance, and depend only on the data at hand. This book takes a unique approach to explaining statistics by integrating a large variety of statistical methods, and establishing the rigor of a topic that to many may seem to be a nascent field. This topic is relatively new in that it took modern computing power to make permutation methods available to those working in mainstream research. Written for a statistically informed audience, it is particularly useful for teachers of statistics, practicing statisticians, applied statisticians, and quantitative graduate students in fields such as psychology, medical research, epidemiology, public health, and biology. It can also serve as a textbook in graduate courses in subjects like statistics, psychology, and biology.

This volume offers a valuable starting point for anyone interested in learning computational diffusion MRI and mathematical methods for brain connectivity, while also sharing new perspectives and insights on the latest research challenges for those currently working in the field. Over the last decade, interest in diffusion MRI has virtually exploded. The technique provides unique insights into the microstructure of living tissue and enables in-vivo connectivity mapping of the brain. Computational techniques are key to the continued success and development of diffusion MRI and to its widespread transfer into the clinic, while new processing methods are essential to addressing issues at each stage of the diffusion MRI pipeline: acquisition, reconstruction, modeling and model fitting, image processing, fiber tracking, connectivity mapping, visualization, group studies and inference. These papers from the 2016 MICCAI Workshop "Computational Diffusion MRI" - which was intended to provide a snapshot of the latest developments within the highly active and growing field of diffusion MR - cover a wide range of topics, from fundamental theoretical work on mathematical modeling, to the development and evaluation of robust algorithms and applications in neuroscientific studies and clinical practice. The contributions include rigorous mathematical derivations, a wealth of rich, full-color visualizations, and biologically or clinically relevant results. As such, they will be of interest to researchers and practitioners in the fields of computer science, MR physics, and applied mathematics.

This book is an account of the combinatorics of projective spaces over a finite field, with special emphasis on one and two dimensions. With its successor volumes, Finite projective spaces over three dimensions (1985), which is devoted to three dimensions, and General Galois geometries (1991), on a general dimension, it provides a comprehensive treatise of this area of mathematics. The area is interesting in itself, but is important for its applications to coding theory and statistics, and its use of group theory, algebraic geometry, and number theory. This edition is a complete reworking of the first edition. The chapters bear almost the same titles as the first edition, but every chapter has been changed. The most significant changes are to Chapters 2, 10, 12, 13, which respectively describe generalities, the geometry of arcs in ovals, the geometry of arcs of higher degree, and blocking sets. The book is divided into three parts. The first part comprises two chapters, the first of which is a survey of finite fields; the second outlines the fundamental properties of projective spaces and their automorphisms, as well as properties of algebraic varieties and curves, in particular, that are used in the rest of the book and the accompanying two volumes. Parts II and III are entirely self-contained; all proofs of results are given. The second part comprises Chapters 3 to 5. They cover, in an arbitrary dimension, the properties of subspaces such as their number and characterization, of partitions into both subspaces and subgeometries, and of quadrics and Hermitian varieties, as well as polarities. Part III is a detailed account of the line and the plane. In the plane, fundamental properties are first revisited without much resort to the generalities of Parts I and II. Then, the structure of arcs and their relation to curves is described; this includes arcs both of degree two and higher degrees. There are further chapters on blocking sets and on small planes, which means of orders up to thirteen. A comprehensive bibliography of more than 3000 items is provided. At the end of each chapter is a section, Notes and References, which attributes proofs, includes further comments, and lists every relevant reference from the bibliography.

The connected dominating set has been a classic subject studied in graph theory since 1975. Since the 1990s, it has been found to have important applications in communication networks, especially in wireless networks, as a virtual backbone. Motivated from those applications, many papers have been published in the literature during last 15 years. Now, the connected dominating set has become a hot research topic in computer science. In this book, we are going to collect recent developments on the connected dominating set, which presents the state of the art in the study of connected dominating sets. The book consists of 16 chapters. Except the 1st one, each chapter is devoted to one problem, and consists of three parts, motivation and overview, problem complexity analysis, and approximation algorithm designs, which will lead the reader to see clearly about the background, formulation, existing important research results, and open problems. Therefore, this would be a very valuable reference book for researchers in computer science and operations research, especially in areas of theoretical computer science, computer communication networks, combinatorial optimization, and discrete mathematics.

Additive Combinatorics: A Menu of Research Problems is the first book of its kind to provide readers with an opportunity to actively explore the relatively new field of additive combinatorics. The author has written the book specifically for students of any background and proficiency level, from beginners to advanced researchers. It features an extensive menu of research projects that are challenging and engaging at many different levels. The questions are new and unsolved, incrementally attainable, and designed to be approachable with various methods. The book is divided into five parts which are compared to a meal. The first part is called Ingredients and includes relevant background information about number theory, combinatorics, and group theory. The second part, Appetizers, introduces readers to the book's main subject through samples. The third part, Sides, covers auxiliary functions that appear throughout different chapters. The book's main course, so to speak, is Entrees: it thoroughly investigates a large variety of questions in additive combinatorics by discussing what is already known about them and what remains unsolved. These include maximum and minimum sumset size, spanning sets, critical numbers, and so on. The final part is Pudding and features numerous proofs and results, many of which have never been published. Features: The first book of its kind to explore the subject Students of any level can use the book as the basis for research projects The text moves gradually through five distinct parts, which is suitable both for beginners without prerequisites and for more advanced students Includes extensive proofs of propositions and theorems Each of the introductory chapters contains numerous exercises to help readers

This book concerns comics and what was, in 2003, a developing tradition of Disney-style comic-strips. It also deals with the Dutch graphic artist Maurits Cornelis Escher. Several of his images can be seen in animated form. It also talks of theatre and cinema too. For example, Luca Vigan 's curious theatrical spectacle in Genoa about Evariste Galois. It talks about war and peace, ageless themes. All this and a tribute to the mathematician Ennio De Giorgi.

Paul Turan, one of the greatest Hungarian mathematicians, was born 100 years ago, on August 18, 1910. To celebrate this occasion the Hungarian Academy of Sciences, the Alfred Renyi Institute of Mathematics, the Janos Bolyai Mathematical Society and the Mathematical Institute of Eoetvoes Lorand University organized an international conference devoted to Paul Turan's main areas of interest: number theory, selected branches of analysis, and selected branches of combinatorics. The conference was held in Budapest, August 22-26, 2011. Some of the invited lectures reviewed different aspects of Paul Turan's work and influence. Most of the lectures allowed participants to report about their own work in the above mentioned areas of mathematics.

Complete coverage of the prediction approach to survey sampling in a single resource

Prediction theory has been extremely influential in survey sampling for nearly three decades, yet research findings on this model-based approach are scattered in disparate areas of the statistical literature. Finite Population Sampling and Inference: A Prediction Approach presents for the first time a unified treatment of sample design and estimation for finite populations from a prediction point of view, providing readers with access to a wealth of theoretical results, including many new results and, a variety of practical applications. Geared to theoretical statisticians and practitioners alike, the book discusses all topics from the ground up and clearly explains the relation of the prediction approach to the traditional design-based randomization approach. Key features include:

• Special emphasis on linking survey sampling to mainstream statistics through extensive use of general linear models
• A liberal use of simulation studies, numerical examples, and exercises illustrating theoretical results
• Numerous statistical graphics showing simulation results and properties of estimates
• A library of S-Plus computer functions plus six real populations, available via ftp
• Over 260 references to finite population sampling, linear models, and other relevant literature

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 includes introduction of several algorithms which are exclusively for graph based problems, namely combinatorial optimization problems, path formation problems, etc. Each chapter includes the introduction of the basic traditional nature inspired algorithm and discussion of the modified version for discrete algorithms including problems pertaining to discussed algorithms.

This book examines some issues involving climate change, human trafficking, and other serious world challenges made worse by climate change. Climate change increases the risk of natural disasters and thus creates poverty and can cause situations of conflict and instability. Displacement can occur giving traffickers an opportunity to exploit affected people. In the fuzzy graph theory part of the book, the relatively new concepts of fuzzy soft semigraphs and graph structures are used to study human trafficking, as well as its time intuitionistic fuzzy sets that have been introduced to model forest fires. The notion of legal and illegal incidence strength is used to analyze immigration to the USA. The examination of return refugees to their origin countries is undertaken. The neighborhood connectivity index is determined for trafficking in various regions in the world. The cycle connectivity measure for the directed graph of the flow from South America to the USA is calculated. It is determined that there is a need for improvement in government response by countries. Outside the area of fuzzy graph theory, a new approach to examine climate change is introduced. Social network theory is used to study feedback processes that effect climate forcing. Tipping points in climate change are considered. The relationship between terrorism and climate change is examined. Ethical issues concerning the obligation of business organizations to reduce carbon emissions are also considered. Nonstandard analysis is a possible new area that could be used by scholars of mathematics of uncertainty. A foundation is laid to aid the researcher in the understanding of nonstandard analysis. In order to accomplish this, a discussion of some basic concepts from first-order logic is presented as some concepts of mathematics of uncertainty. An application to the theory of relativity is presented.

This book is an indispensable source for anyone with an interest in semigroup theory or whose research overlaps with this increasingly important area of mathematics. It is a clear and readable introduction to the subject, with emphasis on various classes of regular and semigroups. More than 150 exercises, accompanied by relevant references to the literature,give pointerse to areas of the subject not explicitly covered in the text.

Combinatorics, Second Edition is a well-rounded, general introduction to the subjects of enumerative, bijective, and algebraic combinatorics. The textbook emphasizes bijective proofs, which provide elegant solutions to counting problems by setting up one-to-one correspondences between two sets of combinatorial objects. The author has written the textbook to be accessible to readers without any prior background in abstract algebra or combinatorics. Part I of the second edition develops an array of mathematical tools to solve counting problems: basic counting rules, recursions, inclusion-exclusion techniques, generating functions, bijective proofs, and linear algebraic methods. These tools are used to analyze combinatorial structures such as words, permutations, subsets, functions, graphs, trees, lattice paths, and much more. Part II cover topics in algebraic combinatorics including group actions, permutation statistics, symmetric functions, and tableau combinatorics. This edition provides greater coverage of the use of ordinary and exponential generating functions as a problem-solving tool. Along with two new chapters, several new sections, and improved exposition throughout, the textbook is brimming with many examples and exercises of various levels of difficulty.

Student Handbook for Discrete Mathematics with Ducks is a Student Reference, Review, Supplemental Learning, and Example Handbook (SRRSLEH) that mirrors the content of the author's popular textbook Discrete Mathematics with Ducks (DMwD). This handbook provides a review of key material, illustrative examples, and new problems with accompanying solutions that are helpful even for those using a traditional discrete mathematics textbook. Every chapter in SRRSLEH matches the corresponding chapter of DMwD. Chapters in SRRSLEH contain the following: A list of the notation introduced in the corresponding chapter A list of definitions that students need to know from the corresponding chapter Theorems/facts of note appearing in the corresponding chapter A list of proof techniques introduced, with templates and/or examples given for each one A selection of examples from DMwD, written out formally and briefly rather than colloquially as in DMwD A quick refresher for any discrete math student, this handbook enables students to find information easily and reminds them of the terms and results they should know during their course. Read reviews of DMwD.