Search Results for ""

Term rewriting systems are reduction systems in which rewrite rules apply to terms. Terms are built up from variables and constants using function symbols (or operations). ...

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 ...

A generalization of the concept of set unions and intersections.

The general curve of a system which is linearly dependent on a certain number of given irreducible curves will not have a singular point which is not fixed for all the curves ...

The multiplicative subgroup of all elements in the product of the multiplicative groups k_nu^× whose absolute value is 1 at all but finitely many nu, where k is a number ...

A finite set of contraction maps w_i for i=1, 2, ..., N, each with a contractivity factor s<1, which map a compact metric space onto itself. It is the basis for fractal image ...

The values of -d for which imaginary quadratic fields Q(sqrt(-d)) are uniquely factorable into factors of the form a+bsqrt(-d). Here, a and b are half-integers, except for ...

The (upper) matching number nu(G) of graph G, sometimes known as the edge independence number, is the size of a maximum independent edge set. Equivalently, it is the degree ...

Let a set of vertices A in a connected graph G be called convex if for every two vertices x,y in A, the vertex set of every (x,y) graph geodesic lies completely in A. Also ...

The cylindrical parts of a system of real algebraic equations and inequalities in variables {x_1,...,x_n} are the terms f_1 <= x_1<=g_1 (1) f_2(x_1) <= x_2<=g_2(x_1) (2) | ...