Books in Discrete mathematics combinatorics

11-20 of 95 results in All results

Latin Squares and their Applications

• 2nd Edition
• July 24, 2015
• A. Donald Keedwell + 1 more
• English
• Hardback 978-0-444-63555-6

  9 7 8 - 0 - 4 4 4 - 6 3 5 5 5 - 6

Latin Squares and Their Applications, Second edition offers a long-awaited update and reissue of this seminal account of the subject. The revision retains foundational, original material from the frequently-cited 1974 volume but is completely updated throughout. As with the earlier version, the author hopes to take the reader ‘from the beginnings of the subject to the frontiers of research’. By omitting a few topics which are no longer of current interest, the book expands upon active and emerging areas. Also, the present state of knowledge regarding the 73 then-unsolved problems given at the end of the first edition is discussed and commented upon. In addition, a number of new unsolved problems are proposed. Using an engaging narrative style, this book provides thorough coverage of most parts of the subject, one of the oldest of all discrete mathematical structures and still one of the most relevant. However, in consequence of the huge expansion of the subject in the past 40 years, some topics have had to be omitted in order to keep the book of a reasonable length. Latin squares, or sets of mutually orthogonal latin squares (MOLS), encode the incidence structure of finite geometries; they prescribe the order in which to apply the different treatments in designing an experiment in order to permit effective statistical analysis of the results; they produce optimal density error-correcting codes; they encapsulate the structure of finite groups and of more general algebraic objects known as quasigroups. As regards more recreational aspects of the subject, latin squares provide the most effective and efficient designs for many kinds of games tournaments and they are the templates for Sudoku puzzles. Also, they provide a number of ways of constructing magic squares, both simple magic squares and also ones with additional properties.

Algebraic and Discrete Mathematical Methods for Modern Biology

• 1st Edition
• March 25, 2015
• Raina Robeva
• English
• Hardback 978-0-12-801213-0

  9 7 8 - 0 - 1 2 - 8 0 1 2 1 3 - 0
• eBook 978-0-12-801271-0

  9 7 8 - 0 - 1 2 - 8 0 1 2 7 1 - 0

Written by experts in both mathematics and biology, Algebraic and Discrete Mathematical Methods for Modern Biology offers a bridge between math and biology, providing a framework for simulating, analyzing, predicting, and modulating the behavior of complex biological systems. Each chapter begins with a question from modern biology, followed by the description of certain mathematical methods and theory appropriate in the search of answers. Every topic provides a fast-track pathway through the problem by presenting the biological foundation, covering the relevant mathematical theory, and highlighting connections between them. Many of the projects and exercises embedded in each chapter utilize specialized software, providing students with much-needed familiarity and experience with computing applications, critical components of the "modern biology" skill set. This book is appropriate for mathematics courses such as finite mathematics, discrete structures, linear algebra, abstract/modern algebra, graph theory, probability, bioinformatics, statistics, biostatistics, and modeling, as well as for biology courses such as genetics, cell and molecular biology, biochemistry, ecology, and evolution.

Applied Finite Mathematics

• 1st Edition
• May 10, 2014
• Howard Anton + 1 more
• English
• eBook 978-1-4832-7137-8

  9 7 8 - 1 - 4 8 3 2 - 7 1 3 7 - 8

Applied Finite Mathematics presents the fundamentals of finite mathematics in a style tailored for beginners, but at the same time covers the subject matter in sufficient depth so that the student can see a rich variety of realistic and relevant applications. Applications in fields such as business, biology, behavioral sciences, and social sciences are included. Comprised of nine chapters, this book begins with an introduction to set theory, explaining concepts such as sets and union and intersection of sets as well as counting elements in sets. The next chapter deals with coordinate systems and graphs, along with applications of linear equations and graphs of linear inequalities. The discussion then turns to linear programming; matrices and linear systems; probability; and statistics. Examples of applications are given, including those of game theory, Markov chains, and probability. The final chapter is devoted to computers and programming languages such as FORTRAN. This monograph is intended for students and instructors of applied mathematics.

Progress in Combinatorial Optimization

• 1st Edition
• May 10, 2014
• William R. Pulleyblank
• English
• eBook 978-1-4832-6453-0

  9 7 8 - 1 - 4 8 3 2 - 6 4 5 3 - 0

Progress in Combinatorial Optimization provides information pertinent to the fundamental aspects of combinatorial optimization. This book discusses how to determine whether or not a particular structure exists. Organized into 21 chapters, this book begins with an overview of a polar characterization of facets of polyhedra obtained by lifting facets of lower dimensional polyhedra. This text then discusses how to obtain bounds on the value of the objective in a graph partitioning problem in terms of spectral information about the graph. Other chapters consider the notion of a triangulation of an oriented matroid and show that oriented matroid triangulation yield triangulations of the underlying polytopes. This book discusses as well the selected results and problems on perfect ad imperfect graphs. The final chapter deals with the weighted parity problem for gammoids, which can be reduced to the weighted graphic matching problem. This book is a valuable resource for mathematicians and research workers.

Combinatorial Mathematics

• 1st Edition
• Volume 17
• January 25, 2012
• D. Bresson + 4 more
• English
• eBook 978-0-08-087186-8

  9 7 8 - 0 - 0 8 - 0 8 7 1 8 6 - 8

The object of this book is to provide an account of the results and methods used in combinatorial theories: Graph Theory, Matching Theory, Hamiltonian Problems, Hypergraph Theory, Designs, Steiner Systems, Latin Squares, Coding Matroids, Complexity Theory.In publishing this volume, the editors do not intend to discuss all the classical open problems in combinatorics for which an algebraic approach turns out to be useful. The work is a selection which is intended for specialists, as well as for graduate students who may also be interested in survey papers. The work features a special section which contains a list of unsolved problems proposed by the participants.

Bonn Workshop on Combinatorial Optimization

• 1st Edition
• Volume 66
• October 10, 2011
• A. Bachem + 2 more
• English
• eBook 978-0-08-087177-6

  9 7 8 - 0 - 0 8 - 0 8 7 1 7 7 - 6

Random Graphs '85

• 1st Edition
• Volume 33
• September 22, 2011
• M. Karonski + 1 more
• English
• eBook 978-0-08-087255-1

  9 7 8 - 0 - 0 8 - 0 8 7 2 5 5 - 1

Covering a wide range of Random Graphs subjects, this volume examines series-parallel networks, properties of random subgraphs of the n-cube, random binary and recursive trees, random digraphs, induced subgraphs and spanning trees in random graphs as well as matchings, hamiltonian cycles and closure in such structures. Papers in this collection also illustrate various aspects of percolation theory and its applications, properties of random lattices and random walks on such graphs, random allocation schemes, pseudo-random graphs and reliability of planar networks. Several open problems that were presented during a special session at the Seminar are also included at the end of the volume.

Combinatorial Design Theory

• 1st Edition
• Volume 34
• September 22, 2011
• C.J. Colbourn + 1 more
• English
• eBook 978-0-08-087260-5

  9 7 8 - 0 - 0 8 - 0 8 7 2 6 0 - 5

Combinatorial design theory is a vibrant area of combinatorics, connecting graph theory, number theory, geometry, and algebra with applications in experimental design, coding theory, and numerous applications in computer science.This volume is a collection of forty-one state-of-the-art research articles spanning all of combinatorial design theory. The articles develop new methods for the construction and analysis of designs and related combinatorial configurations; both new theoretical methods, and new computational tools and results, are presented. In particular, they extend the current state of knowledge on Steiner systems, Latin squares, one-factorizations, block designs, graph designs, packings and coverings, and develop recursive and direct constructions.The contributions form an overview of the current diversity of themes in design theory for those peripherally interested, while researchers in the field will find it to be a major collection of research advances. The volume is dedicated to Alex Rosa, who has played a major role in fostering and developing combinatorial design theory.

Combinatorics '86

• 1st Edition
• Volume 37
• September 22, 2011
• M. Marchi + 2 more
• English
• eBook 978-0-08-086777-9

  9 7 8 - 0 - 0 8 - 0 8 6 7 7 7 - 9

Recent developments in all aspects of combinatorial and incidence geometry are covered in this volume, including their links with the foundations of geometry, graph theory and algebraic structures, and the applications to coding theory and computer science.Topics covered include Galois geometries, blocking sets, affine and projective planes, incidence structures and their automorphism groups. Matroids, graph theory and designs are also treated, along with weak algebraic structures such as near-rings, near-fields, quasi-groups, loops, hypergroups etc., and permutation sets and groups.The vitality of combinatorics today lies in its important interactions with computer science. The problems which arise are of a varied nature and suitable techniques to deal with them have to be devised for each situation; one of the special features of combinatorics is the often sporadic nature of solutions, stemming from its links with number theory. The branches of combinatorics are many and various, and all of them are represented in the 56 papers in this volume.

Cryptographic Boolean Functions and Applications

• 1st Edition
• March 4, 2009
• Thomas W. Cusick + 1 more
• English
• Hardback 978-0-12-374890-4

  9 7 8 - 0 - 1 2 - 3 7 4 8 9 0 - 4
• eBook 978-0-08-095222-2

  9 7 8 - 0 - 0 8 - 0 9 5 2 2 2 - 2

Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference. Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research.