Search Results for ""

There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, ...

The Thue-Morse constant, also called the parity constant, is given by the concatenated digits of the Thue-Morse sequence P=0.0110100110010110100101100..._2 (1) (OEIS A010060) ...

Thurston's conjecture proposed a complete characterization of geometric structures on three-dimensional manifolds. Before stating Thurston's geometrization conjecture in ...

The trefoil knot 3_1, also called the threefoil knot or overhand knot, is the unique prime knot with three crossings. It is a (3, 2)-torus knot and has braid word sigma_1^3. ...

The triangular graph T_n=L(K_n) is the line graph of the complete graph K_n (Brualdi and Ryser 1991, p. 152). The vertices of T_n may be identified with the 2-subsets of ...

An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...

A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...

A unit-distance graph is a distance graph having an embedding in the Euclidean plane (unit-distance embedding) in which vertices are distinct points and all edges are of ...

As a consequence of Matiyasevich's refutation of Hilbert's 10th problem, it can be proved that there does not exist a general algorithm for solving a general quartic ...

Hilbert's problems are a set of (originally) unsolved problems in mathematics proposed by Hilbert. Of the 23 total appearing in the printed address, ten were actually ...