Author: Béla Bollobás
Publisher: Cambridge University Press
ISBN: 9780521584722
Category : Mathematics
Languages : en
Pages : 588

Get Book Here

Book Description
A panorama of combinatorics by the world's experts.

Author: Steven T. Dougherty
Publisher: Springer Nature
ISBN: 3030563952
Category : Mathematics
Languages : en
Pages : 374

Get Book Here

Book Description
This undergraduate textbook is suitable for introductory classes in combinatorics and related topics. The book covers a wide range of both pure and applied combinatorics, beginning with the very basics of enumeration and then going on to Latin squares, graphs and designs. The latter topic is closely related to finite geometry, which is developed in parallel. Applications to probability theory, algebra, coding theory, cryptology and combinatorial game theory comprise the later chapters. Throughout the book, examples and exercises illustrate the material, and the interrelations between the various topics is emphasized. Readers looking to take first steps toward the study of combinatorics, finite geometry, design theory, coding theory, or cryptology will find this book valuable. Essentially self-contained, there are very few prerequisites aside from some mathematical maturity, and the little algebra required is covered in the text. The book is also a valuable resource for anyone interested in discrete mathematics as it ties together a wide variety of topics.

Author: Michael Drmota
Publisher: Springer Science & Business Media
ISBN: 3211753575
Category : Mathematics
Languages : en
Pages : 466

Get Book Here

Book Description
The aim of this book is to provide a thorough introduction to various aspects of trees in random settings and a systematic treatment of the mathematical analysis techniques involved. It should serve as a reference book as well as a basis for future research.

Author: Daniel A. Klain
Publisher: Cambridge University Press
ISBN: 9780521596541
Category : Mathematics
Languages : en
Pages : 196

Get Book Here

Book Description
The purpose of this book is to present the three basic ideas of geometrical probability, also known as integral geometry, in their natural framework. In this way, the relationship between the subject and enumerative combinatorics is more transparent, and the analogies can be more productively understood. The first of the three ideas is invariant measures on polyconvex sets. The authors then prove the fundamental lemma of integral geometry, namely the kinematic formula. Finally the analogues between invariant measures and finite partially ordered sets are investigated, yielding insights into Hecke algebras, Schubert varieties and the quantum world, as viewed by mathematicians. Geometers and combinatorialists will find this a most stimulating and fruitful story.

Author: Stefan Felsner
Publisher: Springer Science & Business Media
ISBN: 3322803031
Category : Mathematics
Languages : en
Pages : 179

Get Book Here

Book Description
Among the intuitively appealing aspects of graph theory is its close connection to drawings and geometry. The development of computer technology has become a source of motivation to reconsider these connections, in particular geometric graphs are emerging as a new subfield of graph theory. Arrangements of points and lines are the objects for many challenging problems and surprising solutions in combinatorial geometry. The book is a collection of beautiful and partly very recent results from the intersection of geometry, graph theory and combinatorics.

Author: Jacob E. Goodman
Publisher: Cambridge University Press
ISBN: 9780521848626
Category : Computers
Languages : en
Pages : 640

Get Book Here

Book Description
This 2005 book deals with interest topics in Discrete and Algorithmic aspects of Geometry.

Author: Mikhail B. Skopenkov
Publisher: American Mathematical Society, Simons Laufer Mathematical Sciences Institute (SLMath, formerly MSRI)
ISBN: 1470460106
Category : Mathematics
Languages : en
Pages : 222

Get Book Here

Book Description
This book is a translation from Russian of Part III of the book Mathematics via Problems: From Olympiads and Math Circles to Profession. Part I, Algebra, and Part II, Geometry, have been published in the same series. The main goal of this book is to develop important parts of mathematics through problems. The authors tried to put together sequences of problems that allow high school students (and some undergraduates) with strong interest in mathematics to discover such topics in combinatorics as counting, graphs, constructions and invariants in combinatorics, games and algorithms, probabilistic aspects of combinatorics, and combinatorial geometry. Definitions and/or references for material that is not standard in the school curriculum are included. To help students that might be unfamiliar with new material, problems are carefully arranged to provide gradual introduction into each subject. Problems are often accompanied by hints and/or complete solutions. The book is based on classes taught by the authors at different times at the Independent University of Moscow, at a number of Moscow schools and math circles, and at various summer schools. It can be used by high school students and undergraduates, their teachers, and organizers of summer camps and math circles. In the interest of fostering a greater awareness and appreciation of mathematics and its connections to other disciplines and everyday life, SLMath (formerly MSRI) and the AMS are publishing books in the Mathematical Circles Library series as a service to young people, their parents and teachers, and the mathematics profession.

Author: Graham Brightwell
Publisher: Cambridge University Press
ISBN: 0521872073
Category : Mathematics
Languages : en
Pages : 27

Get Book Here

Book Description
This volume celebrating the 60th birthday of Béla Bollobás presents the state of the art in combinatorics.

Author: Béla Bollobás
Publisher: Cambridge University Press
ISBN: 9780521337038
Category : Mathematics
Languages : en
Pages : 196

Get Book Here

Book Description
Combinatorics is a book whose main theme is the study of subsets of a finite set. It gives a thorough grounding in the theories of set systems and hypergraphs, while providing an introduction to matroids, designs, combinatorial probability and Ramsey theory for infinite sets. The gems of the theory are emphasized: beautiful results with elegant proofs. The book developed from a course at Louisiana State University and combines a careful presentation with the informal style of those lectures. It should be an ideal text for senior undergraduates and beginning graduates.

Author: Steven T. Dougherty
Publisher: Springer
ISBN: 9783030563943
Category : Mathematics
Languages : en
Pages : 369

Get Book Here

Book Description
This undergraduate textbook is suitable for introductory classes in combinatorics and related topics. The book covers a wide range of both pure and applied combinatorics, beginning with the very basics of enumeration and then going on to Latin squares, graphs and designs. The latter topic is closely related to finite geometry, which is developed in parallel. Applications to probability theory, algebra, coding theory, cryptology and combinatorial game theory comprise the later chapters. Throughout the book, examples and exercises illustrate the material, and the interrelations between the various topics is emphasized. Readers looking to take first steps toward the study of combinatorics, finite geometry, design theory, coding theory, or cryptology will find this book valuable. Essentially self-contained, there are very few prerequisites aside from some mathematical maturity, and the little algebra required is covered in the text. The book is also a valuable resource for anyone interested in discrete mathematics as it ties together a wide variety of topics.