Thomas algorithm (NPTEL Lecture 13) Created 2026-10-13 Updated 2026-11-05
Publisher: NPTEL.
Cited passages: Lecture 13, Thomas algorithm: opening historical attribution and Crank Nicolson motivation.
DGTSV (LAPACK 3.12.1) by LAPACK project Created 2026-10-13 Updated 2026-11-05
Publisher: LAPACK project (Netlib hosting).
This source is credited to an organization.
Cited passages: DGTSV, LAPACK 3.12.1, Fortran lines 175–180: multiplier and two updates without row interchange; DGTSV, Purpose lines 34–39; DL argument lines 63–69; adjacent interchange lines 188–199; back solve lines 295–305.
Kurtosis as Peakedness, 1905 – 2014. R.I.P. by Peter H. Westfall Created 2026-10-13 Updated 2026-11-05
Cited passages: §2, Terminology, definition of κ; §4, counterexamples with different peaks; §5, central and tail contributions; §5, Why Tails Mostly Determine Kurtosis, inequality (1) and following fixed-h argument.
Geometry of Surfaces by Nigel Hitchin (B3a course 2013) Created 2026-10-13 Updated 2026-11-05
Cited passages: Section 3.2, Theorem 3.2 and its triangulation proof, printed pp. 38-39; Section 3.3, printed pp. 41-43: local coordinates at simple roots, two points at infinity for even polynomial degree, and ramification count.
Riemann Surfaces by Constantin Teleman (Lent Term 2003) Created 2026-10-13 Updated 2026-11-05
Cited passages: Lecture 5, Definition 5.16, printed p. 19: total branching index as the sum of fibre deficits; Lecture 5, Theorems 5.1 and 5.3; Definition 5.16 and Theorem 5.17, printed pp. 16-19.
Publisher: Cambridge University Press.
Cited passages: Modern Robotics, §3.2.1, definition 3.1 and propositions 3.3–3.6, preprint pp. 67–69; Modern Robotics, §3.2.1.1, propositions 3.4–3.5, preprint p. 69: closure and the distinction between planar and spatial composition; Modern Robotics, §3.2.1.2, preprint p. 69: three uses of a rotation matrix; Modern Robotics, §3.2.1.2, preprint pp. 72–73: premultiplication uses fixed-frame axes; postmultiplication uses body-frame axes.
Author video supplement: modernrobotics.northwestern.edu/nu-gm-book-resource/4-1-1-product-of-exponentials-formula-in-the-space-frame/ . Section4.1.1 develops forward kinematics and the end-effector frame through the product-of-exponentials representation.
Author video supplement: modernrobotics.northwestern.edu/nu-gm-book-resource/3-4-wrenches/ . Section 3.4, Wrenches, transcript: six-vector moment/force representation, changes of reference frame, and the frame-independent power pairing of a wrench with a rigid-body twist.
Additional author video supplement: modernrobotics.northwestern.edu/nu-gm-book-resource/3-3-2-twists-part-1-of-2/ . Section 3.3.2, Twists (Part 1 of 2), defines the ordered angular/linear six-vector, origin dependence of its linear component, normalized screw axis and pitch, and the distinct body/space reference-frame representations. The wiki's numerical twist example and velocity-field derivation are independent calculations.
§3.2.3, Exponential Coordinates of Rotation, Part 2: unit-axis rotation, matrix exponential and Rodrigues formula. The axis-direction uncertainty bound in the current article is derived explicitly rather than attributed to this source.
Published in Mathematical Programming, Series B, 69(1), 205–236.
Cited passages: Publication record and authored abstract: A Primal-Dual Potential Reduction Method for Problems Involving Matrix Inequalities, Mathematical Programming, Series B, 69(1), 205–236 (1995).
Publisher: Cambridge University Press.
Cited passages: Applied Stochastic Differential Equations, Example 6.2, printed p. 81, equations (6.27)–(6.30); centered model with diffusion constant q; Applied Stochastic Differential Equations, Example 6.8, printed pp. 91–92, equations (6.73)–(6.76): steady-state variance and covariance.
Published in Physical Review, volume 36, issue 5, starting p. 823.
Cited passages: On the Theory of the Brownian Motion, abstract: velocity minus its decaying initial contribution; friction coefficient divided by mass.
DROT (Reference BLAS, LAPACK 3.12.1) by LAPACK project Created 2026-10-13 Updated 2026-11-05
Publisher: LAPACK project (Netlib hosting).
This source is credited to an organization.
Cited passages: DROT source, lines 116–120 and 130–134: temporary first-row value and second-row update.
DLARTG (LAPACK 3.12.1) by Edward Anderson Created 2026-10-13 Updated 2026-11-05
Publisher: LAPACK project (Netlib hosting).
Cited passages: DLARTG, LAPACK 3.12.1, Purpose: block, signed R, scaling and zero-input cases; implementation lines 137–159.
Quadratic Reciprocity by Ben Lynn Created 2026-10-13 Updated 2026-11-05
Publisher: Ben Lynn (hosted on Stanford Applied Cryptography site).
Cited passages: Ben Lynn, Quadratic Reciprocity, first theorem and proof of the Law of Quadratic Reciprocity: floor-sum parity and the separating-line count; Ben Lynn, Quadratic Reciprocity, “The Jacobi Symbol”: product definition and reciprocity for computing symbols without factoring.
Mathematics for Computer Science by Eric Lehman and others Created 2026-10-13 Updated 2026-11-05
Publisher: MIT OpenCourseWare (official distribution).
The inspected online textbook is dated 18 May 2015; this is a version date, rather than a claim about first publication.
Cited passages: Lehman, Leighton and Meyer, Mathematics for Computer Science, Definition 11.7.1; Lehman, Leighton and Meyer, Mathematics for Computer Science, §11.8.1: cycles and backtracking; Lehman, Leighton and Meyer, Mathematics for Computer Science, §11.8.1: length-zero convention; Lehman, Leighton and Meyer, Mathematics for Computer Science, §§9.2 and 11.8.1: closed walks; Mathematics for Computer Science, §12.4, Lemma 12.4.1, printed p. 485; Mathematics for Computer Science, §12.4, Lemma 12.4.2 and Theorem 12.4.3, printed pp. 485–486; Mathematics for Computer Science, §12.5, Lemma 12.5.2 and Theorem 12.5.3, printed pp. 486–487.
Additional cited passages in the 18 May 2015 revision: §5.2.1, printed p. 125; §5.2.2, printed pp. 125–126; §5.3, printed pp. 129–130. The title page credits the same three whole-book authors; the date is a revision/version date.
Publisher: MIT OpenCourseWare.
Lecture 5f of MIT 6.042J and 18.062J, Mathematics for Computer Science, dated 7 October 2005. Authorship is credited to this slide deck, rather than to every resource in the course.
Cited passages: Planar Graphs; Bipartite Matching, slide lec 5f.6, including the outer face; Planar Graphs; Bipartite Matching, slides lec 5f.14–5f.15; Planar Graphs; Bipartite Matching, slides lec 5f.3 and 5f.12.
18.357 Interfacial Phenomena lecture notes (Fall 2010) Created 2026-10-13 Updated 2026-11-05
Publisher: MIT OpenCourseWare.
Fall 2010 identifies the course offering. The cover is dated 3 June 2013, without identifying that date as a publication or revision date.
Cited passages: 18.357 Interfacial Phenomena, §2.6, pp. 9–10: drop pressure and the two-interface soap-bubble factor; §2.4, p. 7, equations (2.3)–(2.4): normal and tangential interfacial stress balances.
A Concise Course in Algebraic Topology by J. P. May Created 2026-10-13 Updated 2026-11-05
Publisher: University of Chicago Press.
Cited passages: A Concise Course in Algebraic Topology, Chapter 13, §5, p. 103, Example (i), the torus cellular chains and integral homology.
Algebraic Topology by Allen Hatcher Created 2026-10-13 Updated 2026-11-05
Publisher: Cambridge University Press.
The inspected PDF carries copyright 2002; the publisher front matter separately records first publication in 2001 and a fourteenth printing in 2015.
Cited passages: Algebraic Topology, §2.2, p. 146, definition of Euler characteristic and Theorem 2.44; Algebraic Topology, §2.2, p. 146, homotopy-type independence immediately before Theorem 2.44.
Additional cited passages: §2.2, Example 2.42, p. 144; Euler characteristic and Theorem 2.44, pp. 146–147. These are chapter locators in Algebraic Topology by Allen Hatcher.
Lecture notes on metric embeddings by Jiří Matoušek Created 2026-10-13 Updated 2026-11-05
Linked version dated 1 January 2013.
Cited passages: Jiří Matoušek, Lecture notes on metric embeddings, preface and Section 1.1; Lecture notes on metric embeddings, §2.1(b), p. 21, and Lemma 2.3.1, p. 24: independent Gaussian coefficients and normalization; Lecture notes on metric embeddings, §2.1, pp. 20–21, and proof of Lemma 2.3.1, pp. 25–26: fixed-vector concentration and union bound over pair differences; Matoušek, Section 1.1: distortion and Lipschitz maps.
Publisher: Wiley Periodicals, Inc.
Published in Random Structures & Algorithms.
Cited passages: An elementary proof of a theorem of Johnson and Lindenstrauss, Theorem 2.1, p. 61: bounds for squared distances.

There are unlisted articles, also show them or only show them.