Search Results for ""

The kissing number of a sphere is 12. This led Fejes Tóth (1943) to conjecture that in any unit sphere packing, the volume of any Voronoi cell around any sphere is at least ...

Fractran is an algorithm applied to a given list f_1, f_2, ..., f_k of fractions. Given a starting integer N, the FRACTRAN algorithm proceeds by repeatedly multiplying the ...

The maximum possible weight of a fractional clique of a graph G is called the fractional clique number of G, denoted omega^*(G) (Godsil and Royle 2001, pp. 136-137) or ...

The Gibbs phenomenon is an overshoot (or "ringing") of Fourier series and other eigenfunction series occurring at simple discontinuities. It can be reduced with the Lanczos ...

A matrix H with elements H_(ij)=(i+j-1)^(-1) (1) for i,j=1, 2, ..., n. Hilbert matrices are implemented in the Wolfram Language by HilbertMatrix[m, n]. The figure above shows ...

A clause (i.e., a disjunction of literals) is called a Horn clause if it contains at most one positive literal. Horn clauses are usually written as L_1,...,L_n=>L(=¬L_1 v ... ...

Suppose x_1<x_2<...<x_n are given positive numbers. Let lambda_1, ..., lambda_n>=0 and sum_(j=1)^(n)lambda_j=1. Then ...

Let E(k) and K(k) be complete elliptic integrals of the first and second kinds, with E^'(k) and K^'(k) the complementary integrals. Then ...

Linkages are linked (or constrained) mechanical structures such as those used in robots, excavators, engines, etc. They are also extensively used for character animation in ...

The longest path problem asks to find a path of maximum length in a given graph. The problem is NP-complete, but there exists an efficient dynamic programming solution for ...