Search Results for ""

A totally ordered set (A,<=) is said to be well ordered (or have a well-founded order) iff every nonempty subset of A has a least element (Ciesielski 1997, p. 38; Moore 1982, ...

x^n=sum_(k=0)^n<n; k>(x+k; n), where <n; k> is an Eulerian number and (n; k) is a binomial coefficient (Worpitzky 1883; Comtet 1974, p. 242).

The Zariski topology is a topology that is well-suited for the study of polynomial equations in algebraic geometry, since a Zariski topology has many fewer open sets than in ...

A nonzero element x of a ring for which x·y=0, where y is some other nonzero element and the multiplication x·y is the multiplication of the ring. A ring with no zero ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p) and numbers are assigned to the edges of a grid. A b-cluster is an ...

Linear Algebra

The Van Lint-Schrijver Graph graph is a weakly regular Hamiltonian graph on 162 vertices with parameters (nu,k,lambda,mu)=(162,(6),(0),(0,1)). It is distance-regular with ...

Smarandache sequences are any of a number of simply generated integer sequences resembling those considered in published works by Smarandache such as the consecutive number ...

A Boolean algebra is a mathematical structure that is similar to a Boolean ring, but that is defined using the meet and join operators instead of the usual addition and ...

In common usage, a cardinal number is a number used in counting (a counting number), such as 1, 2, 3, .... In formal set theory, a cardinal number (also called "the ...