Search Results for ""

A branch of mathematics which brings together ideas from algebraic geometry, linear algebra, and number theory. In general, there are two main types of K-theory: topological ...

Let s_k be the number of independent vertex sets of cardinality k in a graph G. The polynomial I(x)=sum_(k=0)^(alpha(G))s_kx^k, (1) where alpha(G) is the independence number, ...

A complete set of mutually conjugate group elements. Each element in a group belongs to exactly one class, and the identity element (I=1) is always in its own class. The ...

The cardinal number of any set is lower than the cardinal number of the set of all its subsets. A corollary is that there is no highest aleph (aleph).

A complex translation is a map of the form z|->z+a, where a is a fixed complex number, which corresponds to translation (shifting) of points the complex plane by the complex ...

The rank of a graph G is defined as r(G)=n-c, where n is the number of vertices on G and c is the number of connected components (Biggs 1993, p. 25).

As shown by Schur (1916), the Schur number S(n) satisfies S(n)<=R(n)-2 for n=1, 2, ..., where R(n) is a Ramsey number.

A function representable as a generalized Fourier series. Let R be a metric space with metric rho(x,y). Following Bohr (1947), a continuous function x(t) for (-infty<t<infty) ...

Let B_t={B_t(omega)/omega in Omega}, t>=0, be one-dimensional Brownian motion. Integration with respect to B_t was defined by Itô (1951). A basic result of the theory is that ...

The circle method is a method employed by Hardy, Ramanujan, and Littlewood to solve many asymptotic problems in additive number theory, particularly in deriving an asymptotic ...