Search Results for ""

Let t be a nonnegative integer and let x_1, ..., x_t be nonzero elements of Z_p which are not necessarily distinct. Then the number of elements of Z_p that can be written as ...

A clause is a disjunction of literals.

A set function mu is said to possess countable subadditivity if, given any countable disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union ...

A topology is given by a collection of subsets of a topological space X. The smallest topology has two open sets, the empty set emptyset and X. The largest topology contains ...

There are two similar but distinct concepts related to equidecomposability: "equidecomposable" and "equidecomposable by dissection." The difference is in that the pieces ...

Let S be a set of n+1 symbols, then a Howell design H(s,2n) on symbol set S is an s×s array H such that 1. Every cell of H is either empty or contains an unordered pair of ...

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 ...

Given f:X->Y, the image of x is f(x). The preimage of y is then f^(-1)(y)={x|f(x)=y}, or all x whose image is y. Images are elements of the range, while preimages are subsets ...

Let S be a collection of subsets of a set X and let mu:S->[0,infty] be a set function. The function mu is called a premeasure provided that mu is finitely additive, countably ...

A proper subset S^' of a set S, denoted S^' subset S, is a subset that is strictly contained in S and so necessarily excludes at least one member of S. The empty set is ...