Books in Discrete mathematics combinatorics

An Introduction to Discrete Mathematics

1st Edition
June 9, 2025
Vidyadhar Kulkarni
English
Paperback
9 7 8 0 4 4 3 2 4 8 4 8 1
eBook
9 7 8 0 4 4 3 2 4 8 5 0 4

An Introduction to Discrete Mathematics offers an engaging and accessible introduction to discrete mathematics for beginning undergraduate students across a wide range of application areas, from mathematics to statistics, operations research, business, engineering, and the sciences. It provides solid foundation in precise proof writing methods, with early chapters introducing set theory and logic that are followed by deductive and inductive proof techniques, number theory, counting principles, permutations and combinations, probability of events, random variables, graphs, and weighted graphs.The book illustrates fundamental concepts in discrete mathematics with clear and precise definitions that are paired with examples and counter-examples as applied in combinatorics, discrete probability, and graph theory. Chapters include student exercises to enhance learning, and a solutions manual and example questions are available for instructors on a companion website.

Discrete Mathematics With Logic

1st Edition
July 20, 2023
Martin Milanic + 2 more
English
Paperback
9 7 8 0 4 4 3 1 8 7 8 2 7
eBook
9 7 8 0 4 4 3 1 8 7 8 3 4

Discrete Mathematics provides key concepts and a solid, rigorous foundation in mathematical reasoning. Appropriate for undergraduate as well as a starting point for more advanced class, the resource offers a logical progression through key topics without assuming any background in algebra or computational skills and without duplicating what they will learn in higher level courses. The book is designed as an accessible introduction for students in mathematics or computer science as it explores questions that test the understanding of proof strategies, such as mathematical induction. For students interested to dive into this subject, the text offers a rigorous introduction to mathematical thought through useful examples and exercises.

Discrete Mathematics

1st Edition
April 29, 2022
Ali Grami
English
Paperback
9 7 8 0 1 2 8 2 0 6 5 6 0
eBook
9 7 8 0 1 2 8 2 0 9 0 9 7

Discrete Mathematics: Essentials and Applications offers a comprehensive survey of the area, particularly concentrating on the basic principles and applications of Discrete Mathematics. This up-to-date text provides proofs of significance, keeping the focus on numerous relevant examples and many pertinent applications. Written in a simple and clear tone, the title features insightful descriptions and intuitive explanations of all complex concepts and ensures a thorough understanding of the subject matter.

Fixed Point Theory and Graph Theory

1st Edition
June 10, 2016
Monther Alfuraidan + 1 more
English
Hardback
9 7 8 0 1 2 8 0 4 2 9 5 3
eBook
9 7 8 0 1 2 8 0 4 3 6 5 3

Fixed Point Theory and Graph Theory provides an intersection between the theories of fixed point theorems that give the conditions under which maps (single or multivalued) have solutions and graph theory which uses mathematical structures to illustrate the relationship between ordered pairs of objects in terms of their vertices and directed edges. This edited reference work is perhaps the first to provide a link between the two theories, describing not only their foundational aspects, but also the most recent advances and the fascinating intersection of the domains. The authors provide solution methods for fixed points in different settings, with two chapters devoted to the solutions method for critically important non-linear problems in engineering, namely, variational inequalities, fixed point, split feasibility, and hierarchical variational inequality problems. The last two chapters are devoted to integrating fixed point theory in spaces with the graph and the use of retractions in the fixed point theory for ordered sets.

The Joy of Finite Mathematics

1st Edition
October 27, 2015
Chris P. Tsokos + 1 more
English
Paperback
9 7 8 0 1 2 8 0 2 9 6 7 1
eBook
9 7 8 0 1 2 8 0 2 9 8 5 5

The Joy of Finite Mathematics: The Language and Art of Math teaches students basic finite mathematics through a foundational understanding of the underlying symbolic language and its many dialects, including logic, set theory, combinatorics (counting), probability, statistics, geometry, algebra, and finance. Through detailed explanations of the concepts, step-by-step procedures, and clearly defined formulae, readers learn to apply math to subjects ranging from reason (logic) to finance (personal budget), making this interactive and engaging book appropriate for non-science, undergraduate students in the liberal arts, social sciences, finance, economics, and other humanities areas. The authors utilize important historical facts, pose interesting and relevant questions, and reference real-world events to challenge, inspire, and motivate students to learn the subject of mathematical thinking and its relevance. The book is based on the authors’ experience teaching Liberal Arts Math and other courses to students of various backgrounds and majors, and is also appropriate for preparing students for Florida’s CLAST exam or similar core requirements.

Bent Functions

1st Edition
August 6, 2015
Natalia Tokareva
English
Paperback
9 7 8 0 1 2 8 0 2 3 1 8 1
eBook
9 7 8 0 1 2 8 0 2 5 5 5 0

Bent Functions: Results and Applications to Cryptography offers a unique survey of the objects of discrete mathematics known as Boolean bent functions. As these maximal, nonlinear Boolean functions and their generalizations have many theoretical and practical applications in combinatorics, coding theory, and cryptography, the text provides a detailed survey of their main results, presenting a systematic overview of their generalizations and applications, and considering open problems in classification and systematization of bent functions. The text is appropriate for novices and advanced researchers, discussing proofs of several results, including the automorphism group of bent functions, the lower bound for the number of bent functions, and more.

Latin Squares and their Applications

2nd Edition
July 24, 2015
A. Donald Keedwell + 1 more
English
Hardback
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
9 7 8 0 1 2 8 0 1 2 1 3 0
eBook
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.

Cryptographic Boolean Functions and Applications

1st Edition
March 4, 2009
Thomas W. Cusick + 1 more
English
Hardback
9 7 8 0 1 2 3 7 4 8 9 0 4
eBook
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.

Computational Theory of Iterative Methods

1st Edition
Volume 15
September 4, 2007
Ioannis Argyros
English
eBook
9 7 8 0 0 8 0 5 6 0 7 0 0

The book is designed for researchers, students and practitioners interested in using fast and efficient iterative methods to approximate solutions of nonlinear equations. The following four major problems are addressed. Problem 1: Show that the iterates are well defined. Problem 2: concerns the convergence of the sequences generated by a process and the question of whether the limit points are, in fact solutions of the equation. Problem 3: concerns the economy of the entire operations. Problem 4: concerns with how to best choose a method, algorithm or software program to solve a specific type of problem and its description of when a given algorithm succeeds or fails. The book contains applications in several areas of applied sciences including mathematical programming and mathematical economics. There is also a huge number of exercises complementing the theory.

Life Sciences

Physical Sciences & Engineering

Social Sciences & Humanities

Health