Search Results for ""

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

Let Q(x)=Q(x_1,x_2,...,x_n) be an integer-valued n-ary quadratic form, i.e., a polynomial with integer coefficients which satisfies Q(x)>0 for real x!=0. Then Q(x) can be ...

A set of real numbers x_1, ..., x_n is said to possess an integer relation if there exist integers a_i such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. For ...

If A and B are commutative unit rings, and A is a subring of B, then A is called integrally closed in B if every element of B which is integral over A belongs to A; in other ...

In univariate interpolation, an interpolant is a function L=L(x) which agrees with a particular function f at a set of known points x_0,x_1,x_2,...,x_n and which is used to ...

An element admitting a multiplicative or additive inverse. In most cases, the choice between these two options is clear from the context, as, for example, in a monoid, where ...

The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...

Let R[z]>0, 0<=alpha,beta<=1, and Lambda(alpha,beta,z)=sum_(r=0)^infty[lambda((r+alpha)z-ibeta)+lambda((r+1-alpha)z+ibeta)], (1) where lambda(x) = -ln(1-e^(-2pix)) (2) = ...

If, after constructing a difference table, no clear pattern emerges, turn the paper through an angle of 60 degrees and compute a new table. If necessary, repeat the process. ...

A relation connecting the values of a meromorphic function inside a disk with its boundary values on the circumference and with its zeros and poles (Jensen 1899, Levin 1980). ...