Search Results for ""

A quadrature (numerical integration) algorithm which has a number of desirable properties.

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

A set of numbers a_0, a_1, ..., a_(m-1) (mod m) form a complete set of residues, also called a covering system, if they satisfy a_i=i (mod m) for i=0, 1, ..., m-1. For ...

If F is an algebraic Galois extension field of K such that the Galois group of the extension is Abelian, then F is said to be an Abelian extension of K. For example, ...

The logarithm of the reciprocal of a number, equal to the negative of the logarithm of the number itself, cologx=log(1/x)=-logx.

The fifth of Peano's axioms, which states: If a set S of numbers contains zero and also the successor of every number in S, then every number is in S.

There are several different definitions of the term "unital" used throughout various branches of mathematics. In geometric combinatorics, a block design of the form (q^3+1, ...

For any real number r>=0, an irrational number alpha can be approximated by infinitely many rational fractions p/q in such a way that ...