Søgning på underkategorier- og emner:
Bemærk: Kan ikke leveres før jul.
A self-contained and concise introduction to recent developments, particularly those of a geometric and topological nature, in the theory of random graphs.... Læs mere
Bemærk: Kan ikke leveres før jul.
A self-contained and concise introduction to recent developments, particularly those of a geometric and topological nature, in the theory of random graphs.... Læs mere
Bemærk: Kan ikke leveres før jul.
Enumerative combinatorics, in its algebraic and analytic forms, is vital to many areas of mathematics, from model theory to statistical... Læs mere
Bemærk: Kan ikke leveres før jul.
This book covers random graphs from the basic to the advanced and will appeal to anyone interested in combinatorics, applied probability or theoretical computer science. Having read this book, the reader should be in a good position to pursue research in the area.
Bemærk: Kan ikke leveres før jul.
This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate... Læs mere
Bemærk: Kan ikke leveres før jul.
Recent years have seen rapid progress in the field of approximate groups, with the emergence of a varied range of applications. Written by a leader in the field, this... Læs mere
Bemærk: Kan ikke leveres før jul.
This fascinating look at combinatorial games, that is, games not involving chance or hidden information, offers updates on standard games such as Go and Hex, on impartial games such as Chomp and Wythoff's Nim, and on aspects of games with infinitesimal values.
Bemærk: Kan ikke leveres før jul.
Recent years have seen a flurry of advances in Fourier restriction theory, with significant applications in number theory, PDEs and geometric analysis.... Læs mere
Bemærk: Kan ikke leveres før jul.
The Erdos–Ko–Rado Theorem is a fundamental result in combinatorics. Aimed at graduate students and researchers, this comprehensive text shows how tools from... Læs mere
Bemærk: Kan ikke leveres før jul.
For over fifty years, Ron Graham has been able to illuminate the common threads connecting different areas in discrete... Læs mere
Bemærk: Kan ikke leveres før jul.
This groundbreaking, yet accessible book contains original results on the interaction between graph theory and computational... Læs mere
Bemærk: Kan ikke leveres før jul.
The 400-year-old Kepler conjecture about sphere packings is the oldest problem in discrete geometry. In this book, readers will learn about it through a proof that is much more accessible than the original proof of the theorem.