Subcategories
All entries in Mathematics
French mathematician whose work helped establish rigorous calculus and the foundations of complex analysis.
augustin-louis-cauchyAugustus De MorganAugustus De Morgan was a British mathematician, logician, and educator whose work helped establish modern symbolic logic and the study of relations.
augustus-de-morganAutocorrelationAutocorrelation measures the association between a process or signal and a shifted version of itself, revealing persistence, oscillation, and dependence across lags.
autocorrelationAutocorrelation FunctionThe autocorrelation function measures dependence between a process or signal and a time-shifted version of itself, linking temporal structure to frequency content.
autocorrelation-functionAutomatic DifferentiationAutomatic differentiation computes derivatives of numerical programs by propagating local derivative rules through their operations.
automatic-differentiationAutomorphismAn automorphism is an invertible transformation of a mathematical object that preserves its specified structure, expressing a symmetry of that object.
automorphismAutoregressive ModelA statistical model that represents a variable through its previous values, with extensions to multivariate time series and sequential generative modeling.
autoregressive-modelAverage Treatment EffectThe average treatment effect is the expected difference between outcomes under two interventions for a specified population.
average-treatment-effectAxial VectorAn axial vector, or pseudovector, transforms like an ordinary vector under rotations but acquires an additional sign under orientation-reversing orthogonal transformations.
axial-vectorAxiomAn axiom is a statement accepted as a starting assumption within a theory, from which other statements are derived using rules of inference.
axiomAxiom of ChoiceThe axiom of choice asserts that every set-indexed family of nonempty sets admits a function selecting one element from each member.
axiom-of-choiceAxiom SchemaAn axiom schema is a formal template specifying a family of axioms through permitted substitutions, often providing a finite description of infinitely many statements.
axiom-schemaBack SubstitutionBack substitution solves an upper triangular system of linear equations by determining unknowns successively from the last equation upward.
back-substitutionBack-door criterionThe back-door criterion is a graphical condition that identifies covariate sets sufficient to estimate a causal effect by adjustment for confounding.
back-door-criterionBackward InductionBackward induction solves sequential decision problems by determining optimal choices at the end and working backward to earlier decisions.
backward-inductionBaire Category TheoremThe Baire category theorem states that countable intersections of dense open sets are dense in complete metric spaces and locally compact Hausdorff spaces.
baire-category-theoremBaker–Campbell–Hausdorff FormulaThe Baker–Campbell–Hausdorff formula expresses the logarithm of a product of exponentials as a series of nested commutators.
baker-campbell-hausdorff-formulaBanach Fixed-Point TheoremThe Banach fixed-point theorem guarantees a unique fixed point for a contraction on a nonempty complete metric space and provides an iterative method with explicit error bounds.
banach-fixed-point-theoremBanach spaceA Banach space is a normed vector space in which every Cauchy sequence converges to an element of the space.
banach-spaceBanach–Tarski ParadoxThe Banach–Tarski paradox states that a solid ball can be partitioned into finitely many sets and reassembled by rigid motions into two copies of itself.
banach-tarski-paradoxBar ChartA bar chart represents values for distinct categories using rectangular bars whose lengths are proportional to those values.
bar-chartBarber ParadoxThe barber paradox describes a barber who shaves exactly those people who do not shave themselves, yielding a contradiction when the rule is applied to the barber.
barber-paradoxBasel ProblemThe Basel problem asks for the exact sum of the reciprocals of the positive integer squares, which Euler showed equals π²/6.
basel-problemBasis (linear algebra)A basis is a linearly independent spanning set of a vector space, giving each vector a unique representation as a finite linear combination.
basis-linear-algebraBasis (topology)A basis is a collection of open sets whose arbitrary unions constitute every open set of a topological space.
basis-topologyBayes FactorA Bayes factor compares the marginal likelihoods of two statistical models, measuring how observed data change their relative support.
bayes-factorBayes' TheoremBayes’ theorem relates conditional probabilities and provides the mathematical basis for updating probabilities in light of evidence.
bayes-theoremBayesian GameA Bayesian game models strategic interaction in which players have incomplete information and choose actions using beliefs about privately known characteristics.
bayesian-gameBayesian inferenceBayesian inference updates probability distributions for unknown quantities by combining prior information with observed data through Bayes’ theorem.
bayesian-inferenceBayesian Information CriterionThe Bayesian information criterion compares statistical models by balancing maximized likelihood against a sample-size-dependent penalty for model complexity.
bayesian-information-criterionBayesian networkA Bayesian network represents a joint probability distribution through a directed acyclic graph and local conditional distributions, enabling reasoning under uncertainty.
bayesian-networkBayesian OptimizationBayesian optimization uses probabilistic models and sequential decision rules to optimize expensive, uncertain black-box functions with relatively few evaluations.
bayesian-optimizationBell NumberA Bell number counts the ways to partition a finite set into nonempty, unordered blocks, forming a fundamental sequence in combinatorics.
bell-numberBellman EquationA recursive equation relating a decision problem’s value to immediate rewards or costs and the value of subsequent states.
bellman-equationBernhard RiemannGerman mathematician whose work transformed geometry, complex analysis, integration, and the study of prime numbers.
bernhard-riemannBernoulli DistributionA discrete probability distribution describing a single binary outcome, with probability p of taking the value 1 and probability 1 − p of taking the value 0.
bernoulli-distributionBernoulli NumbersBernoulli numbers are rational coefficients that connect sums of powers, series expansions, numerical summation, and special values of the Riemann zeta function.
bernoulli-numbersBessel’s CorrectionBessel’s correction replaces n with n−1 in sample variance calculations to obtain an unbiased estimator of population variance when the mean is estimated from the same sample.
bessels-correctionBeta DistributionA flexible family of continuous probability distributions on the unit interval, widely used to model proportions and uncertainty about probabilities.
beta-distributionBeta FunctionThe beta function is a two-variable special function defined by an Euler integral, related to the gamma function and central to beta distributions and incomplete beta integrals.
beta-functionBézout's IdentityBézout's identity expresses the greatest common divisor of integers as an integer linear combination of them, connecting divisibility, Diophantine equations, and modular inverses.
bezouts-identityBias of an EstimatorThe bias of an estimator is the difference between its expected value under repeated sampling and the parameter it estimates.
estimator-biasBias–variance tradeoffThe bias–variance tradeoff describes how systematic prediction error and sensitivity to training data jointly affect a model’s expected performance on unseen observations.
bias-variance-tradeoffBifurcationA bifurcation is a qualitative change in a mathematical system’s behavior or solution structure as one or more parameters vary.
bifurcationBig-O NotationBig-O notation expresses an asymptotic upper bound on a function, widely used to describe algorithmic resource requirements and mathematical approximation errors.
big-o-notationBijective FunctionA bijective function pairs every element of its domain with exactly one element of its codomain, and has a unique inverse function.
bijective-functionBinary integer programmingBinary integer programming optimizes decisions represented by variables restricted to zero or one, typically under linear constraints and a linear objective.
binary-integer-programmingBinary NumberA binary number expresses a numerical value using base-two positional notation, with the digits 0 and 1.
binary-numberBinary RelationA binary relation is a set of ordered pairs specifying which elements of one set are related to elements of another.
binary-relationBinomial CoefficientA binomial coefficient counts unordered selections of a fixed size from a set and gives a coefficient in the expansion of a binomial power.
binomial-coefficientBinomial DistributionThe binomial distribution describes the number of successes in a fixed number of independent trials with the same success probability.
binomial-distributionBinomial TheoremThe binomial theorem expresses a nonnegative integer power of a sum as a finite expansion with binomial coefficients, and extends to infinite series for more general exponents.
binomial-theoremBirth–Death ProcessA birth–death process is a continuous-time Markov model on nonnegative integers whose jumps increase or decrease the state by one, used to describe populations, queues, and other count-valued systems.
birth-death-processBisection MethodThe bisection method locates a zero of a continuous real-valued function by repeatedly halving an interval whose endpoints have opposite function signs.
bisection-methodBlaise PascalBlaise Pascal was a French mathematician, experimental scientist, inventor, and religious writer whose work helped establish probability theory and shaped modern philosophical literature.
blaise-pascalBlindingBlinding restricts access to study information to reduce biases in treatment, measurement, analysis, and interpretation.
blindingBolzano–Weierstrass theoremThe Bolzano–Weierstrass theorem states that every bounded sequence in finite-dimensional Euclidean space has a convergent subsequence.
bolzano-weierstrass-theoremBonferroni CorrectionA multiple-testing procedure that controls the probability of at least one false rejection by dividing the overall significance level among tests.
bonferroni-correctionBoolean AlgebraBoolean algebra studies operations on truth values and complemented distributive structures, providing a mathematical foundation for classical logic and digital circuits.
boolean-algebraBoolean FunctionA Boolean function maps binary inputs to a binary output and provides a mathematical foundation for logic, digital computation, complexity theory, and cryptography.
boolean-function