Matrices, Measures & Numeric Structures¶

← Back to Domain-Specific Families

Abstractions that formalize numeric and structural representations, including specialized matrices, distance and similarity measures, number and naming systems, plus algorithmic techniques like low-rank approximation and symbolic factorization, a loosely connected miscellany of quantitative tools.

30 abstractions in this family — domain-specific abstractions that sit near one another in structural-signature space (k-means over structural-signature embeddings). Each is shown with its short description.

Approximate number system — A nonsymbolic cognitive system that represents the approximate numerosity of a set.
Canberra Distance — A coordinatewise distance between real vectors defined by summing |p_i−q_i|/(|p_i|+|q_i|), with a zero contribution when both coordinates are zero, thereby emphasizing relative differences near zero.
Compact Quasi-Newton Representation — A block low-rank form of accumulated quasi-Newton Hessian or inverse-Hessian updates, built from secant-pair history to replace dense matrix operations with tall factors and a small system.
Complex number — A field element a+bi extending the reals by i²=−1, equivalently a plane point with field multiplication that encodes rotation and scaling.
Conference Matrix — A square zero-diagonal ±1 matrix whose columns are mutually orthogonal with squared norm n−1, equivalently satisfying CᵀC=(n−1)I.
Continuous variable — A quantitative variable able to take every real value between any two attainable values within the interval under consideration.
Database Index — A maintained auxiliary structure mapping declared key values or predicates to database rows so selected retrieval and ordering become faster at a storage and update cost.
Diagonal Matrix — A square matrix with every off-diagonal entry equal to zero, representing independent coordinate scaling in the chosen basis.
Distance Matrix — An indexed square array whose entry records a declared pairwise distance or dissimilarity, with metric properties present only when the underlying function satisfies them.
Free Group — The group of reduced words on a basis and formal inverses, with no relations beyond group axioms and a universal extension property for maps from that basis.
Functional Integration — Integration over spaces of functions, paths, or fields, defined through an infinite-dimensional measure or controlled limiting construction—or used as an explicitly formal regulated calculus.
Grey Relational Analysis — A grey-system method that converts pointwise deviations from a reference sequence into grey relational coefficients and an aggregated grade for comparing or ranking alternatives.
Kostka number — The nonnegative integer K_{λμ} counting semistandard Young tableaux of shape λ and weight μ, also a Schur-to-monomial coefficient.
L-Matrix — A matrix whose diagonal entries are positive and whose off-diagonal entries are nonpositive.
Let-Polymorphism — Type-scheme generalization at let bindings with fresh instantiation at each use in Hindley–Milner systems.
Log-Sum Inequality — For nonnegative sequences aᵢ and bᵢ with totals A and B, the inequality ∑aᵢ log(aᵢ/bᵢ) ≥ A log(A/B), under standard zero conventions, with equality when the positive ratios aᵢ/bᵢ are constant.
Long and Short Scales — Two large-number naming conventions in which successive -illion names advance by factors of one thousand or one million after the shared name million.
Low-rank matrix approximations — A rank-limited matrix surrogate evaluated by its residual error and computational purpose.
Matrix Multiplication — The ordered contraction of compatible matrices, producing cᵢⱼ=Σₖaᵢₖbₖⱼ and representing composition of linear transformations.
Metric System — A coherent measurement-unit family built from defined base units, systematically derived units, and standardized decimal prefixes for powers-of-ten multiples and submultiples.
Numeral Prefix — A bound morpheme derived from a numeral or numerical stem that contributes a conventional quantity, multiplicity, order, base, or grouping meaning to a complex word.
Permutation Code — A codebook formed from permutations of n distinct symbols, equipped with a distance and minimum-separation requirement for detecting or correcting channel errors.
Physiological Density — A land-pressure ratio calculated as total population divided by arable-land area, contrasting the number of people with the portion of territory considered cultivable rather than with total national area.
Rank-Size Distribution — A decreasing ordering of item sizes indexed by ordinal rank, yielding a discrete reverse-quantile representation rather than a probability distribution.
Rauzy Fractal — A compact self-similar planar set obtained by projecting prefix-sum paths of the Tribonacci substitution onto the contracting plane of its substitution matrix, with tiling and symbolic-dynamical structure.
Schema-Agnostic Database Access — A query-mediation capability that maps user terminology and structure onto an unfamiliar or changing database schema, constructs executable interpretations, and exposes ambiguity without requiring native vocabulary knowledge.
String kernel — A positive-semidefinite similarity function on variable-length symbol sequences that enables kernel learning through implicit substring or subsequence features.
Superpermutation — A string over n symbols that contains every permutation of those symbols as a contiguous substring.
Symbolic Cholesky Decomposition — Preprocessing that predicts sparse Cholesky-factor nonzeros and elimination dependencies before numerical factorization.
X + Y Sorting — The structured problem of ordering every pair from two numeric collections by its coordinate sum, while preserving the full Cartesian product and its duplicate sums.