Search Results for ""

A connective in logic which yields true if any one of a sequence conditions is true, and false if all conditions are false. In formal logic, the term disjunction (or, more ...

A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...

A cactus graph, sometimes also called a cactus tree, a mixed Husimi tree, or a polygonal cactus with bridges, is a connected graph in which any two graph cycles have no edge ...

A connective in logic known as the "exclusive or," or exclusive disjunction. It yields true if exactly one (but not both) of two conditions is true. The XOR operation does ...

Let a spherical triangle be drawn on the surface of a sphere of radius R, centered at a point O=(0,0,0), with vertices A, B, and C. The vectors from the center of the sphere ...

If C_1, C_2, ...C_r are sets of positive integers and union _(i=1)^rC_i=Z^+, then some C_i contains arbitrarily long arithmetic progressions. The conjecture was proved by van ...

The Hofstadter ellipses are a family of triangle ellipses introduced by P. Moses in February 2005. The Hofstadter ellipse E(r) for parameter 0<r<1 is defined by the trilinear ...

For a nonzero real number r and a triangle DeltaABC, swing line segment BC about the vertex B towards vertex A through an angle rB. Call the line along the rotated segment L. ...

Elliptic curve primality proving, abbreviated ECPP, is class of algorithms that provide certificates of primality using sophisticated results from the theory of elliptic ...

The map which takes points on the surface of a sphere S^2 to their antipodal points.