History#
A chronology of the foundational results behind each subpackage, each one linked back to the corresponding implementation in the code.
Foundations
Cyclic/permutation groups, subgroups and cosets, finite fields, and polynomial ring arithmetic.
Counting and generation, Pascal’s triangle, integer partitions, inclusion-exclusion, and Stirling/Catalan/Bell numbers.
Modular arithmetic, primality testing, the Chinese Remainder Theorem, continued fractions, and Diophantine equations.
Analysis
Numerical differentiation/integration, forward- and reverse-mode automatic differentiation, and Taylor series.
Root finding with convergence-order verification, polynomial interpolation, and least-squares regression.
Gamma/beta functions, Bessel functions, orthogonal polynomial families, and the discrete Fourier transform.
Linear Algebra & Optimization
LU/QR/Cholesky decompositions, eigenvalue algorithms, SVD, iterative Krylov solvers, and least-squares stability.
Gradient descent, nonlinear conjugate gradient, Newton/BFGS, constrained optimization, and linear programming.
Geometry & Graphs
Convex hull, Delaunay triangulation/Voronoi diagrams, segment intersection/point-in-polygon, and the Frenet-Serret frame.
Shortest paths, minimum spanning trees, maximum flow/minimum cut, graph coloring, and spectral graph theory.
Dynamics & Chaos
Lyapunov exponents, fractal dimension, Mandelbrot/Julia sets, iterated function systems, and cellular automata.
Fixed-point stability, phase portraits, bifurcation normal forms, limit cycles, and Poincare sections.
Probability & Statistics
Discrete/continuous distributions, Monte Carlo integration, limit theorems, and Markov chains.
Descriptive statistics, hypothesis tests, confidence intervals, OLS regression, and bootstrap resampling.