Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Author of work on rational decisions under uncertainty. The cited article connects probability judgments with decision criteria, providing a historical source for evaluating probabilistic forecasts through their consequences.[ref]
Rational Decisions by I. J. Good. author attribution and the named work’s subject
Coauthor with Adrian Raftery of research on proper scoring rules for probabilistic forecasts. A proper rule rewards reporting the forecaster's actual probability distribution in expectation, connecting forecast evaluation with statistical estimation.[ref]
Strictly Proper Scoring Rules, Prediction, and Estimation by Tilmann Gneiting and others. author attribution and the named work’s subject
Ana Cannas da Silva authored an exposition of symplectic geometry. A nondegenerate closed two-form organizes phase-space geometry and Hamiltonian motion, giving a geometric framework shared by mechanics and global mathematical questions.[ref]
Symplectic Geometry. author attribution and the described mathematical development
Portrait of Ana Cannas da Silva
. George M. Bergman; Berkeley, 1996; current high-resolution scan uploaded by George Ho. CC BY-SA 4.0, via Wikimedia Commons. Source.Coauthor of notes on primitive lambda-roots, investigating generators of maximal-order behavior in multiplicative residue groups. Initials are retained from the credited source rather than expanded without independent verification.[ref]
Notes on primitive lambda-roots by Peter J. Cameron and others. author attribution and the named work’s subject
Author of mathematical teaching notes, including treatments of Wilson's theorem and Fermat's little theorem. These results connect prime moduli with multiplicative identities in modular arithmetic.[ref]
Wilson's Theorem and Fermat's Theorem by Bruce Ikenaga. author attribution and the named work’s subject
Author of numerical analysis teaching notes, including power iteration. The notes connect an iterative eigenvector calculation with the spectral properties governing its convergence.[ref]
Power iteration (2022-03-07 lecture notes). author attribution and the named work’s subject
A credited contributor to numerical eigenvalue computation material, including the power method. The method studies how repeated multiplication amplifies the component associated with a dominant eigenvalue.[ref]
Power Method. author attribution and the named work’s subject
Rick Durrett authored a graduate probability text connecting examples with rigorous limit theorems and stochastic-process arguments. Conditional expectation, convergence and martingales form reusable tools across the models it studies.[ref]
Probability: Theory and Examples (fifth edition) by Rick Durrett. author attribution and the described mathematical development
Portrait of Rick Durrett
. Source: author's institutional homepage.Scott Sheffield authored probability teaching material on conditional expectation, random walks and martingales. Conditional expectation supplies the common language for predictions given partial information and for processes whose current state is the best conditional prediction of a later value.[ref]
18.175 Lecture 16: Conditional expectation, random walks, martingales by Scott Sheffield. author attribution and the described mathematical development
Portrait of Scott Sheffield
. Via Wikimedia Commons; credits and usage information are on the linked source file page. Source.Author of expository notes on coding theory and number theory, including symbol codes and quadratic reciprocity. The notes connect explicit algorithms and examples with their algebraic justification.[ref]
Symbol Codes by Ben Lynn. author attribution and the named work’s subject
Introduced the construction now called Huffman coding in a 1952 paper on minimum-redundancy codes. Repeatedly combining the least frequent symbols produces an optimal binary prefix code for the specified symbol probabilities.[ref]
A Method for the Construction of Minimum-Redundancy Codes by David A. Huffman. author attribution and the named work’s subject
Author of a computational introduction to number theory and algebra. The text develops the mathematical background alongside algorithms, making arithmetic structure and computational cost part of the same account.[ref]
A Computational Introduction to Number Theory and Algebra by Victor Shoup. author attribution and the named work’s subject
Author of notes on Newton's identities, which relate polynomial coefficients, elementary symmetric polynomials and power sums of roots. The source is attributed as printed, without inferring an appointment or biography from its hosting institution.[ref]
Newton's Identities (January 2019 notes) by Milan Mossé. author attribution and the named work’s subject
Author of teaching material on computational algebra, including rational univariate representation. This approach encodes a finite polynomial-system solution set using one univariate equation and rational coordinate expressions.[ref]
Rational Univariate Representation (Lecture 12) by Jan Verschelde. author attribution and the named work’s subject
Author of probability inequalities for sums of bounded independent random variables. The resulting Hoeffding inequality bounds tail probabilities without requiring an exact distribution for the sum, making it useful in concentration of measure.[ref]
Probability Inequalities for Sums of Bounded Random Variables by Wassily Hoeffding. author attribution and the named work’s subject
John Duchi authored notes deriving Hoeffding-type concentration bounds. Controlling a moment-generating function converts bounded independent observations into a quantitative tail bound, useful when exact sampling distributions are unavailable.[ref]
Hoeffding’s inequality. author attribution and the described mathematical development
Portrait of John Duchi
. External portrait hosted by Stanford University Department of Statistics. Source.Coauthor with Tobin A. Driscoll of a textbook in numerical analysis. Its examples connect numerical algorithms with error estimates, problem conditioning and stability.[ref]
Fundamentals of Numerical Computation by Tobin A. Driscoll and others. author attribution and the named work’s subject
Coauthor with Richard J. Braun of a textbook in numerical analysis. It develops computational methods together with conditioning, approximation error and stability, so an algorithm is judged by the reliability of its result as well as its speed.[ref]
Fundamentals of Numerical Computation by Tobin A. Driscoll and others. author attribution and the named work’s subject
Nico M. Temme studies the asymptotic analysis and numerical methods for evaluating of special functions. His work includes asymptotic expansions for integrals and computational methods for functions such as the error function. The NIST Digital Library of Mathematical Functions credits him with chapters on numerical methods and several special function families.[ref]
Homepage: dlmf.nist.gov/about/bio/NMTemme
Portrait of Nico M. Temme
. Photograph identified on the NIST DLMF profile.Author of graph theory lecture notes developing multigraphs, directed graphs and traversal results. The cited lecture makes conventions about isolated vertices and trivial trails explicit.[ref]
Math 530 Spring 2023, Lecture 6: Multigraphs and digraphs. author attribution and the named work’s subject
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.
Figure 3. Visual Studio Code extension installation.
Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. 
- Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact