Search Results for ""

A schematic diagram used in logic theory to depict collections of sets and represent their relationships. The Venn diagrams on two and three sets are illustrated above. The ...

The Walsh functions consist of trains of square pulses (with the allowed states being -1 and 1) such that transitions may only occur at fixed intervals of a unit time step, ...

Baire's category theorem, also known as Baire's theorem and the category theorem, is a result in analysis and set theory which roughly states that in certain spaces, the ...

The order-n bouquet graph B_n is a pseudograph consisting of a single vertex with n self-loops. The bouquet graph B_1 is a pseudograph that can be considered to correspond to ...

The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

For the Helmholtz differential equation to be separable in a coordinate system, the scale factors h_i in the Laplacian del ...

Lovász (1970) conjectured that every connected vertex-transitive graph is traceable (Gould, p. 33). This conjecture was subsequently verified for several special orders and ...

Consider the probability Q_1(n,d) that no two people out of a group of n will have matching birthdays out of d equally possible birthdays. Start with an arbitrary person's ...

The nth order Bernstein expansion of a function f(x) in terms of a variable x is given by B_n(f,x)=sum_(j=0)^n(n; j)x^j(1-x)^(n-j)f(j/n), (1) (Gzyl and Palacios 1997, Mathé ...

Let f be a bounded analytic function on D(0,1) vanishing to order m>=0 at 0 and let {a_j} be its other zeros, listed with multiplicities. Then ...