Numerical solution of ordinary differential equations: One step methods by André Jürgen Massing Created 2026-10-14 Updated 2026-11-05
Authored notes credited to André Massing, identified as André Jürgen Massing by the NTNU profile. Dated 3 October 2021, in the TMA4125/4130/4135 Mathematics 4N/D materials; the university is the host, rather than the author.
Cited passages: André Massing, Numerical solution of ordinary differential equations: One step methods, October 3, 2021, page 1, Example 1.1: Euler and Heun increment functions.
Branch Points and Branch Cuts by Rodolfo R. Rosales Created 2026-10-14 Updated 2026-11-05
Standalone teaching notes credited to Rodolfo R. Rosales, identified as Rodolfo Ruben Rosales by the MIT profile. The title page says MIT 18.04 and is dated 11 October 1999; the hosting folder 18.305 does not identify its course or authorship of an entire course.
Cited passages: Rosales, Branch Points and Branch Cuts, section 1 and Example 2.4; Rosales, Branch Points and Branch Cuts, section 1, printed pp. 3–8, and Example 2.4, printed p. 15; Rosales, section 1, Definition 1.1 and its clarifications; Rosales, section 1, equation 1.3, and Example 2.4.
A Guide to Complex Variables by Steven G. Krantz Created 2026-10-14 Updated 2026-11-05
By Steven G. Krantz.
Online text: www.math.wustl.edu/~sk/books/guide.pdf
Maximum Likelihood from Incomplete Data via the EM Algorithm by Arthur Pentland Dempster and others Created 2026-10-14 Updated 2026-11-05
Published in Journal of the Royal Statistical Society. Series B (Methodological), volume 39, number 1.
Online text: web.mit.edu/6.435/www/Dempster77.pdf
Joint article by Arthur Pentland Dempster, Nan M. Laird and Donald B. Rubin, printed with the byline A. P. Dempster, N. M. Laird and D. B. Rubin. Published in 1977 in Journal of the Royal Statistical Society, Series B, volume 39, number 1. The December 1976 presentation and later scan date are distinct from publication.
Cited passages: Section 1, printed pp. 1 and 3: naming of the two steps and earlier special cases; Section 2, printed p. 6, equation (2.17) and the general E-step/M-step definition; Section 2, printed p. 6: general maximization step; Section 3, printed pp. 6-7, Lemma 1 and Theorem 1, especially equation (3.10); Section 4.3, printed pp. 15-16, especially the paragraph following equation (4.3.3): conditional indicator probabilities and weighted counts.
Asymptotic Analysis and Singular Perturbation Theory by John K. Hunter Created 2026-10-14 Updated 2026-11-05
By John K. Hunter.
Online text: math.ucdavis.edu/~hunter/notes/asy.pdf
The title page credits John K. Hunter and is dated February 2004; copyright 2004 is stated separately. The university is his affiliation and the notes host, rather than an author. No first-publication or online revision date inferred.
Cited passages: §1.1.2, p. 2: regular and singular perturbations; §4.3.5, p. 58: uniform solution and overlap subtraction; §§4.3.3–4.3.4, pp. 57–58: inner expansion and matching.
The p-adic expansion of rational numbers by Keith Conrad Created 2026-10-14 Updated 2026-11-05
By Keith Conrad.
Standalone authored expository note. The inspected copy is undated; no publication date is inferred from the search engine or hosting path. It explicitly writes p-adic expansions with low-order terms first.
P-adic numbers by Jan-Hendrik Evertse Created 2026-10-14 Updated 2026-11-05
Authored notes dated March 2011. Their running header identifies Master Course Diophantine Equations, Spring 2011. The supplied UConn mirror is hosted within a different Fall 2011 course by Keith Conrad; hosting and teaching that course do not confer authorship of these notes. No publisher or original publication date is inferred.
Cited passages: §3, Theorem 3.4 and digit/congruence discussion, printed pp. 7–9: unique expansion and agreement of low-order digits; §3, printed pp. 6–7: definition of Zp, rational denominators and units.
Wie weet wie Willem Wijthoff was? by Robbert Fokkink Created 2026-10-14 Updated 2026-11-05
By Robbert Fokkink.
Cited passages: Robbert Fokkink, Wie weet wie Willem Wijthoff was?, Nieuw Archief voor Wiskunde 5/17(4), December 2016, printed p. 279, Wythoffs bewijs van de stelling van Mantel: attribution of problem 28 in 1907.
History of Catalan numbers by Igor Pak Created 2026-10-14 Updated 2026-11-05
By Igor Pak.
Online text: arxiv.org/pdf/1408.5711
Standalone historical preprint, arXiv:1408.5711. Version 1 was submitted on 25 August 2014; the inspected version 2 is dated 27 August 2014. Its cover says the account will appear as an appendix in a forthcoming book by Richard P. Stanley; the authorship here applies to this preprint, not to the whole book.
Bijective Proof Problems by Richard P. Stanley Created 2026-10-14 Updated 2026-11-05
Online text: math.mit.edu/~rstan/bij.pdf
Authored problem collection. The inspected cover is dated 18 August 2009; this identifies the supplied version rather than a book publication date. The Catalan interpretations occur in §5, printed pp. 38–39, Problems 153–159.
Cited passages: §5, Problem 154, printed p. 38: binary parenthesizations of n+1 letters; §5, printed pp. 38–39, formula (7) and Problems 154–159: Catalan counts, binary parenthesizations, binary trees and Dyck paths.
Introduction to Probability by Charles M. Grinstead and J. Laurie Snell Created 2026-10-14 Updated 2026-11-05
By Charles M. Grinstead and J. Laurie Snell.
Publisher of the underlying book: American Mathematical Society.
Online text: math.dartmouth.edu/~prob/prob/prob.pdf
The linked CHANCE Project version is dated 4 July 2006. Its cover identifies the underlying second-edition book as copyright 2003 by the two authors, and this version as copyright 2006 by Peter G. Doyle. The version credit does not identify Doyle as an original-book coauthor or formal editor. These dates describe copyrights and a version, rather than a claim about first publication.
Cited passages: §3.1, Example 3.3 and Table 3.1, printed pp. 77–78: uniform-calendar assumptions, distinct-label product and threshold.
Section 6.1, Definition 6.1, printed p. 226, defines finite discrete expectation by summing values weighted by their probabilities. This is the discrete calculation used in nonnegative random variable. Online text: math.dartmouth.edu/~prob/prob/prob.pdf .
On Orientations and Shortest Paths by Refael Hassin and others Created 2026-10-14 Updated 2026-11-05
Published in Linear Algebra and Its Applications 114/115, 589–602.
Online text: theory.stanford.edu/~megiddo/pdf/orientat.pdf
Cited passages: Hassin and Megiddo (1989), Theorem 2.6 proof, printed p. 592: cycle orientation and contraction, explicitly described as a different constructive proof from Robbins's; Hassin and Megiddo, On Orientations and Shortest Paths (1989), printed pp. 591–592: bridge-connectedness, strong connectivity and Theorem 2.6 (Robbins).
Euclid's Elements by Euclid Created 2026-10-14 Updated 2026-11-05
Original work by Euclid. The linked English adaptation and guide are by David E. Joyce, drawing on Thomas Little Heath and other translations. About the Text describes this adaptation; it is not unmodified Heath.
Perfect numbers and Mersenne primes by Keith Conrad Created 2026-10-14 Updated 2026-11-05
By Keith Conrad.
Inequalities by Godfrey Harold Hardy and others Created 2026-10-14 Updated 2026-11-05
Publisher: Cambridge University Press.
Online text: djvu.online/file/CjwWRpwExRE7j
Cited passages: Inequalities, second edition, §9.8(ii), truncation and integration by parts, printed pp. 242–243; Inequalities, second edition, §9.8, Theorem 327, equation (9.8.2), printed p. 240; Inequalities, second edition, §9.8, Theorem 327, printed p. 240, and sharpness argument on printed p. 243.
Two theorems in graph theory by Claude Berge Created 2026-10-14 Updated 2026-11-05
By Claude Berge.
Publisher: National Academy of Sciences.
Publication information: pubmed.ncbi.nlm.nih.gov/16590096/
Published in Proceedings of the National Academy of Sciences of the United States of America.
Cited passages: Claude Berge, Two theorems in graph theory, printed p. 842: finite unoriented graph and Problem 3; printed p. 843, Theorem 1: maximum matching and absence of an alternating chain between neutral points.
On the sums of series of reciprocals by Leonhard Euler Created 2026-10-14 Updated 2026-11-05
Presented to the St Petersburg Academy on 5 December 1735. Published as "De summis serierum reciprocarum" in Commentarii academiae scientiarum Petropolitanae 7 (1740), pp. 123–134. The linked translation is arXiv version 2, dated 5 February 2008.
Online text: arxiv.org/pdf/math/0506415
Curves and Surfaces in Geometric Modeling: Theory and Algorithms by Jean Gallier Created 2026-10-14 Updated 2026-11-05
By Jean Gallier.
Online text: www.cis.upenn.edu/~jean/geomcs-v2.pdf
Regression towards mediocrity in hereditary stature by Francis Galton Created 2026-10-14 Updated 2026-11-05
By Francis Galton.
Published in Journal of the Anthropological Institute of Great Britain and Ireland, volume 15, pp. 246-263.
246B, Notes 1: Zeroes, poles, and factorisation of meromorphic functions by Terence Tao Created 2026-10-14 Updated 2026-11-05
By Terence Tao.
Course context: 246B, complex analysis. These notes were posted on 23 December 2020.
Online text: terrytao.wordpress.com/2020/12/23/246b-notes-1-zeroes-poles-and-factorisation-of-meromorphic-functions/
Cited passages: §1, Theorem 2 and equation (6): neighbourhood of the closed disk, zeros counted with multiplicity, holomorphic special case.
There are unlisted articles, also show them or only show them.