n
(mathematics) A 27-dimensional exceptional Jordan algebra.
n
(countable, mathematics) One of several other types of mathematical structure.
n
(mathematics) A branch of mathematics that studies algebraic varieties (solution sets of polynomial equations) and their generalisations, using techniques from both algebra (chiefly commutative algebra) and geometry.
n
(countable, applied mathematics) A theory developed by applying algebraic graph theory to a particular problem or application.
n
(algebraic geometry) K-theory studied from the point of view of algebra.
n
(algebra, universal algebra) Any one of the numerous types of mathematical object studied in algebra and especially in universal algebra;
n
(algebraic geometry) A subset of an algebraic variety that is itself an algebraic variety.
n
(algebraic geometry) The set of solutions of a given system of polynomial equations over the real or complex numbers; any of certain generalisations of such a set that preserves the geometric intuition implicit in the original definition.
n
(mathematics) A term of magma used to describe identifiable properties in an algebraic structure.
n
(mathematics) A generalization of central simple algebras to R-algebras where R need not be a field.
n
(mathematics) A BOCS representation of an algebraic structure
n
(mathematical analysis) Any of the members of a Borel σ-algebra.
n
(mathematical analysis) The smallest σ-algebra which contains the topology of a given topological space.
n
(mathematics) A certain kind of nilpotent subalgebra of a Lie algebra.
n
(algebra) The analogue for a group of a multiplication table.
n
(graph theory) A subgraph isomorphic to a complete graph.
n
(algebra) A non-associative (not necessarily associative) algebra, A, over some field, together with a nondegenerate quadratic form, N, such that N(xy) = N(x)N(y) for all x, y ∈ A.
n
(algebra, Lie theory) Initialism of Cartan subalgebra. [(mathematics) A certain kind of nilpotent subalgebra of a Lie algebra.]
n
(historical) Any of certain algorithms first described in Euclid's Elements.
n
An extension to the Euclidean algorithm, which computes the coefficients of Bézout's identity in addition to the greatest common divisor of two integers.
n
(mathematics) A fiber ring
n
(mathematics) The preimage of a given point in the range of a map.
n
(mnemonic) An acronym for the algorithm for multiplying two binomials.
n
(mathematical analysis, harmonic analysis, physics, electrical engineering) A particular integral transform that when applied to a function of time (such as a signal), converts the function to one that plots the original function's frequency composition; the resultant function of such a conversion.
n
(algebra, field theory) The branch of mathematics dealing with Galois groups, Galois fields, and polynomial equations.
n
(mathematics) Initialism of greatest common divisor. [(arithmetic, number theory) The largest positive integer (respectively polynomial, element of a given ring) that is a divisor of each of a given set of integers (respectively polynomials, elements of a given ring).]
n
(mathematics) A heap, or mathematical generalization of a group, in abstract algebra.
n
(computing theory) A quantum algorithm that finds with high probability the unique input to a black-box function that produces a particular output value.
n
(graph theory) A matrix showing the relationship between two classes of objects.
n
Abbreviation of Kochen-Specker theorem. [(quantum mechanics) A no-go theorem that places certain constraints on the permissible types of hidden-variable theories that try to explain the apparent randomness of quantum mechanics as a deterministic model featuring hidden states. It demonstrates the impossibility of quantum-mechanical observables representing "elements of physical reality".]
n
Alternative letter-case form of L'Hôpital's rule [(mathematics) The rule that the limit of the ratio of two functions equals the limit of the ratio of their derivatives, usable when the former limit is indeterminate and the latter limit exists.]
n
(algebra) A left coset of a subgroup is a copy of that subgroup, multiplied on the left by some element from the parent group
n
(mathematics) The branch of mathematics that deals with vectors, vector spaces, linear transformations and systems of linear equations.
n
(mathematics) A theory and technique for the analysis and processing of geometrical structures, based on set theory, lattice theory, topology, and random functions.
n
(mathematics) A process by which a matrix (a rectangular table of numbers or abstract quantities that can be added and multiplied) is broken down into simpler numerical building blocks.
n
(mathematics) The Steinhaus-Moser number ②
n
The branch of mathematics that deals with groups, monoids, fields, and like algebraic structures.
n
(mathematics) The result that the Fourier transform is unitary; loosely, that the sum (or integral) of the square of a function is equal to the sum (or integral) of the square of its transform.
n
(mathematics) A group of isometries leaving a fixed point.
n
(mathematics, computing) A set of algorithms together with rules for choosing when to use each one
n
(mathematics) A function of multiple exponential terms.
n
(mathematics, countable) A particular form of Lie algebra.
n
(mathematics) A ringed space that has a finite open cover by affine varieties
n
(mathematics) Any first-order ordinary differential equation that is quadratic in the unknown function.
n
(algebra, ring theory) An algebraic structure similar to a ring, but without the requirement that every element have an additive inverse.
n
(mathematics) A mathematical structure that enlarges the notion of algebraic variety in several ways, such as taking account of multiplicities and allowing "varieties" defined over any commutative ring (e.g. Fermat curves over the integers).
n
(algebraic geometry) The branch of mathematics that concerns schemes (algebraic varieties equipped with the Zariski topology).
n
(mathematics) The simplest description of the Robinson-Schensted correspondence; a procedure that constructs one tableau by successively inserting the values of the permutation according to a specific rule, while the other tableau records the evolution of the shape during construction.
n
An algorithm for finding the minimum value in each row of an implicitly-defined totally monotone matrix.
n
(algebra) Abbreviation of special unitary group. [(linear algebra, group theory) For given n, the group of n×n unitary matrices with complex elements and determinant equal to one.]
n
(mathematics) A certain subcollection of a topological space
n
(mathematics) A subbase (subcollection of a topological space).
adj
(mathematics) Being the target (codomain) of a partial surjection from the natural numbers.
n
(group theory) A subset H of a group G that is itself a group and has the same binary operation as G.
n
(mathematics) A subset of a hypergraph
n
(mathematics) A specific type of subset of a hypergroup
n
(mathematics) A subset of a multialgebra
n
(mathematics) Any subset of a semigroup that is closed under the semigroup operation.
n
(countable, mathematics) A subset of a space which is a space in its own right.
n
(mathematics) The group to which a subgroup belongs.
n
(mathematics, linguistics) A variety having subordinate varieties; the parent of a subvariety.
n
(geometry) A theorem stating that, given a finite number of points in the Euclidean plane, either all the points lie on a single line, or there is at least one line which contains exactly two of the points.
adj
(mathematics) Describing number systems, algebras, and algorithms over labeled hierarchical subdivisions of space.
n
(computing theory) A multiplication algorithm that multiplies large integers by recursively splitting them into smaller parts and performing operations on the parts.
n
(graph theory) A theorem stating that, among the n-vertex simple graphs with no (r + 1)-cliques, T(n, r) has the maximum number of edges.
n
(mathematics) The branch of mathematics that deals with vectors and operations on them.
Note: Concept clusters like the one above are an experimental OneLook
feature. We've grouped words and phrases into thousands of clusters
based on a statistical analysis of how they are used in writing. Some
of the words and concepts may be vulgar or offensive. The names of the
clusters were written automatically and may not precisely describe
every word within the cluster; furthermore, the clusters may be
missing some entries that you'd normally associate with their
names. Click on a word to look it up on OneLook.
Our daily word games Threepeat and Compound Your Joy are going strong. Bookmark and enjoy!
Today's secret word is 8 letters and means "Believable and worthy of trust." Can you find it?