Discrete mathematics is quickly becoming one of the most important areas of László Lovász is a Senior Researcher in the Theory Group at. Discrete mathematics is quickly becoming one of the most important areas of László Lovász is a Senior Researcher in the Theory Group at Microsoft. Discrete Mathematics. Front Cover. László Lovász, Katalin L. Vesztergombi. Yale Univ., Discrete Mathematics: Elementary and Beyond · Laszlo Lovasz.

Author: | Fenrilabar Mikakazahn |

Country: | South Sudan |

Language: | English (Spanish) |

Genre: | Life |

Published (Last): | 28 June 2011 |

Pages: | 170 |

PDF File Size: | 11.24 Mb |

ePub File Size: | 7.57 Mb |

ISBN: | 140-3-44411-358-2 |

Downloads: | 14289 |

Price: | Free* [*Free Regsitration Required] |

Uploader: | Batilar |

Binomial Coefficients and Pascals Triangle. Then there is a foray into planar geometry leading to a discussion of the Four Color Theorem. But they do not shy away from first convincing the reader of the likelihood of a result having usually led the reader to that point skillfully and then providing a proof.

### Discrete mathematics (Lovász László; Pelikán József; Vesztergombi Katalin)

My library Help Advanced Book Search. Account Options Sign in.

When this book arrived on my desk, it got buried rather quickly, and after falling onto the back burner, it stayed there for quite some time. Account Options Sign in. The first paragraph of the chapter entitled Integers, Divisors, and Primes presents a good example of this philosophy in action:.

In Chapter Six, the theme is prime numbers. It mathematkcs long been a staple in the mathematics studied and used by computer scientists as well as mathematicians. To conclude, in Discrete Mathematics Lovasz, Pelikan and Vesztergombi have succeeded in providing us with a book that is sure to please many readers.

### Discrete Mathematics: Elementary and Beyond – L. Lovász, J. Pelikán, K. Vesztergombi – Google Books

Her area of specialty is algebraic mahematics. For example, there is a discussion of pseudoprimes and of the Miller-Rabin, algorithm which, upon iteration, has an excellent probability of correctly identifying a prime. Until I started actually reading it.

The prerequisite to read and understand this book is the knowledge of high school mathematics, but the reader must also refer other papers and books to get the in depth discrdte for some of the proofs and concept. In addition, there are numerous examples, figures and exercises spread throughout the book.

Other editions – View all Discrete Mathematics: This result is not new the authors date it mathematicw the late s but it was new to me.

## László Lovász

The material is basic, as one expects from a book in the Undergraduate Texts in Mathematics series, but there is some material lovaz the elementary. Vesztergombi Limited preview – Vesztergombi Limited preview – In addition, there are numerous examples, figures and exercises spread throughout the book. This book is aimed at kathematics mathematics and computer science students interested in developing a feeling for what mathematics is all about, where mathematics can be helpful, and what kinds of questions mathematicians work on.

Graphs and trees, and matching and optimization problems are the themes of the next few chapters. The last two chapters delve into coding theory and cryptography by introducing projective planes, Steiner systems, etc, on the way to describing the RSA cryptosystem. This book does a wonderful job of lasz,o mathematics as a vibrant field. Likewise, algorithms are discussed amthematics from a mathematical viewpoint — as in the Euclidean Algorithm, as are recurrence matematics.

The first chapter takes up the topics of sets and counting, but the discussion of unions of sets, intersection of sets, and other such introductory logic is extremely brief. Coloring Maps and Graphs. Lovasz, Pelikan and Vesztergombi’s choice of topics does have a more mathematical bent in comparison to some other undergraduate texts at which I looked. I’m a sucker for projective planes, as well as cryptography, and was delighted with this selection as a fitting conclusion to the book.

One might think that after years of research, one would know essentially everything about the subject. This is the longest chapter in the text, at about thirty pages. I was also pleased that in several places the authors would state a best known result, and then proceed to state and prove an easier result — one that was within the scope of the book.

But a reader interested in discrete mathematics mostly for the sake of computer science will likely be disappointed, frustrated, or both. Elementary and Beyond Discrete Mathematics: This book is aimed at undergraduate mathematics and computer science students interested in developing a In light of this, one must certainly ask whether or not another book on the subject belongs on the bookshelf.

Recurrence relations are briefly introduced via the Fibonacci numbers, but attention quickly turns to combinatorial probability and a new chapter.