Combinatorics: Ancient and Modern
From MaRDI portal
Publication:2839863
DOI10.1093/acprof:oso/9780199656592.001.0001zbMath1269.01001OpenAlexW585581451MaRDI QIDQ2839863
No author found.
Publication date: 12 July 2013
Full work available at URL: https://doi.org/10.1093/acprof:oso/9780199656592.001.0001
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to history and biography (01-06) History of combinatorics (05-03) History of mathematics and mathematicians (01Axx)
Related Items (9)
On sets not belonging to algebras and rainbow matchings in graphs ⋮ In the footsteps of Euler and MacMahon: combinatorics, the mathematics that counts ⋮ Partnership, Partition, and Proof: The Path to the Hardy–Ramanujan Partition Formula ⋮ Euler's enumerations ⋮ Why avoid induction? ⋮ Unnamed Item ⋮ An asymptotic distribution theory for Eulerian recurrences with applications ⋮ Inductive formulas related to prime partitions ⋮ Centered partition processes: informative priors for clustering (with discussion)
This page was built for publication: Combinatorics: Ancient and Modern
