Search Results for ""

There are certain optimization problems that become unmanageable using combinatorial methods as the number of objects becomes large. A typical example is the traveling ...

A sequence of numbers V={nu_n} is complete if every positive integer n is the sum of some subsequence of V, i.e., there exist a_i=0 or 1 such that n=sum_(i=1)^inftya_inu_i ...

A number which can be represented by a finite number of additions, subtractions, multiplications, divisions, and finite square root extractions of integers. Such numbers ...

In real and functional analysis, equicontinuity is a concept which extends the notion of uniform continuity from a single function to collection of functions. Given ...

The Feit-Thompson conjecture asserts that there are no primes p and q for which (p^q-1)/(p-1) and (q^p-1)/(q-1) have a common factor. Parker noticed that if this were true, ...

Every finite simple group (that is not cyclic) has even group order, and the group order of every finite simple noncommutative group is doubly even, i.e., divisible by 4 ...

Let f be a function defined on a set A and taking values in a set B. Then f is said to be an injection (or injective map, or embedding) if, whenever f(x)=f(y), it must be the ...

Let L denote the partition lattice of the set {1,2,...,n}. The maximum element of L is M={{1,2,...,n}} (1) and the minimum element is m={{1},{2},...,{n}}. (2) Let Z_n denote ...

A topology tau on a topological vector space X=(X,tau) (with X usually assumed to be T2) is said to be locally convex if tau admits a local base at 0 consisting of balanced, ...

The sum c_q(m)=sum_(h^*(q))e^(2piihm/q), (1) where h runs through the residues relatively prime to q, which is important in the representation of numbers by the sums of ...