Search Results for ""

An algorithm for computing an Egyptian fraction.

A problem in the theory of algebraic invariants that was solved by Hilbert using an existence proof.

A metric characterizing the difference between two knots K and K^' in S^3.

The set of graph eigenvalues of the adjacency matrix is called the spectrum of the graph. (But note that in physics, the eigenvalues of the Laplacian matrix of a graph are ...

A type of integral named after Henstock and Kurzweil. Every Lebesgue integrable function is HK integrable with the same value.

A group having an infinite number of elements. Some infinite groups, such as the integers or rationals, are not continuous groups.

A bound on error-correcting codes.

A conjecture concerning primes.

Zygmund (1988, p. 192) noted that there exists a number alpha_0 in (0,1) such that for each alpha>=alpha_0, the partial sums of the series sum_(n=1)^(infty)n^(-alpha)cos(nx) ...

A maximum clique of a graph G is a clique (i.e., complete subgraph) of maximum possible size for G. Note that some authors refer to maximum cliques simply as "cliques." The ...