Search Results for ""

Universal algebra studies common properties of all algebraic structures, including groups, rings, fields, lattices, etc. A universal algebra is a pair A=(A,(f_i^A)_(i in I)), ...

An untouchable number is a positive integer that is not the sum of the proper divisors of any number. The first few are 2, 5, 52, 88, 96, 120, 124, 146, ... (OEIS A005114). ...

An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...

If ABB^' and AC^'C are straight lines with BC and B^'C^' intersecting at D and AB+BD=AC^'+C^'D, then AB^'+B^'D=AC+CD. The origin and some history of this theorem are ...

A Vandermonde matrix is a type of matrix that arises in the polynomial least squares fitting, Lagrange interpolating polynomials (Hoffman and Kunze p. 114), and the ...

A vector basis of a vector space V is defined as a subset v_1,...,v_n of vectors in V that are linearly independent and span V. Consequently, if (v_1,v_2,...,v_n) is a list ...

A vector space V is a set that is closed under finite vector addition and scalar multiplication. The basic example is n-dimensional Euclidean space R^n, where every element ...

The tensor product of two vector spaces V and W, denoted V tensor W and also called the tensor direct product, is a way of creating a new vector space analogous to ...

A vertex cut, also called a vertex cut set or separating set (West 2000, p. 148), of a connected graph G is a subset of the vertex set S subset= V(G) such that G-S has more ...

The degree of a graph vertex v of a graph G is the number of graph edges which touch v. The vertex degrees are illustrated above for a random graph. The vertex degree is also ...