Search Results for ""

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

The algebraics, sometimes denoted A (Derbyshire 2004, p. 173), are the set of algebraic numbers. The set of algebraic numbers is implemented in the Wolfram Language as ...

The first corona of a tile is the set of all tiles that have a common boundary point with that tile (including the original tile itself). The second corona is the set of ...

To enumerate a set of objects satisfying some set of properties means to explicitly produce a listing of all such objects. The problem of determining or counting all such ...

The set of points of X fixed by a group action are called the group's set of fixed points, defined by {x:gx=x for all g in G}. In some cases, there may not be a group action, ...

A hyperstring is a simple semi-Hamiltonian acyclic digraph (V,E) with a labeling of the edges in E such that, for all vertices i,j,p,q in V, either pi(i,j)=pi(p,q) or pi(i,j) ...

A set of vectors is maximally linearly independent if including any other vector in the vector space would make it linearly dependent (i.e., if any other vector in the space ...

Let V be a variety, and write G(V) for the set of divisors, G_l(V) for the set of divisors linearly equivalent to 0, and G_a(V) for the group of divisors algebraically equal ...

The set of all Schwartz functions is called a Schwartz space and is denoted S(R^n). If C_0^infty(R^n) denotes the set of smooth functions of compact support on R^n, then this ...

"Aggregate" is an archaic word for infinite sets such as those considered by Georg Cantor. The term is sometimes also used to refer to a finite or infinite set in which ...