Problems from the Discrete to the Continuous: Probability, Number Theory, Graph Theory, and Combinatorics - Couverture souple
Livre 170 sur 261: Universitext
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
