Concepts
5,907Terms and methods explained by more than one lecturer. Each opens at the minute it is taught.
Mathematics
299- ConvolutionAn operation on two functions that produces a third function, representing the distribution of the sum of two independent random variables.
- Matrix multiplicationComputed by taking dot products between rows of the first matrix and columns of the second matrix.
- VarianceThe variance of a random variable is the expected value of the square of the deviation from its mean.
- JacobianThe Jacobian of a change of variables is the determinant of the matrix of partial derivatives of the new coordinates with respect to the old coordinates.
- EventA subset of the sample space.
- Geometric seriesA series of the form where is a constant.
- NodeA place where at least two edges meet.
- Triangle inequalityThe absolute value of the sum of two real numbers is less than or equal to the sum of their absolute values.
- Integration by partsA technique for integrating products of functions based on the product rule for differentiation.
- Linear programmingOptimization problem with a linear objective function subject to linear inequality and equality constraints.
- RankThe rank of a matrix is the dimension of its column space, equal to the number of independent columns.
- Random variableA function from the sample space to the real numbers.
- Vector fieldA field that assigns a vector to every point in space.
- Fixed pointPoints where the state derivative is zero, meaning the system does not change over time.
- EigenvalueA scalar lambda associated with a linear transformation (matrix Q) such that Q times the eigenvector equals lambda times the eigenvector.
- EigenvectorA non-zero vector that changes by a scalar factor when that linear transformation is applied to it.
- Critical pointA point where the derivative of a function is zero or undefined.
- Singular value decompositionA factorization of a real matrix into a product of three matrices: an orthogonal matrix, a diagonal matrix of singular values, and the transpose of another orthogonal matrix.
- Convex functionA function for which the line segment connecting any two points on the graph lies above or on the graph.
- Spectral theoremThe theorem stating that a symmetric matrix can be factored into an orthogonal matrix of eigenvectors, a diagonal matrix of eigenvalues, and the transpose of the orthogonal matrix.
- SubspaceA subspace of a vector space is a subset of a vector space which is itself a vector space, meaning it is closed under vector addition and scalar multiplication.
- GradientA vector of all partial derivatives of a function, pointing in the direction of the greatest rate of increase of the function.
- StandardizationScaling a random variable by subtracting its mean and dividing by its standard deviation to have a mean of zero and variance of one.
- Binomial coefficientThe number of ways to choose k items from a set of n items, denoted as n choose k.
- Binomial theoremA formula for expanding a binomial raised to any power.
- Countable setA set is countable if it is finite or it has the same size as the natural numbers.
- Hamming distanceHamming distance measures the number of positions at corresponding symbols are different between two strings of equal length.
- HysteresisThe phenomenon where a system does not return to its original unperturbed state after a rate constant perturbation is reversed.
- Vandermonde matrixA matrix with terms of a geometric progression in each row, used here to represent the polynomial evaluation process.
- Indicator random variableA random variable that takes value 1 if a given event occurs and 0 otherwise.
- Invertible matrixA square matrix that has a multiplicative inverse, equivalent to having a non-zero determinant.
- Power setThe power set of a set A is the set of all subsets of A.
- Continuum hypothesisThe hypothesis that there is no set whose cardinality is strictly between that of the integers and the real numbers.
- Cartesian productA product of two sets formed by taking all ordered pairs of elements from each set.
- Central limit theoremA theorem stating that the sum of a large number of independent and identically distributed random variables is approximately normally distributed.
- Chebyshev's inequalityAn inequality that bounds the probability that a random variable deviates from its mean by more than a certain amount using its variance.
- Linear approximationApproximating a complicated function using its tangent line or linear function based on its rate of change.
- Convex setA set in which a line segment connecting any two points in the set is entirely contained within the set.
- Orthogonal complementThe subspace of all vectors orthogonal to every vector in a given subspace .
- Probability density functionA function whose integral over an interval gives the probability that the continuous random variable falls within that interval.
- AttractorA set of states toward which a dynamical system tends to evolve for a wide variety of starting conditions.
- Cantor setConstructed by starting with the closed interval and iteratively removing the open middle third of each remaining interval.
- CurlThe curl of a vector field is an operator that measures the rotation or angular circulation of the vector field at any given point.
- Information theoryA mathematical study of the quantification, storage, and communication of information.
- Navier-Stokes equationsNavier-Stokes equations describe fluid motion with internal viscosity or friction added to the Euler equations.
- Scale invarianceA property where a function does not change when the scale or size of the system is uniformly scaled.
- Telescoping sumA sum in which intermediate terms cancel out, leaving only the first and last terms.
- Limit cycleA closed trajectory in phase space to which neighboring trajectories converge or diverge.
- Convex optimizationOptimization of a convex objective function over a convex set, where any local minimum is a global minimum.
- MonadsA programming pattern that can be understood for the talk's purpose as chaining continuations together.
- Quadratic formA function that expresses the square of the distance as a sum of quadratic terms of the coordinate differentials.
- Directional derivativeThe rate of change of a function in any given direction vector.
- FunctorA mapping between categories that preserves the structure of objects and morphisms.
- IsomorphismAn invertible function where composing the function with its inverse in both directions yields identity morphisms.
- Large cardinal axiomsPrinciples added to ZFC axioms that assert the existence of very large infinite sets.
- NormA way to measure the size of a vector, a matrix, a tensor, or a function.
- Orthonormal basisA basis of a vector space consisting of mutually orthogonal vectors of unit length.
- Rank of a matrixThe dimension of the column space of the matrix, which equals the number of non-zero rows in its row echelon form.
- Catalan numbersA mathematical sequence representing the number of possible join orderings for an n-way join in relational databases.
- Characteristic polynomialThe polynomial whose roots are the eigenvalues of the matrix A.
- FoliationA decomposition of a manifold into a collection of disjoint submanifolds of lower dimension.
- InterpolationA method of constructing new data points within the range of a discrete set of known data points using polynomials.
- Kleinian groupA discrete subgroup of the group of isometries of hyperbolic space.
- Left inverseA matrix is a left inverse of if equals the identity matrix.
- Normal equationsThe system of linear equations Aᵀ A x⃗ = Aᵀ b⃗ whose solutions are the least squares solutions to .
- TilingAn optimization technique that breaks down a large matrix multiplication into smaller submatrix multiplications to improve cache performance.
- TraceThe sum of the diagonal entries of a square matrix.
- Automatic differentiationA set of techniques to numerically evaluate the derivative of a function specified by a computer program.
- Bernoulli equationA non-linear differential equation of a specific form that can be transformed into a linear equation via substitution.
- Bipartite graphA graph whose vertices can be divided into two disjoint sets such that every edge connects a vertex in one set to one in the other.
- Canonical formA standard form for a Boolean expression that provides a unique algebraic signature.
- Channel capacityThe maximum rate at which information can be transmitted reliably over a noisy channel, given by for a binary symmetric channel.
- Constant of integrationA constant added to an indefinite integral to represent the non-uniqueness of antiderivatives.
- Critical exponentThe abscissa of convergence for the Poincaré series defined using the distance between a point and its orbit under the group action.
- Degree of a nodeThe number of edges that are incident to a node in a graph.
- Elliptic curveA smooth, projective, algebraic curve of genus one, given by an equation of the form .
- KnotA closed loop embedded in three-dimensional space that cannot be untied without cutting.
- Mapping torusA construction that forms a fiber bundle over the circle by taking a product of a space with an interval and identifying the ends via a homeomorphism.
- Minkowski sumThe set formed by taking all possible vector sums of elements from two sets A and B.
- MonodromyThe representation of the fundamental group of the base space on the cohomology of the fibers of a family.
- OrbitThe time series of states generated by an iterated map.
- Ricci flowA geometric flow that evolves a Riemannian metric to smooth out its curvature.
- Riemann hypothesisZeros in an infinite series of numbers known as a zeta function form along a straight line in the complex plane.
- Self-similarityA property where a set contains arbitrarily small copies of itself at different scales.
- Slack variableA new variable introduced to turn an inequality constraint into an equality constraint while maintaining equivalence.
- TopologyAbout shapes, arrangements of shapes, functions between shapes, and deformations of shapes.
- Total orderA partial order in which all pairs of elements are comparable.
- Orthogonal matrixA square matrix whose columns and rows are orthonormal vectors.
- Condition numberThe ratio of the largest to the smallest singular value of a matrix, indicating how sensitive the solution of is to errors.
- Frobenius normA matrix norm defined as the square root of the sum of the absolute squares of its elements, treating the matrix as a vector.
- Positive semidefinite matrixA symmetric matrix Y is positive semidefinite if for any real vector c, c transpose times Y times c is non-negative.
- Quadratic programmingOptimization problem with a quadratic objective function subject to linear constraints.
- Strange attractorAn attractor that exhibits sensitive dependence on initial conditions and a complex, often fractal structure in phase space.
- Logistic mapA polynomial mapping of degree 2 often cited as an archetypal example of how complex, chaotic behaviour can arise from very simple non-linear dynamical equations.
- MonoidAn algebraic structure that has an associative binary operation and an identity element.
- Positive semi-definite matrixA symmetric matrix whose eigenvalues are all greater than or equal to zero.
- Configuration spaceThe logical space of all possible states or configurations a system can occupy.
- Diagonalizable matrixA square matrix A is diagonalizable if it is similar to a diagonal matrix.
- Least squaresA method to find the best approximate solution to an unsolvable system of linear equations by minimizing the sum of squared errors.
- OrdinalsEvery ordinal is a set of all of the smaller ordinals.
- Prime number theoremA theorem stating that the fraction of n-bit numbers that are prime is big-Omega of .
- Stirling's approximationAn approximation for factorials used to find the asymptotically dominating term of .
- Axiom of choiceAn axiom of set theory stating that the Cartesian product of a collection of non-empty sets is non-empty.
- Burgers equationA fundamental non-linear partial differential equation used to model shock waves and fluid flow.
- Cauchy-Schwarz inequalityAn inequality that bounds the absolute value of the inner product of two vectors by the product of their lengths.
- ClustersDividing the universe of size u into smaller chunks to speed up search operations.
- Commuting matricesMatrices A and B commute if their product is equal regardless of order, i.e., AB = BA.
- Conformal invarianceInvariance of physical statistics under angle-preserving coordinate transformations.
- Equilibrium pointA point in the phase plane where the derivatives of all state variables are simultaneously zero.
- Étale cohomologyA Weil cohomology theory for algebraic varieties over arbitrary fields, using etale topology and valued in p-adic modules with Galois action.
- Gödel's incompleteness theoremFormal theorems stating that any consistent formal system capable of elementary arithmetic contains statements that cannot be proven or disproven within the system.
- Haken manifoldManifolds that admit an embedded incompressible surface, also known as sufficiently large manifolds.
- Hodge decompositionA decomposition of the cohomology of a compact Kähler manifold into a direct sum of spaces of harmonic forms of different types.
- Identity elementA group element that leaves any other element unchanged when the binary operation is applied.
- Integer quantum Hall effectA quantum mechanical version of the Hall effect observed at low temperatures and strong magnetic fields where the Hall resistivity takes quantized integer values.
- LassoA regression analysis method that performs both variable selection and regularization to enhance prediction accuracy.
- Least-squares regressionA historical precursor to machine learning where unknown coefficients x are found by minimizing the sum of squared errors over data.
- LinkAn operation that adds an edge between a node v and a node w in the represented tree, assuming v is a root.
- Measurable cardinalA cardinal for which there exists a non-trivial elementary embedding from the universe into a transitive inner model with critical point .
- Moduli spaceA geometric space whose points represent isomorphism classes of geometric structures or manifolds.
- NegationAn operation that takes a type and traverses all its pairs, negating their boolean values.
- OrbifoldsA generalization of a manifold that allows for certain types of singularities.
- Partial applicationA way to function to passing only some arguments to a function, returning a new function that can be called with the rest.
- Physics-informed neural networksA machine learning approach that incorporates physical laws, such as PDEs, into the loss function to solve differential equations.
- Poincare conjectureThe conjecture that every closed, simply connected three-dimensional manifold is homeomorphic to the three-sphere.
- Riemann integralA rigorous definition of the integral of a function using partitions and Riemann sums.
- Scalar curvatureA curvature invariant obtained by taking the trace of Ricci curvature, representing a local and flexible number assigned to each point of a Riemannian manifold.
- Sectional curvatureA measure of the curvature of a Riemannian manifold at a point in a given tangent plane.
- SensitivityThe maximum absolute difference in function output over all pairs of adjacent data sets.
- Strong cardinalA cardinal such that for every there is an elementary embedding from to with critical point and .
- Supercompact cardinalA cardinal such that for every there is an elementary embedding from to with critical point and closed under -sequences.
- Teichmüller spaceThe space of conjugacy classes of discrete faithful representations of the fundamental group of a surface into .
- U-mapA map that counts two curves through a point and decreases the degree by two.
- Universally Baire setA set of reals whose continuous pre-image in any topological space has the property of Baire in that space.
- Variational problemA problem in which you want to maximize or minimize something where you don't know where the maximum is.
- Weight functionA positive function W(x) used inside the integral to define the inner product on a space of functions.
- Projection matrixA matrix P = A(Aᵀ A)⁻¹ Aᵀ that projects vectors onto the column space of A.
- ForcingA method used in set theory to prove consistency and independence results by extending models of set theory using Boolean-valued models or generic filters.
- Law of the unconscious StatisticianA theorem used to calculate the expected value of a function of a random variable without needing to find the distribution of that function first.
- Cumulative hierarchy of setsThe universe V of sets generated by defining V alpha by induction on the ordinal alpha using power sets and unions at limit ordinals.
- Dual linear programA companion linear program derived from a primal LP that provides bounds and complementary interpretations.
- Fractal dimensionA simplification of Hausdorf dimension used to quantify roughness of self-similar shapes.
- Hyperbolic geometryA non-Euclidean geometry with constant negative curvature.
- L1 normThe sum of the absolute values of the components of a vector.
- Nuclear normThe sum of the singular values of a matrix.
- Rank-nullity theoremA theorem stating that the sum of the dimensions of the kernel and the image of a matrix equals the number of columns of that matrix.
- AM-GM inequalityAn inequality stating that the geometric mean of a set of non-negative real numbers is less than or equal to their arithmetic mean.
- Back propagationAn algorithm used to compute the gradient of the loss function with respect to the model parameters for each training example.
- CategoryA structure consisting of objects and arrows that can be composed and include identity arrows.
- Cumulative hierarchyThe iterative conception of the set-theoretic universe built up in stages from sets formed out of previously existing elements.
- Definable power setThe set of all subsets of a set that are logically definable in the structure with parameters from the set.
- Exact line searchA line search method that chooses the step size to minimize the objective function along the search direction.
- Gödel's constructible universe LA cumulative hierarchy of sets built by iterating the definable power set operation instead of the full power set operation.
- Hadamard matrixA square matrix whose entries are +1 or -1 and whose columns are orthogonal.
- Hamming codeAn early linear error-correcting code capable of detecting up to two-bit errors and correcting single-bit errors.
- HessianThe square matrix of second-order partial derivatives of a scalar-valued function.
- Hyperbolic functionsFunctions defined analogously to circular functions using a hyperbola instead of a circle.
- Möbius transformationA composition of finitely many inversions with respect to circles.
- Parametric polymorphismParametric polymorphism in Haskell means defining a function using a single formula for all types.
- Perfect setA closed set with no isolated points.
- Period doublingA phenomenon where the period of a stable cycle doubles as a parameter is increased.
- Product typeAn algebraic type formed by multiplying or combining two types together, such as a person and a date.
- Strictly convex functionA convex function where every line segment connecting two points on its graph lies strictly above the function.
- Sum typeA data structure that can hold one of several different types of values at a time, often implemented as tagged unions.
- Unit typeA type that has only one element.
- AutoformalizationThe process of automatically translating mathematical text into formal proof assistant code like Lean.
- Baker-Campbell-Hausdorff formulaA formula for the logarithm of the product of two exponentials of non-commuting operators.
- Bernoulli numbersCoefficients appearing in the formula for the differential of an interval in a DGLA, related to the function .
- Berry phaseA geometric phase acquired by a wavefunction when its parameters are varied along a closed loop in parameter space.
- Betti numberThe first Betti number of a graph is the number of independent cycles it contains, calculated as the number of edges minus the number of vertices plus one.
- Binary entropyA measure of uncertainty or average information content of a probability distribution, defined as the negative sum of .
- Birch and Swinnerton-Dyer conjectureA conjecture relating the Taylor series expansion of the L-function of an elliptic curve at to the rank of its rational points.
- BosonizationA procedure in 1+1 dimensions that maps a fermionic theory to an equivalent bosonic theory.
- CategoricityA property of a theory having a unique model up to isomorphism in a given cardinality.
- Censored dataObservations where the event of interest has not occurred or the subject is lost to follow-up before the study ends.
- Change of basisA linear algebraic transformation of a signature vector to a different basis to simplify expression reconstruction.
- Chow's theoremA theorem stating that any closed complex-analytic subspace of complex projective space is algebraic.
- Class field theoryThe theory that gives a complete description of all abelian Galois groups associated to a given number field.
- Classical bitsBits used in classical physics to represent system states, as opposed to quantum bits (qubits).
- Clifford algebraAn algebra generated by a vector space and its dual, equipped with relations based on scalar products.
- Cohen's methodA method showing that every universe of set theory contains blueprints for virtual universes extending that can be analyzed from within .
- CompactnessThe requirement that the number of certificates is small.
- Compressed sensingA signal processing technique for efficiently acquiring and reconstructing a signal by finding solutions to underdetermined linear systems.
- Conformal structureA way to define angles and local geometry on a surface or manifold, independent of a specific metric.
- Congruence subgroupA subgroup of a matrix group defined by congruence conditions modulo an integer.
- Constructible universe (L)Defined by induction using the definable power set at each successor step and taking unions at limit stages.
- Contact structureA maximally non-integrable hyperplane field defined on an odd-dimensional manifold.
- Continuum cardinalityThe cardinality denoted by c, representing the cardinality of the set of real numbers.
- CoproductA dual notion to the product in category theory, used here in the context of loop spaces.
- CosetA set formed by multiplying every element of a subgroup by a fixed group element.
- Countable setsSets that have the same cardinality as the natural numbers, meaning they can be put into a bijection with .
- CuspA region of a hyperbolic manifold that is homeomorphic to a product of a torus and a half-infinite interval, and which has finite volume.
- De Rham cohomologyA cohomology theory for manifolds or varieties equipped with a Hodge filtration and a polarization.
- Differential operatorA mapping from sections of one vector bundle to sections of another vector bundle.
- Dirac notation (ket)A shorthand notation using brackets like and to represent standard basis vectors.
- Dirichlet functionA violently discontinuous function that takes the value 1 for rational numbers and 0 for irrational numbers.
- Double-well potentialA potential function having minima at values representing the two preferred phases.
- Dual spaceThe space of linear functionals on a Lie algebra, which in this context is the space of distribution functions.
- Electric-magnetic dualityA symmetry in physics that relates electric and magnetic fields or charges.
- Elementary embeddingA function between two transitive sets that preserves the truth of logical formulas.
- Equational reasoningThe process of proving things by transforming expressions using inlining and refactoring based on known definitions.
- Euler characteristicA topological invariant calculated as for compact orientable surfaces of genus .
- Euler productA representation of a Dirichlet series as an infinite product over prime numbers.
- Extended real numbersThe set of real numbers augmented with positive and negative infinity, denoted as .
- Feynman path integralA mathematical formulation that defines quantum mechanical systems in a quite general way.
- Fixed point equationAn equation of the form u = f(u) whose solutions are invariant under the function f.
- Free energyThe quantity defined as that matter minimizes to maximize the entropy of the universe.
- Function spaceA vector space whose elements are functions, where addition and scalar multiplication are defined pointwise.
- Fundamental groupAn algebraic invariant of a topological space that records information about the hole structure.
- Futaki invariantAn invariant whose vanishing is a necessary condition for the existence of a constant scalar curvature metric.
- Generator matrixA matrix used in linear codes to multiply against a message vector to produce a codeword.
- Generic MultiverseA collection of universes generated by a universe V, where extensions of universes by Cohen blueprints are also included.
- Generic Multiverse truthA statement is a generic-multiverse truth if it holds in each universe of the generic-multiverse.
- Geometrization conjectureEvery 3-manifold can be decomposed into canonical geometric pieces.
- Gromov-Hausdorff limitLimits of metric spaces under the Gromov-Hausdorff distance, allowing the study of convergence of spaces without smooth structures.
- GyroidA complex triply periodic minimal surface shape invented by a mathematician that appears in butterfly wing structures.
- Higgs bundleA vector bundle together with a Higgs field, which is a linear operator satisfying certain integrability conditions.
- Homoclinic pointA point in the intersection of the stable and unstable manifolds of a dynamical system's orbit.
- HomotopyA continuous deformation of one mathematical object into another, used here to bridge between a solved equation and the target equation.
- HypercubeAn n-dimensional cube or n-cube network topology that achieves low latency and logarithmic radix.
- Inattentional blindnessThe failure to notice an unexpected stimulus when other attention-demanding tasks or stimuli are present.
- Incidence matrixA matrix that describes the relationship between nodes and edges in a graph, with rows representing edges and columns representing nodes.
- Incompressible Euler equationAn equation describing the motion of an inviscid, incompressible fluid.
- Infinity groupoidA structure that has zero cells, one cells, two cells, three cells, and so on to infinity.
- InjectionAn injection in the context of coproducts is a morphism going from component objects into the coproduct object.
- Inner modelA transitive class containing all ordinals of the universe that is a model of set theory itself.
- Inner model programThe program of constructing enlargements of L using large cardinals to expand the definable powerset.
- Interaction energyA potential energy component connected with the interactions between electrons and photons in a system.
- InterpretationTaking a machine that speaks some low-level language and raising it to a high-level language like Lisp by writing an interpreter.
- Inverse designA materials design approach that starts with desired properties and identifies the materials that produce them.
- Inverse problemA problem where one attempts to determine the properties of a system from its observed outputs.
- Invertible mapA map is invertible if given the image , you can solve uniquely for its preimage .
- Isolated pointAn element of a set that stands alone in some small neighborhood.
- L infinity normThe maximum absolute value among the components of a vector.
- L2 normThe l2 norm measures the Euclidean distance or length of a vector as the square root of the sum of squared components.
- Large cardinalsAxioms positing the existence of infinities with extreme properties, lying high in the consistency strength hierarchy.
- Legendre transformThe transform used in the Gärtner-Ellis theorem to obtain the rate function from the scaled cumulant generating function.
- LiftingGenerating a lifted version of a function that operates on arrays of values rather than single values.
- Linear stabilityA method to study the stability of a steady state by perturbing it and analyzing the linearized equations.
- Local monodromyThe monodromy action defined locally around boundary components.
- Locality in amplitudesLocality implies that the poles of the amplitude are of the form of some subset sums of external momenta going to zero.
- Low rank matrixA matrix where , meaning it is more efficient to send the matrix in low rank form than in full rank form.
- Modular curveCurves that classify elliptic curves up to isomorphism, quotiented by modular groups such as congruence subgroups of SL2(Z).
- Mordell's theoremMordell's theorem states that the set of rational points on an elliptic curve over the rationals forms a finitely-generated abelian group.
- Nodal domainA connected component of the graph where the eigenvector maintains a constant sign.
- Normalized LaplacianThe Laplacian matrix scaled by the degree matrix, often used to normalize the spectrum to the interval .
- Order isomorphismAn order isomorphism requires a syntactic identity and strict one-to-one correspondence between two calculi.
- Ordinal numbersA generalization of natural numbers used to describe the order type of well-ordered sets.
- P-adic Hodge theoryThe study of Galois representations arising from geometry in the p-adic setting.
- Parallel postulateTo every line and a point not on that line, there exists a unique line which never meets it.
- Pattern recognitionThe ability to recognize patterns as the primary way of coping with very high speeds of data movement.
- Perfect codeA code where the Hamming balls of radius around each code word are disjoint and exactly partition the entire space.
- Physics-informed machine learningEncoding known physics, such as partial differential equations, into a neural network by adding governing physical residual terms to the loss function.
- Pochhammer symbolThe rising factorial denoted used in the coefficients of the hypergeometric series.
- Poincaré inequalityAn inequality bounding the L2 norm of a centered smooth function on a convex set by the L2 norm of its gradient.
- Prefix-free codeA code where no codeword is a prefix of any other codeword, allowing unambiguous sequential decoding symbol by symbol.
- Prime decompositionThe process of decomposing a knot into a connected sum of prime knots by cutting along a 2-sphere that intersects the knot in two points.
- Probability measureA function that assigns a non-negative probability to each outcome such that the sum over the entire sample space equals 1.
- Proof systemA formal framework specifying the precise subject matter and the explicit rules of reasoning allowed.
- Quasiconformal mapA smooth map between Riemann surfaces with a finite supremum dilatation across all points.
- Ramsey numberRamsey numbers measure the minimum graph order required to guarantee the existence of a specific clique or independent set.
- Randomized responseA technique using coin flips to answer sensitive questions while providing differential privacy guarantees.
- Rate of a codeThe ratio representing the dimension of the code subspace divided by block length .
- Ray tracingAn algorithm that traces millions of light rays from the camera through a simulated environment to render an image.
- Reeb vector fieldA vector field tangent to the Sasakian manifold defined by .
- Reidemeister movesThree fundamental local moves on knot diagrams that do not change the underlying knot type.
- ReLU activation functionA non-linear function applied component-wise that maps positive numbers to themselves and negative numbers to zero.
- RestrictionFixing some of the input bits of a function to either plus or minus one to obtain a subfunction.
- Ricci curvatureA contraction of the Riemann curvature tensor used to measure curvature behavior in Riemannian and metric measure spaces.
- Riemann-Lebesgue lemmaA mathematical lemma stating that the Fourier transform of an integrable function vanishes at infinity due to rapid oscillations.
- Russell's paradoxA logical contradiction arising from the definition of a set as the collection of all sets that are not members of themselves.
- Sasakian manifoldAn odd-dimensional Riemannian manifold whose metric cone is a Kähler manifold.
- Schramm-Loewner evolutionA family of random fractal curves in two dimensions that describe the scaling limits of critical statistical mechanics models.
- SemiringAn algebraic structure similar to a ring, but lacking an additive inverse (subtraction).
- Similarity dimensionThe ratio of log N to log 1/r used to measure the dimension of self-similar sets and fractals.
- Simple groupA non-trivial group whose only normal subgroups are the trivial group and the group itself, serving as building blocks for other groups.
- Simpson correspondenceAn equivalence between representations of the fundamental group and Higgs bundles on smooth varieties.
- SolidityA property of a theory where all well-founded models are isomorphic.
- Sparse linear algebraA computational paradigm where problems are mapped to sparse matrix operations to achieve high performance.
- Spectral methodA strategy that uses the eigenvectors of a similarity matrix to partition a graph.
- Spinner helicityA formalism using two-component Weyl spinners to simplify scattering amplitudes for massless particles.
- Spinor representationA representation of a group acting on a Euclidean space by orthogonal transformations.
- Stability of fixed pointsEvaluating whether a fixed point is stable using the derivative of the iterated function at that point.
- String topologyAlgebraic topology of the free loop space of a manifold, equipped with operations coming from the manifold structure.
- Strong limit cardinalA cardinal theta is a strong limit cardinal if for all beta less than theta, there is no surjection from the power set of beta onto theta.
- SubgroupA subset H of a group G that is also a group under the same binary operation.
- Substitution methodA technique for evaluating integrals by substituting a complex part of the integrand with a new variable and its differential.
- Super resolutionA machine learning technique that takes a low-resolution image and upscales it to a high-resolution frame.
- Suslin treeConstructed by taking the union of the S alphas and sealing off the antichains, similar to Jensen's theorem.
- Symmetric groupThe group of all bijections from a set to itself under function composition.
- Tagged unionA data structure containing a value that can take on several different, but fixed, types, accompanied by a tag field indicating its current type.
- Total angular momentumThe total angular momentum of the system, which can be constrained to vanish in initial conditions.
- TransversalityTransversality describes a robust intersection property of submanifolds.
- TurbulenceA state of a physical system with many degrees of freedom deviated far from equilibrium that is irregular both in time and in space.
- Ultimate-LA proposed inner model of set theory that, if it exists, could serve as the canonical universe for set-theoretic truth.
- Unitarity factorizationThe property where amplitudes factorize near their poles into products of lower-point left and right amplitudes.
- WaveletsOrthogonal matrices or bases characterized by self-scaling and localized structure.
- Weak consistencyA condition in community detection where the recovered community labels are better than random guessing.
- Well-orderingA strict total order on a set such that every non-empty subset has a least element.