Mathematics Library

Texts and lecture notes, from first courses to research. Free to read is selected by default. Browse subject cards · Reading paths · Essays & popular mathematics

419 results · page 15 of 17

Partial Differential Equations and Monge–Kantorovich Mass Transfer

Optimal transport for quadratic and distance costs is connected to duality, Monge–Ampère regularity, nonlinear diffusion and sandpile models.

Read PDF Official source
Details and sources

Partial Differential Equations and Monge–Kantorovich Mass Transfer

Lawrence C. Evans · Survey · Research · English

PDF

The complete 59-page text opened at math.berkeley.edu.

Optimal transport for quadratic and distance costs is connected to duality, Monge–Ampère regularity, nonlinear diffusion and sandpile models.

Preparation: Measure theory, convex analysis and graduate PDE.

Use: Explore the bridge from transport of measures to variational and evolution PDE.

Version: September 2001 version of a survey first published in 1997 · Checked 2026-10-13

Perfectoid Spaces

Introduces perfectoid spaces and tilting. This is the foundational paper, not an elementary textbook.

Read PDF Official source
Details and sources

Perfectoid Spaces

Peter Scholze · Foundational research paper · Research · English

PDF

Introduces perfectoid spaces and tilting. This is the foundational paper, not an elementary textbook.

Preparation: Rigid geometry; valuation theory; étale cohomology.

Use: Read after a course in p-adic geometry.

Version: 2011 / published 2012; latest version on arXiv · Checked 2026-10-11

Physics, Topology, Logic and Computation: A Rosetta Stone

Uses monoidal categories and diagrams to connect processes, cobordisms, proofs and programs.

Read PDF Official source
Details and sources

Physics, Topology, Logic and Computation: A Rosetta Stone

John C. Baez and Mike Stay · Expository survey · Intermediate · English

PDF

Free PDF at the author or authorized archive.

Uses monoidal categories and diagrams to connect processes, cobordisms, proofs and programs.

Preparation: Linear algebra; readiness to learn categorical notation.

Use: Explore a technical but explanatory bridge between four fields.

Version: arXiv v3, June 2009; published 2011 · Checked 2026-10-13

Prisms and Prismatic Cohomology

Introduces prisms and a cohomology theory connecting several integral p-adic theories.

Read PDF Official source
Details and sources

Prisms and Prismatic Cohomology

Bhargav Bhatt and Peter Scholze · Foundational research paper · Research · English

PDF

Introduces prisms and a cohomology theory connecting several integral p-adic theories.

Preparation: Commutative algebra; p-adic Hodge theory; derived methods.

Use: Foundational research reading, not a first textbook.

Version: 2019 / Annals 2022; latest version on arXiv · Checked 2026-10-11

Probabilistic Methods in Combinatorics

A full graduate course on random constructions, moments, alterations and probabilistic combinatorial arguments.

Read PDF Official source
Details and sources

Probabilistic Methods in Combinatorics

Yufei Zhao · Lecture notes · Graduate · English

PDF

The complete lecture-note PDF opens publicly from the author’s MIT course resource page.

A full graduate course on random constructions, moments, alterations and probabilistic combinatorial arguments.

Preparation: Probability; graph theory; proof-based combinatorics.

Use: Learn research tools for existence and extremal problems.

Version: MIT 18.226, Fall 2022; updated June 18, 2024 · Checked 2026-10-13

Probability

A first course covering counting, conditional probability, distributions, random walks, branching and limit laws.

Read PDF Official source
Details and sources

Probability

Richard Weber · Lecture notes · Introductory · English

PDF

The complete PDF opens publicly from the author’s university resource page.

A first course covering counting, conditional probability, distributions, random walks, branching and limit laws.

Preparation: Elementary calculus; algebra; basic proof-writing.

Use: Beginner bridge to stochastic processes and graduate probability.

Version: Cambridge, Lent Term 2014 · Checked 2026-10-13

Probability and Mathematical Statistics 概率与数理统计

A one-semester applied undergraduate course covering random variables, common distributions, limit theorems, estimation, testing and regression. It is not a substitute for a measure-theoretic probability course.

Read online
Details and sources

Probability and Mathematical Statistics

唐聿劼 (Yujie Tang) · Course notes · Introductory · Chinese

Online text

Online lecture text; chapters can be read separately.

Original title: 概率与数理统计

A one-semester applied undergraduate course covering random variables, common distributions, limit theorems, estimation, testing and regression. It is not a substitute for a measure-theoretic probability course.

Preparation: Single-variable calculus and elementary linear algebra.

Use: Start with the probability chapters; continue to statistical inference after expectations and limit laws.

Version: Fall 2024–2025 undergraduate course · Checked 2026-11-03

Probability on Trees and Networks

Develops random walks, electrical networks, percolation and trees.

Read online
Details and sources

Probability on Trees and Networks

Russell Lyons and Yuval Peres · Textbook · Graduate · English

Online text

Develops random walks, electrical networks, percolation and trees.

Preparation: Probability; graph theory; some measure theory.

Use: Study the interface of probability and discrete geometry.

Version: 2016; author page supplies full PDF · Checked 2026-10-11

Probability Theory: STAT310/MATH230

Graduate course notes for measure-theoretic probability. More concise than a first undergraduate textbook; readers should work through proofs rather than rely only on examples.

Read PDF Official source
Details and sources

Probability Theory: STAT310/MATH230

Amir Dembo · Course notes · Advanced · English (legacy metadata)

PDF

Graduate course notes for measure-theoretic probability. More concise than a first undergraduate textbook; readers should work through proofs rather than rely only on examples.

Preparation: Real analysis; measure theory.

Legacy entry retained from October 8, 2026

Probability: Theory and Examples

Develops probability through limit theorems, martingales, Markov processes and examples.

Read PDF Official source
Details and sources

Probability: Theory and Examples

Rick Durrett · Textbook · Graduate · English

PDF

Develops probability through limit theorems, martingales, Markov processes and examples.

Preparation: Measure theory; real analysis.

Use: Core graduate probability study.

Version: Fifth edition author manuscript, January 11, 2019 · Checked 2026-10-11

Proofs and Concepts: The Fundamentals of Abstract Mathematics

A bridge course connecting elementary logic with sets, functions, equivalence relations, induction and cardinality.

Read PDF Official source
Details and sources

Proofs and Concepts: The Fundamentals of Abstract Mathematics

Dave Witte Morris and Joy Morris, incorporating material by P. D. Magnus · Textbook · Introductory · English

PDF

Author's Deductive Press page links the full 195-page PDF under CC BY-NC-SA 2.0.

A bridge course connecting elementary logic with sets, functions, equivalence relations, induction and cardinality.

Preparation: School algebra; basic mathematical notation.

Use: Practice complete arguments before entering proof-based algebra and analysis.

Version: Preliminary version 0.95, January 2025 · Checked 2026-10-13

Proper Equivariant Stable Homotopy Theory

Constructs equivariant spectra and cohomology theories for proper Lie-group actions, with compact isotropy and applications to infinite discrete groups.

Read PDF Official source
Details and sources

Proper Equivariant Stable Homotopy Theory

Dieter Degrijse, Markus Hausmann, Wolfgang Lück, Irakli Patchkoria and Stefan Schwede · Research monograph · Research · English

PDF

The complete author-deposited preprint opens in arXiv.

Constructs equivariant spectra and cohomology theories for proper Lie-group actions, with compact isotropy and applications to infinite discrete groups.

Preparation: Stable homotopy theory; equivariant topology; model categories.

Use: Continue from finite-group equivariant courses to proper actions and equivariant K-theory.

Version: arXiv v2, October 14, 2020 · Checked 2026-10-13

Pseudocoherent and Perfect Complexes and Vector Bundles on Analytic Adic Spaces

Uses condensed analytic rings to study descent for pseudocoherent and perfect complexes and vector bundles on analytic adic spaces.

Read PDF Official source
Details and sources

Pseudocoherent and Perfect Complexes and Vector Bundles on Analytic Adic Spaces

Grigory Andreychev · Research paper · Research · English

PDF

Public full text; checked against the title and contents.

Uses condensed analytic rings to study descent for pseudocoherent and perfect complexes and vector bundles on analytic adic spaces.

Preparation: Adic spaces; condensed mathematics; derived categories.

Use: Follow the analytic-ring construction before the descent applications to vector bundles.

Version: arXiv 2105.12591; inspected electronic version · Checked 2026-11-03

Found via — References: Pseudocoherent and Perfect Complexes and Vector Bundles on Analytic Adic Spaces

Random Trees and Applications

Connects conditioned Galton–Watson trees to Brownian excursions, continuum trees and the Brownian snake.

Read PDF Official source
Details and sources

Random Trees and Applications

Jean-François Le Gall · Research survey · Research · English

PDF

The complete PDF opens publicly from the author-submitted arXiv archive.

Connects conditioned Galton–Watson trees to Brownian excursions, continuum trees and the Brownian snake.

Preparation: Graduate probability; Brownian motion; branching processes.

Use: Bridge into scaling limits of random genealogical structures.

Version: arXiv v1, November 21, 2005; Probability Surveys 2 (2005) · Checked 2026-10-13

Random Walks on Graphs: A Survey

A survey connecting hitting, commute and cover times with graph eigenvalues, electrical networks and algorithmic applications.

Read PDF Official source
Details and sources

Random Walks on Graphs: A Survey

László Lovász · Survey · Intermediate · English

PDF

Public full text; checked against the title and contents.

A survey connecting hitting, commute and cover times with graph eigenvalues, electrical networks and algorithmic applications.

Preparation: Finite Markov chains; linear algebra; graphs.

Use: Read the basic parameters first, then the electrical-network and spectral interpretations.

Version: Yale technical-report version, 38 PDF pages · Checked 2026-11-03

Found via — References: Random Walks on Graphs: A Survey

Randomized Numerical Linear Algebra: Foundations & Algorithms

A substantial survey connecting random embeddings and matrix sampling to least squares, low-rank approximation and linear solvers.

Read PDF Official source
Details and sources

Randomized Numerical Linear Algebra: Foundations & Algorithms

Per-Gunnar Martinsson and Joel A. Tropp · Survey · Research · English

PDF

Full 116-page survey opened on coauthor Tropp's Caltech website.

A substantial survey connecting random embeddings and matrix sampling to least squares, low-rank approximation and linear solvers.

Preparation: Linear algebra, numerical matrix methods and elementary probability.

Use: Bridge a numerical linear algebra course to randomized algorithms and their analysis.

Version: arXiv version 3, March 15, 2021 · Checked 2026-10-13

Rational Points on Modular Elliptic Curves

Studies modularity, Heegner-point constructions and special L-values in the arithmetic of elliptic curves.

Read PDF Official source
Details and sources

Rational Points on Modular Elliptic Curves

Henri Darmon · Author-hosted monograph · Research · English

PDF

Full PDF opened publicly on the author or university host.

Studies modularity, Heegner-point constructions and special L-values in the arithmetic of elliptic curves.

Preparation: Elliptic curves; modular forms; algebraic number theory.

Use: Study the modular approach to rational-point constructions.

Version: Author-hosted manuscript of the 2004 CBMS monograph · Checked 2026-10-13

Recent Developments in Graph Ramsey Theory

Surveys asymptotic Ramsey numbers and variants, connecting random constructions and extremal techniques.

Read PDF Official source
Details and sources

Recent Developments in Graph Ramsey Theory

David Conlon, Jacob Fox and Benny Sudakov · Research survey · Research · English

PDF

The complete PDF opens publicly from the author’s university resource page.

Surveys asymptotic Ramsey numbers and variants, connecting random constructions and extremal techniques.

Preparation: Graph theory; probabilistic method; asymptotic estimates.

Use: Research orientation in graph and hypergraph Ramsey problems.

Version: Author-hosted notes; date not stated · Checked 2026-10-13

Recent Progress in Coalescent Theory

Coalescent processes, exchangeable partitions and links with random trees, spatial models and population genetics.

Read PDF Official source
Details and sources

Recent Progress in Coalescent Theory

Nathanaël Berestycki · Lecture notes · Research · English

PDF

The complete PDF opens publicly from the author-submitted arXiv archive.

Coalescent processes, exchangeable partitions and links with random trees, spatial models and population genetics.

Preparation: Graduate probability; Brownian motion; Poisson point processes.

Use: Enter coalescent and branching-process research.

Version: arXiv v1, September 22, 2009 · Checked 2026-10-13

Regularity of Higher Codimension Area Minimizing Integral Currents

A research course explains the architecture of partial regularity proofs using rectifiable currents, multivalued functions, center manifolds, frequency estimates and blow-up arguments.

Read PDF Official source
Details and sources

Regularity of Higher Codimension Area Minimizing Integral Currents

Emanuele Spadaro · Lecture notes · Research · English

PDF

The complete 53-page author-submitted manuscript opened on arXiv.

A research course explains the architecture of partial regularity proofs using rectifiable currents, multivalued functions, center manifolds, frequency estimates and blow-up arguments.

Preparation: Geometric measure theory, Sobolev spaces and calculus of variations.

Use: Move from measure-theoretic surfaces to singularity and regularity research; several technical results are explained through proof outlines.

Version: arXiv v1, January 15, 2015; expanded 2013 Pisa course · Checked 2026-10-13

Representations of Lie Groups

Graduate lectures on representations of noncompact semisimple Lie groups, beyond the introductory Lie-algebra sequence.

Read PDF Official source
Details and sources

Representations of Lie Groups

Pavel Etingof · Long lecture notes · Research · English

PDF

Graduate lectures on representations of noncompact semisimple Lie groups, beyond the introductory Lie-algebra sequence.

Preparation: Semisimple Lie algebras; representation theory; analysis.

Use: Enter the representation theory of real reductive groups.

Version: 2024 course manuscript; version 3 revised June 21, 2026 · Checked 2026-10-11

Science and Hypothesis

Discusses mathematical reasoning, geometry, hypotheses and physical theories from Poincaré’s historical viewpoint.

Read PDF Official source
Details and sources

Science and Hypothesis

Henri Poincaré; translated by W. J. Greenstreet · Mathematical philosophy / popular science · Intermediate · English

PDF

Complete English-translation PDF at Project Gutenberg.

Original title: La Science et l’Hypothèse

Discusses mathematical reasoning, geometry, hypotheses and physical theories from Poincaré’s historical viewpoint.

Preparation: Elementary mathematics; interest in scientific philosophy.

Use: Read an influential historical discussion of mathematical knowledge.

Version: 1905 English translation; Project Gutenberg PDF · Checked 2026-10-13

scl

Stable commutator length connects quasimorphisms, bounded cohomology and geometric group theory.

Read PDF Official source
Details and sources

scl

Danny Calegari · Research monograph · Research · English

PDF

The author page explicitly states publisher permission for the PDF; follow its terms.

Stable commutator length connects quasimorphisms, bounded cohomology and geometric group theory.

Preparation: Group theory; surfaces; basic topology.

Use: Research preparation in bounded cohomology and groups.

Version: MSJ Memoirs 20, 2009 · Checked 2026-10-11

Set Theory: An Open Introduction

Explains the set-theoretic foundations of mathematics and the motivation for ZFC. Its emphasis is conceptual and philosophical, not graduate forcing theory.

Read online
Details and sources

Set Theory: An Open Introduction

Tim Button · Textbook · Introductory · English (legacy metadata)

Online text

Explains the set-theoretic foundations of mathematics and the motivation for ZFC. Its emphasis is conceptual and philosophical, not graduate forcing theory.

Preparation: Basic logic and high-school mathematics.

Legacy entry retained from October 8, 2026

Sets, Logic, Computation

Develops completeness, compactness and undecidability after elementary formal logic. A structured bridge from proof systems to mathematical metatheory.

Read online
Details and sources

Sets, Logic, Computation

Richard Zach · Textbook · Intermediate · English (legacy metadata)

Online text

Develops completeness, compactness and undecidability after elementary formal logic. A structured bridge from proof systems to mathematical metatheory.

Preparation: Elementary first-order logic.

Legacy entry retained from October 8, 2026