Search Results for ""

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 norm topology on a normed space X=(X,||·||_X) is the topology tau consisting of all sets which can be written as a (possibly empty) union of sets of the form B_r(x)={y in ...

The set of all nonsingular affine transformations of a translation in space constitutes a group known as the affine group. The affine group contains the full linear group and ...

Let P be the set of primes, and let Q_p and Z_p(t) be the fields of p-adic numbers and formal power series over Z_p=(0,1,...,p-1). Further, suppose that D is a "nonprincipal ...

The conjecture proposed by Catalan in 1888 and extended by E. Dickson that each aliquot sequence ends in a prime, a perfect number, or a set of sociable numbers. The ...

A Cevian point P is point with respect to which a set of Cevians of a triangle are taken. Connecting the endpoints of the Cevians through a point P gives the so-called Cevian ...

A code is a set of n-tuples of elements ("words") taken from an alphabet. The designation "code n" is also given to the nth totalistic cellular automaton in Wolfram's ...

Consider a set of points X_i on an attractor, then the correlation integral is C(l)=lim_(N->infty)1/(N^2)f, where f is the number of pairs (i,j) whose distance |X_i-X_j|<l. ...

The determination of the number of monotone Boolean functions of n variables (equivalent to the number of antichains on the n-set {1,2,...,n}) is called Dedekind's problem, ...