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

Written for mathematicians working with the theory of graph spectra, this (primarily theoretical) book presents relevant results considering the spectral properties of regular graphs. The book begins with a short introduction including necessary terminology and notation. The author then proceeds with basic properties, specific subclasses of regular graphs (like distance-regular graphs, strongly regular graphs, various designs or expanders) and determining particular regular graphs. Each chapter contains detailed proofs, discussions, comparisons, examples, exercises and also indicates possible applications. Finally, the author also includes some conjectures and open problems to promote further research. Contents Spectral properties Particular types of regular graph Determinations of regular graphs Expanders Distance matrix of regular graphs

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.

Handbook of Combinatorics, Volume 1 focuses on basic methods, paradigms, results, issues, and trends across the broad spectrum of combinatorics. The selection first elaborates on the basic graph theory, connectivity and network flows, and matchings and extensions. Discussions focus on stable sets and claw free graphs, nonbipartite matching, multicommodity flows and disjoint paths, minimum cost circulations and flows, special proof techniques for paths and circuits, and Hamilton paths and circuits in digraphs. The manuscript then examines coloring, stable sets, and perfect graphs and embeddings and minors. The book takes a look at random graphs, hypergraphs, partially ordered sets, and matroids. Topics include geometric lattices, structural properties, linear extensions and correlation, dimension and posets of bounded degree, hypergraphs and set systems, stability, transversals, and matchings, and phase transition. The manuscript also reviews the combinatorial number theory, point lattices, convex polytopes and related complexes, and extremal problems in combinatorial geometry. The selection is a valuable reference for researchers interested in combinatorics.

Graph-Theoretical Matrices in Chemistry presents a systematic survey of graph-theoretical matrices and highlights their potential uses. This comprehensive volume is an updated, extended version of a former bestseller featuring a series of mathematical chemistry monographs. In this edition, nearly 200 graph-theoretical matrices are included. This second edition is organized like the previous one-after an introduction, graph-theoretical matrices are presented in five chapters: The Adjacency Matrix and Related Matrices, Incidence Matrices, The Distance Matrix and Related Matrices, Special Matrices, and Graphical Matrices. Each of these chapters is followed by a list of references. Among the matrices presented several are novel and some are known only to a few. The properties and potential usefulness of many of the presented graph-theoretical matrices in chemistry have yet to be investigated. Most of the graph-theoretical matrices presented have been used as sources of molecular descriptors usually referred to as topological indices. They are particularly concerned with a special class of graphs that represents chemical structures involving molecules. Due to its multidisciplinary scope, this book will appeal to a broad audience ranging from chemistry and mathematics to pharmacology.

Crossing Numbers of Graphs is the first book devoted to the crossing number, an increasingly popular object of study with surprising connections. The field has matured into a large body of work, which includes identifiable core results and techniques. The book presents a wide variety of ideas and techniques in topological graph theory, discrete geometry, and computer science. The first part of the text deals with traditional crossing number, crossing number values, crossing lemma, related parameters, computational complexity, and algorithms. The second part includes the rich history of alternative crossing numbers, the rectilinear crossing number, the pair crossing number, and the independent odd crossing number.It also includes applications of the crossing number outside topological graph theory. Aimed at graduate students and professionals in both mathematics and computer science The first book of its kind devoted to the topic Authored by a noted authority in crossing numbers

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.

The Rogers--Ramanujan identities are a pair of infinite series-infinite product identities that were first discovered in 1894. Over the past several decades these identities, and identities of similar type, have found applications in number theory, combinatorics, Lie algebra and vertex operator algebra theory, physics (especially statistical mechanics), and computer science (especially algorithmic proof theory). Presented in a coherant and clear way, this will be the first book entirely devoted to the Rogers-Ramanujan identities and will include related historical material that is unavailable elsewhere.

Emphasizing the search for patterns within and between biological sequences, trees, and graphs, Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R shows how combinatorial pattern matching algorithms can solve computational biology problems that arise in the analysis of genomic, transcriptomic, proteomic, metabolomic, and interactomic data. It implements the algorithms in Perl and R, two widely used scripting languages in computational biology. The book provides a well-rounded explanation of traditional issues as well as an up-to-date account of more recent developments, such as graph similarity and search. It is organized around the specific algorithmic problems that arise when dealing with structures that are commonly found in computational biology, including biological sequences, trees, and graphs. For each of these structures, the author makes a clear distinction between problems that arise in the analysis of one structure and in the comparative analysis of two or more structures. He also presents phylogenetic trees and networks as examples of trees and graphs in computational biology. This book supplies a comprehensive view of the whole field of combinatorial pattern matching from a computational biology perspective. Along with thorough discussions of each biological problem, it includes detailed algorithmic solutions in pseudo-code, full Perl and R implementation, and pointers to other software, such as those on CPAN and CRAN.

This unique book provides the first introduction to crystal base theory from the combinatorial point of view. Crystal base theory was developed by Kashiwara and Lusztig from the perspective of quantum groups. Its power comes from the fact that it addresses many questions in representation theory and mathematical physics by combinatorial means. This book approaches the subject directly from combinatorics, building crystals through local axioms (based on ideas by Stembridge) and virtual crystals. It also emphasizes parallels between the representation theory of the symmetric and general linear groups and phenomena in combinatorics. The combinatorial approach is linked to representation theory through the analysis of Demazure crystals. The relationship of crystals to tropical geometry is also explained.

This unique book provides the first introduction to crystal base theory from the combinatorial point of view. Crystal base theory was developed by Kashiwara and Lusztig from the perspective of quantum groups. Its power comes from the fact that it addresses many questions in representation theory and mathematical physics by combinatorial means. This book approaches the subject directly from combinatorics, building crystals through local axioms (based on ideas by Stembridge) and virtual crystals. It also emphasizes parallels between the representation theory of the symmetric and general linear groups and phenomena in combinatorics. The combinatorial approach is linked to representation theory through the analysis of Demazure crystals. The relationship of crystals to tropical geometry is also explained.

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.

Exploring one of the most dynamic areas of mathematics, Advanced Number Theory with Applications covers a wide range of algebraic, analytic, combinatorial, cryptographic, and geometric aspects of number theory. Written by a recognized leader in algebra and number theory, the book includes a page reference for every citing in the bibliography and more than 1,500 entries in the index so that students can easily cross-reference and find the appropriate data. With numerous examples throughout, the text begins with coverage of algebraic number theory, binary quadratic forms, Diophantine approximation, arithmetic functions, p-adic analysis, Dirichlet characters, density, and primes in arithmetic progression. It then applies these tools to Diophantine equations, before developing elliptic curves and modular forms. The text also presents an overview of Fermat's Last Theorem (FLT) and numerous consequences of the ABC conjecture, including Thue-Siegel-Roth theorem, Hall's conjecture, the Erdoes-Mollin--Walsh conjecture, and the Granville-Langevin Conjecture. In the appendix, the author reviews sieve methods, such as Eratothesenes', Selberg's, Linnik's, and Bombieri's sieves. He also discusses recent results on gaps between primes and the use of sieves in factoring. By focusing on salient techniques in number theory, this textbook provides the most up-to-date and comprehensive material for a second course in this field. It prepares students for future study at the graduate level.

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 is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course.Just as with the first three editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs.New to this edition are the Quick Check exercises at the end of each section. In all, the new edition contains about 240 new exercises. Extra examples were added to some sections where readers asked for them.The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs, enumeration under group action, generating functions of labeled and unlabeled structures and algorithms and complexity.The book encourages students to learn more combinatorics, provides them with a not only useful but also enjoyable and engaging reading.The Solution Manual is available upon request for all instructors who adopt this book as a course text. Please send your request to [email protected] previous edition of this textbook has been adopted at various schools including UCLA, MIT, University of Michigan, and Swarthmore College. It was also translated into Korean.

The volume is a collection of 20 refereed articles written in connection with lectures presented at the 12th International Conference on Finite Fields and Their Applications ('Fq12') at Skidmore College in Saratoga Springs, NY in July 2015. Finite fields are central to modern cryptography and secure digital communication, and hence must evolve rapidly to keep pace with new technologies. Topics in this volume include cryptography, coding theory, structure of finite fields, algorithms, curves over finite fields, and further applications.Contributors will include: Antoine Joux (Fondation Partenariale de l'UPMC, France); Gary Mullen (Penn State University, USA); Gohar Kyureghyan (Otto-von-Guericke Universitat, Germany); Gary McGuire (University College Dublin, Ireland); Michel Lavrauw (Universita degli Studi di Padova, Italy); Kirsten Eisentraeger (Penn State University, USA); Renate Scheidler (University of Calgary, Canada); Michael Zieve (University of Michigan, USA).

What Is Combinatorics Anyway? Broadly speaking, combinatorics is the branch of mathematics dealing with different ways of selecting objects from a set or arranging objects. It tries to answer two major kinds of questions, namely, counting questions: how many ways can a selection or arrangement be chosen with a particular set of properties; and structural questions: does there exist a selection or arrangement of objects with a particular set of properties? The authors have presented a text for students at all levels of preparation. For some, this will be the first course where the students see several real proofs. Others will have a good background in linear algebra, will have completed the calculus stream, and will have started abstract algebra. The text starts by briefly discussing several examples of typical combinatorial problems to give the reader a better idea of what the subject covers. The next chapters explore enumerative ideas and also probability. It then moves on to enumerative functions and the relations between them, and generating functions and recurrences., Important families of functions, or numbers and then theorems are presented. Brief introductions to computer algebra and group theory come next. Structures of particular interest in combinatorics: posets, graphs, codes, Latin squares, and experimental designs follow. The authors conclude with further discussion of the interaction between linear algebra and combinatorics. Features Two new chapters on probability and posets. Numerous new illustrations, exercises, and problems. More examples on current technology use A thorough focus on accuracy Three appendices: sets, induction and proof techniques, vectors and matrices, and biographies with historical notes, Flexible use of MapleTM and MathematicaTM

The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. We have also included a discussion on linear programming that emphasizes problems in graph theory. The text is suitable for students in computer science or mathematics programs.

This book introduces oriented version of metrics and cuts and their multidimensional analogues, as well as partial metrics and weighted metrics. It is a follow-up of Geometry of Cuts and Metrics by Deza and Laurent which presents rich theory of classical binary and symmetric objects - metrics and cuts.Many research publications on this subject are devoted to different special aspects of the theory of generalized metrics. However, they are disconnected one from other, often written in different mathematical language, consider the same objects from different points of view without analysis of possible connections, etc. In this book we will construct full theory of main classes of finite generalized metrics and their polyhedral aspects.

Handbook of Mathematical Induction: Theory and Applications shows how to find and write proofs via mathematical induction. This comprehensive book covers the theory, the structure of the written proof, all standard exercises, and hundreds of application examples from nearly every area of mathematics. In the first part of the book, the author discusses different inductive techniques, including well-ordered sets, basic mathematical induction, strong induction, double induction, infinite descent, downward induction, and several variants. He then introduces ordinals and cardinals, transfinite induction, the axiom of choice, Zorn's lemma, empirical induction, and fallacies and induction. He also explains how to write inductive proofs. The next part contains more than 750 exercises that highlight the levels of difficulty of an inductive proof, the variety of inductive techniques available, and the scope of results provable by mathematical induction. Each self-contained chapter in this section includes the necessary definitions, theory, and notation and covers a range of theorems and problems, from fundamental to very specialized. The final part presents either solutions or hints to the exercises. Slightly longer than what is found in most texts, these solutions provide complete details for every step of the problem-solving process.

Handbook of Product Graphs, Second Edition examines the dichotomy between the structure of products and their subgraphs. It also features the design of efficient algorithms that recognize products and their subgraphs and explores the relationship between graph parameters of the product and factors. Extensively revised and expanded, the handbook presents full proofs of many important results as well as up-to-date research and conjectures. Results and Algorithms New to the Second Edition: Cancellation results A quadratic recognition algorithm for partial cubes Results on the strong isometric dimension Computing the Wiener index via canonical isometric embedding Connectivity results A fractional version of Hedetniemi's conjecture Results on the independence number of Cartesian powers of vertex-transitive graphs Verification of Vizing's conjecture for chordal graphs Results on minimum cycle bases Numerous selected recent results, such as complete minors and nowhere-zero flows The second edition of this classic handbook provides a thorough introduction to the subject and an extensive survey of the field. The first three parts of the book cover graph products in detail. The authors discuss algebraic properties, such as factorization and cancellation, and explore interesting and important classes of subgraphs. The fourth part presents algorithms for the recognition of products and related classes of graphs. The final two parts focus on graph invariants and infinite, directed, and product-like graphs. Sample implementations of selected algorithms and other information are available on the book's website, which can be reached via the authors' home pages.

This book highlights recent developments in multidimensional data visualization, presenting both new methods and modifications on classic techniques. Throughout the book, various applications of multidimensional data visualization are presented including its uses in social sciences (economy, education, politics, psychology), environmetrics, and medicine (ophthalmology, sport medicine, pharmacology, sleep medicine).

The book provides recent research results in optimization-based visualization. Evolutionary algorithms and a two-level optimization method, based on combinatorial optimization and quadratic programming, are analyzed in detail. The performance of these algorithms and the development of parallel versions is discussed.

The encorporation of new visualization techniques to improve the capabilies of artificial neural networks (self-organizing maps, feed-forward networks) is also discussed.

The book includes over 100 detailed images presenting examples of the different visualization techniques that are presented.

This book is intended for scientists and researchers in any field of study where complex and multidimensional data must be represented visually.

These notes were first used in an introductory course team taught by the authors at Appalachian State University to advanced undergraduates and beginning graduates. The text was written with four pedagogical goals in mind: offer a variety of topics in one course, get to the main themes and tools as efficiently as possible, show the relationships between the different topics, and include recent results to convince students that mathematics is a living discipline.