Discrete Mathematics Research Progress

Discrete Mathematics Research Progress

Author: Kenneth Brian Moore

Publisher: Nova Publishers

Published: 2008

Total Pages: 266

ISBN-13: 9781604561234

DOWNLOAD EBOOK

Discrete mathematics, also called finite mathematics or Decision Maths, is the study of mathematical structures that are fundamentally discrete, in the sense of not supporting or requiring the notion of continuity. Most, if not all, of the objects studied in finite mathematics are countable sets, such as integers, finite graphs, and formal languages. Discrete mathematics has become popular in recent decades because of its applications to computer science. Concepts and notations from discrete mathematics are useful to study or describe objects or problems in computer algorithms and programming languages. In some mathematics curricula, finite mathematics courses cover discrete mathematical concepts for business, while discrete mathematics courses emphasise concepts for computer science majors.


Connections in Discrete Mathematics

Connections in Discrete Mathematics

Author: Steve Butler

Publisher: Cambridge University Press

Published: 2018-06-14

Total Pages: 368

ISBN-13: 1108583636

DOWNLOAD EBOOK

Discrete mathematics has been rising in prominence in the past fifty years, both as a tool with practical applications and as a source of new and interesting mathematics. The topics in discrete mathematics have become so well developed that it is easy to forget that common threads connect the different areas, and it is through discovering and using these connections that progress is often made. For over fifty years, Ron Graham has been able to illuminate some of these connections and has helped to bring the field of discrete mathematics to where it is today. To celebrate his contribution, this volume brings together many of the best researchers working in discrete mathematics, including Fan Chung, Erik D. Demaine, Persi Diaconis, Peter Frankl, Alfred W. Hales, Jeffrey C. Lagarias, Allen Knutson, Janos Pach, Carl Pomerance, N. J. A. Sloane, and of course, Ron Graham himself.


Discrete Mathematics for New Technology, Second Edition

Discrete Mathematics for New Technology, Second Edition

Author: Rowan Garnier

Publisher: CRC Press

Published: 2001-12-01

Total Pages: 786

ISBN-13: 9781420056983

DOWNLOAD EBOOK

Updated and expanded, Discrete Mathematics for New Technology, Second Edition provides a sympathetic and accessible introduction to discrete mathematics, including the core mathematics requirements for undergraduate computer science students. The approach is comprehensive yet maintains an easy-to-follow progression from the basic mathematical ideas to the more sophisticated concepts examined in the latter stages of the book. Although the theory is presented rigorously, it is illustrated by the frequent use of pertinent examples and is further reinforced with exercises-some with hints and solutions-to enable the reader to achieve a comprehensive understanding of the subject at hand. New to the Second Edition Numerous new examples and exercises designed to illustrate and reinforce mathematical concepts and facilitate students' progression through the topics New sections on typed set theory and an introduction to formal specification Presenting material that is at the foundations of mathematics itself, Discrete Mathematics for New Technology is a readable, friendly textbook designed for non-mathematicians as well as for computing and mathematics undergraduates alike.


Discrete and Computational Geometry

Discrete and Computational Geometry

Author: Jacob E. Goodman

Publisher: American Mathematical Soc.

Published: 1991-01-01

Total Pages: 394

ISBN-13: 9780821871010

DOWNLOAD EBOOK

The first DIMACS special year, held during 1989-1990, was devoted to discrete and computational geometry. More than 200 scientists, both long- and short-term visitors, came to DIMACS to participate in the special year activities. Among the highlights were six workshops at Rutgers and Princeton Universities that defined the focus for much of the special year. The workshops addressed the following topics: geometric complexity, probabilistic methods in discrete and computational geometry, polytopes and convex sets, arrangements, and algebraic and practical issues in geometric computation. This volume presents some of the results growing out of the workshops and the special year activities. Containing both survey articles and research papers, this collection presents an excellent overview of significant recent progress in discrete and computational geometry. The diversity of these papers demonstrate how geometry continues to provide a vital source of ideas in theoretical computer science and discrete mathematics as well as fertile ground for interaction and simulation between the two disciplines.


The Discrete Mathematical Charms of Paul Erdos

The Discrete Mathematical Charms of Paul Erdos

Author: Vašek Chvátal

Publisher: Cambridge University Press

Published: 2021-08-26

Total Pages: 270

ISBN-13: 1108934919

DOWNLOAD EBOOK

Paul Erdős published more papers during his lifetime than any other mathematician, especially in discrete mathematics. He had a nose for beautiful, simply-stated problems with solutions that have far-reaching consequences across mathematics. This captivating book, written for students, provides an easy-to-understand introduction to discrete mathematics by presenting questions that intrigued Erdős, along with his brilliant ways of working toward their answers. It includes young Erdős's proof of Bertrand's postulate, the Erdős-Szekeres Happy End Theorem, De Bruijn-Erdős theorem, Erdős-Rado delta-systems, Erdős-Ko-Rado theorem, Erdős-Stone theorem, the Erdős-Rényi-Sós Friendship Theorem, Erdős-Rényi random graphs, the Chvátal-Erdős theorem on Hamilton cycles, and other results of Erdős, as well as results related to his work, such as Ramsey's theorem or Deza's theorem on weak delta-systems. Its appendix covers topics normally missing from introductory courses. Filled with personal anecdotes about Erdős, this book offers a behind-the-scenes look at interactions with the legendary collaborator.


Open Problems in Mathematics

Open Problems in Mathematics

Author: John Forbes Nash, Jr.

Publisher: Springer

Published: 2016-07-05

Total Pages: 547

ISBN-13: 3319321625

DOWNLOAD EBOOK

The goal in putting together this unique compilation was to present the current status of the solutions to some of the most essential open problems in pure and applied mathematics. Emphasis is also given to problems in interdisciplinary research for which mathematics plays a key role. This volume comprises highly selected contributions by some of the most eminent mathematicians in the international mathematical community on longstanding problems in very active domains of mathematical research. A joint preface by the two volume editors is followed by a personal farewell to John F. Nash, Jr. written by Michael Th. Rassias. An introduction by Mikhail Gromov highlights some of Nash’s legendary mathematical achievements. The treatment in this book includes open problems in the following fields: algebraic geometry, number theory, analysis, discrete mathematics, PDEs, differential geometry, topology, K-theory, game theory, fluid mechanics, dynamical systems and ergodic theory, cryptography, theoretical computer science, and more. Extensive discussions surrounding the progress made for each problem are designed to reach a wide community of readers, from graduate students and established research mathematicians to physicists, computer scientists, economists, and research scientists who are looking to develop essential and modern new methods and theories to solve a variety of open problems.


Research Problems in Discrete Geometry

Research Problems in Discrete Geometry

Author: Peter Brass

Publisher: Taylor & Francis US

Published: 2005-09-07

Total Pages: 520

ISBN-13: 9780387238159

DOWNLOAD EBOOK

This book is the result of a 25-year-old project and comprises a collection of more than 500 attractive open problems in the field. The largely self-contained chapters provide a broad overview of discrete geometry, along with historical details and the most important partial results related to these problems. This book is intended as a source book for both professional mathematicians and graduate students who love beautiful mathematical questions, are willing to spend sleepless nights thinking about them, and who would like to get involved in mathematical research.


Mathematical Research Today and Tomorrow

Mathematical Research Today and Tomorrow

Author: Carles Casacuberta

Publisher: Springer

Published: 2006-11-15

Total Pages: 118

ISBN-13: 3540473416

DOWNLOAD EBOOK

The Symposium on the Current State and Prospects of Mathematics was held in Barcelona from June 13 to June 18, 1991. Seven invited Fields medalists gavetalks on the development of their respective research fields. The contents of all lectures were collected in the volume, together witha transcription of a round table discussion held during the Symposium. All papers are expository. Some parts include precise technical statements of recent results, but the greater part consists of narrative text addressed to a very broad mathematical public. CONTENTS: R. Thom: Leaving Mathematics for Philosophy.- S. Novikov: Role of Integrable Models in the Development of Mathematics.- S.-T. Yau: The Current State and Prospects of Geometry and Nonlinear Differential Equations.- A. Connes: Noncommutative Geometry.- S. Smale: Theory of Computation.- V. Jones: Knots in Mathematics and Physics.- G. Faltings: Recent Progress in Diophantine Geometry.


Combinatorics of Permutations

Combinatorics of Permutations

Author: Miklos Bona

Publisher: CRC Press

Published: 2022-05-09

Total Pages: 461

ISBN-13: 1000563820

DOWNLOAD EBOOK

A CHOICE "Outstanding Academic Title," the first edition of this bestseller was lauded for its detailed yet engaging treatment of permutations. Providing more than enough material for a one-semester course, Combinatorics of Permutations, third edition continues to clearly show the usefulness of this subject for both students and researchers. The research in combinatorics of permutations has advanced rapidly since this book was published in a first edition. Now the third edition offers not only updated results, it remains the leading textbook for a course on the topic. Coverage is mostly enumerative, but there are algebraic, analytic, and topological parts as well, and applications. Since the publication of the second edition, there is tremendous progress in pattern avoidance (Chapters 4 and 5). There is also significant progress in the analytic combinatorics of permutations, which will be incorporated. •A completely new technique from extremal combinatorics disproved a long-standing conjecture, and this is presented in Chapter 4. •The area of universal permutations has undergone a lot of very recent progress, and that has been noticed outside the academic community as well. This also influenced the revision of Chapter 5. •New results in stack sorting are added to Chapter 8. •Chapter 9 applications to biology has been revised. The author’s other works include Introduction to Enumerative and Analytic Combinatorics, second edition (CHOICE "Outstanding Academic Title") and Handbook of Enumerative Combinatorics, published by CRC Press. The author also serves as Series Editor for CRC’s Discrete Mathematics and Its Applications.