Problems from the discrete to the continuous. Probability, number theory, graph theory, and combinatorics

DOI10.1007/978-3-319-07965-3zbMath1311.11002OpenAlexW2498788949MaRDI QIDQ2250288

Ross G. Pinsky

Publication date: 4 July 2014

Published in: Universitext (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07965-3

zbMATH Keywords

Riemann zeta functionRamsey theorypermutationrandom walkrandom graphmultiplicative functionpartition theoryStirling's approximationprobabilistic packing

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory (60-01) (zeta (s)) and (L(s, chi)) (11M06) Mathematics for nonmathematicians (engineering, social sciences, etc.) (00A06) Elementary theory of partitions (11P81) Arithmetic functions; related numbers; inversion formulas (11A25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01)

Related Items (10)

A view from the bridge spanning combinatorics and probability ⋮ Lattice Point Visibility on Generalized Lines of Sight ⋮ Discretization of the parking problem ⋮ One-sided selfish parking ⋮ Asymptotic normality in a discrete analog of the parking problem ⋮ Unnamed Item ⋮ Lattice point visibility on power functions ⋮ Generalized lattice-point visibility in \(\mathbb{N}^k\) ⋮ Last-Mile Shared Delivery: A Discrete Sequential Packing Approach ⋮ The Infinite limit of random permutations avoiding patterns of length three

This page was built for publication: Problems from the discrete to the continuous. Probability, number theory, graph theory, and combinatorics