Cantitate/Preț
Produs

Problems from the Discrete to the Continuous: Probability, Number Theory, Graph Theory, and Combinatorics: Universitext

Autor Ross G. Pinsky
en Limba Engleză Paperback – 25 aug 2014
The primary intent of the book is to introduce an array of beautiful problems in a variety of subjects quickly, pithily and completely rigorously to graduate students and advanced undergraduates. The book takes a number of specific problems and solves them, the needed tools developed along the way in the context of the particular problems. It treats a melange of topics from combinatorial probability theory, number theory, random graph theory and combinatorics. The problems in this book involve the asymptotic analysis of a discrete construct, as some natural parameter of the system tends to infinity. Besides bridging discrete mathematics and mathematical analysis, the book makes a modest attempt at bridging disciplines. The problems were selected with an eye toward accessibility to a wide audience, including advanced undergraduate students. The book could be used for a seminar course in which students present the lectures.
Citește tot Restrânge

Din seria Universitext

Preț: 40572 lei

Nou

Puncte Express: 609

Preț estimativ în valută:
7765 8065$ 6450£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319079646
ISBN-10: 3319079646
Pagini: 154
Ilustrații: XIII, 154 p. 8 illus. in color.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.25 kg
Ediția:2014
Editura: Springer International Publishing
Colecția Springer
Seria Universitext

Locul publicării:Cham, Switzerland

Public țintă

Upper undergraduate

Cuprins

Partitions With Restricted Summands or "The Money Changing Problem".- The Asymptotic Density of Relatively Prime Pairs and of Square-Free Numbers.- A One-Dimensional Probabilistic Packing Problem.- The Arcsine Laws for the One-Dimensional Simple Symmetric Random Walk.- The Distribution of Cycles in Random Permutations.- Chebyshev's Theorem on the Asymptotic Density of the Primes.- Mertens' Theorems on the Asymptotic Behavior of the Primes.- The Hardy-Ramanujan Theorem on the Number of Distinct Prime Divisors.- The Largest Clique in a Random Graph and Applications to Tampering Detection and Ramsey Theory.- The Phase Transition Concerning the Giant Component in a Sparse Random Graph–a Theorem of Erdős and Rényi.

Notă biografică

Ross Pinsky is a Professor in the Department of Mathematics at Technion-Israel Institute of Technology.

Textul de pe ultima copertă

The primary intent of the book is to introduce an array of beautiful problems in a variety of subjects quickly, pithily and completely rigorously to graduate students and advanced undergraduates. The book takes a number of specific problems and solves them, the needed tools developed along the way in the context of the particular problems. It treats a mélange of topics from combinatorial probability theory, number theory, random graph theory and combinatorics. The problems in this book involve the asymptotic analysis of a discrete construct as some natural parameter of the system tends to infinity. Besides bridging discrete mathematics and mathematical analysis, the book makes a modest attempt at bridging disciplines. The problems were selected with an eye toward accessibility to a wide audience, including advanced undergraduate students. The book could be used for a seminar course in which students present the lectures.

Caracteristici

Treats problems from four different mathematical disciplines, under the common theme of asymptotic limits and generous use of generating function techniques Presented rigorously and with enough detail to allow the advanced undergraduate student to use it for independent study Excellent for a seminar course in which the students present the lectures Includes supplementary material: sn.pub/extras