Search Results for ""

A set X is said to be nowhere dense if the interior of the set closure of X is the empty set. For example, the Cantor set is nowhere dense. There exist nowhere dense sets of ...

The n-Pasechnik graph is a strongly regular graph on (4n-1)^2 vertices constructed from a skew Hadamard matrix of order 4n. It has regular parameters . The 1-Pasechnik is ...

For a permutation alpha in the symmetric group S_p, the alpha-permutation graph of a labeled graph G is the graph union of two disjoint copies of G (say, G_1 and G_2), ...

A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...

Let X be a set. Then a sigma-algebra F is a nonempty collection of subsets of X such that the following hold: 1. X is in F. 2. If A is in F, then so is the complement of A. ...

Let A denote an R-algebra, so that A is a vector space over R and A×A->A (1) (x,y)|->x·y, (2) where x·y is vector multiplication which is assumed to be bilinear. Now define ...

In the usual diagram of inclusion homomorphisms, if the upper two maps are injective, then so are the other two. More formally, consider a space X which is expressible as the ...

Let O be an incidence geometry, i.e., a set with a symmetric, reflexive binary relation I. Let e and f be elements of O. Let an incidence plane be an incidence geometry whose ...

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

There are at least two distinct notions known as the Whitehead group. Given an associative ring A with unit, the Whitehead group associated to A is the commutative quotient ...