Search Results for ""

For some authors (e.g., Bourbaki, 1964), the same as principal ideal domain. Most authors, however, do not require the ring to be an integral domain, and define a principal ...

A two-dimensional map also called the Taylor-Greene-Chirikov map in some of the older literature and defined by I_(n+1) = I_n+Ksintheta_n (1) theta_(n+1) = theta_n+I_(n+1) ...

In the early 1960s, B. Birch and H. P. F. Swinnerton-Dyer conjectured that if a given elliptic curve has an infinite number of solutions, then the associated L-series has ...

Tarski's theorem says that the first-order theory of reals with +, *, =, and > allows quantifier elimination. Algorithmic quantifier elimination implies decidability assuming ...

A traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...

A biconnected graph is a connected graph having no articulation vertices (Skiena 1990, p. 175). An equivalent definition for graphs on more than two vertices is a graph G ...

The hypothesis that an integer n is prime iff it satisfies the condition that 2^n-2 is divisible by n. Dickson (2005, p. 91) stated that Leibniz believe to have proved that ...

A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...

A hyper-Kähler manifold can be defined as a Riemannian manifold of dimension 4n with three covariantly constant orthogonal automorphisms I, J, K of the tangent bundle which ...

An independent edge set, also called a matching, of a graph G is a subset of the edges such that no two edges in the subset share a vertex in G. A maximum independent edge ...