Books in Discrete mathematics combinatorics

31-40 of 95 results in All results

Codes on Euclidean Spheres

• 1st Edition
• Volume 63
• April 27, 2001
• T. Ericson + 1 more
• English
• eBook 978-0-08-050216-8

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

Codes on Euclidean spheres are often referred to as spherical codes. They are of interest from mathematical, physical and engineering points of view. Mathematically the topic belongs to the realm of algebraic combinatorics, with close connections to number theory, geometry, combinatorial theory, and - of course - to algebraic coding theory. The connections to physics occur within areas like crystallography and nuclear physics. In engineering spherical codes are of central importance in connection with error-control in communication systems. In that context the use of spherical codes is often referred to as "coded modulation." The book offers a first complete treatment of the mathematical theory of codes on Euclidean spheres. Many new results are published here for the first time. Engineering applications are emphasized throughout the text. The theory is illustrated by many examples. The book also contains an extensive table of best known spherical codes in dimensions 3-24, including exact constructions.

Handbook of Coding Theory

• 1st Edition
• Volume II
• November 16, 1998
• Bozzano G Luisa
• English
• Hardback 978-0-444-50087-8

  9 7 8 - 0 - 4 4 4 - 5 0 0 8 7 - 8

The second volume of this work contains Parts 2 and 3 of the "Handbook of Coding Theory". Part 2, "Connections", is devoted to connections between coding theory and other branches of mathematics and computer science. Part 3, "Applications", deals with a variety of applications for coding.

Stream Ciphers and Number Theory

• 1st Edition
• Volume 55
• April 20, 1998
• T.W. Cusick + 2 more
• English
• eBook 978-0-08-054184-6

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

This book is almost entirely concerned with stream ciphers, concentrating on a particular mathematical model for such ciphers which are called additive natural stream ciphers. These ciphers use a natural sequence generator to produce a periodic keystream. Full definitions of these concepts are given in Chapter 2.This book focuses on keystream sequences which can be analysed using number theory. It turns out that a great deal of information can be deducted about the cryptographic properties of many classes of sequences by applying the terminology and theorems of number theory. These connections can be explicitly made by describing three kinds of bridges between stream ciphering problems and number theory problems. A detailed summary of these ideas is given in the introductory Chapter 1.Many results in the book are new, and over seventy percent of these results described in this book are based on recent research results.

Covering Codes

• 1st Edition
• Volume 54
• April 1, 1997
• G. Cohen + 3 more
• English
• eBook 978-0-08-053007-9

  9 7 8 - 0 - 0 8 - 0 5 3 0 0 7 - 9

The problems of constructing covering codes and of estimating their parameters are the main concern of this book. It provides a unified account of the most recent theory of covering codes and shows how a number of mathematical and engineering issues are related to covering problems.Scientists involved in discrete mathematics, combinatorics, computer science, information theory, geometry, algebra or number theory will find the book of particular significance. It is designed both as an introductory textbook for the beginner and as a reference book for the expert mathematician and engineer.A number of unsolved problems suitable for research projects are also discussed.

Linear Models

• 1st Edition
• October 9, 1996
• William R. Moser
• Zbynek Sidak + 2 more
• English
• eBook 978-0-08-051029-3

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

Linear models, normally presented in a highly theoretical and mathematical style, are brought down to earth in this comprehensive textbook. Linear Models examines the subject from a mean model perspective, defining simple and easy-to-learn rules for building mean models, regression models, mean vectors, covariance matrices and sums of squares matrices for balanced and unbalanced data sets. The author includes both applied and theoretical discussions of the multivariate normal distribution, quadratic forms, maximum likelihood estimation, less than full rank models, and general mixed models. The mean model is used to bring all of these topics together in a coherent presentation of linear model theory.

Decision and Discrete Mathematics

• 1st Edition
• January 1, 1996
• I Hardwick
• English
• eBook 978-0-85709-982-2

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

This text offers a complete coverage in the Decision Mathematics module, also known as Discrete Mathematics, of the syllabuses of English A-level examination boards. it is a rewritten and modern version of Decision Mathematics (published by Ellis Horwood Ltd in 1986 for The Spode Group, so well known for its development of innovative mathematics teaching). It is also a suitable text for foundation and first year undergraduate courses in qualitative studies or operational research, or for access courses for students needing strengthening in mathematics, or for students who are moving into mathematics from another subject discipline.Compact and concise, it reflects the combined teaching skills and experience of its authors who know exactly what mathematics must be learnt at the readership level today. The text is built up in modular fashion, explaining concepts used in decision mathematics and related operational research, and electronics. It emphasises an understanding of techniques and algorithms, which it relates to real life situations and working problems that will apply throughout future working careers.

Handbook of Combinatorics Volume 1

• 1st Edition
• December 11, 1995
• Bozzano G Luisa
• English
• Hardback 978-0-444-82346-5

  9 7 8 - 0 - 4 4 4 - 8 2 3 4 6 - 5
• eBook 978-0-08-093335-1

  9 7 8 - 0 - 0 8 - 0 9 3 3 3 5 - 1

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.

Handbook of Combinatorics

• 1st Edition
• December 11, 1995
• R.L. Graham
• English
• eBook 978-0-08-093384-9

  9 7 8 - 0 - 0 8 - 0 9 3 3 8 4 - 9

Discrete Mathematics

• 1st Edition
• September 17, 1995
• Amanda Chetwynd + 1 more
• English
• eBook 978-0-08-092860-9

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

As an introduction to discrete mathematics, this text provides a straightforward overview of the range of mathematical techniques available to students. Assuming very little prior knowledge, and with the minimum of technical complication, it gives an account of the foundations of modern mathematics: logic; sets; relations and functions. It then develops these ideas in the context of three particular topics: combinatorics (the mathematics of counting); probability (the mathematics of chance) and graph theory (the mathematics of connections in networks).Worked examples and graded exercises are used throughout to develop ideas and concepts. The format of this book is such that it can be easily used as the basis for a complete modular course in discrete mathematics.

Threshold Graphs and Related Topics

• 1st Edition
• Volume 56
• September 13, 1995
• N.V.R. Mahadev + 1 more
• English
• eBook 978-0-08-054300-0

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

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.