Search Results for ""

A set A of integers is said to be one-one reducible to a set B (A<<_1B) if there is a one-one recursive function f such that for every x, x in A=>f(x) in B (1) and f(x) in ...

A set (usually of letters) from which a subset is drawn. A sequence of letters is called a word, and a set of words is called a code.

Quantifies deviation from translational invariance by describing the distribution of gaps within a set at multiple scales. The more lacunar a set, the more heterogeneous the ...

Every dense linear order complete set without endpoints having at most omega disjoint intervals is order isomorphic to the continuum of real numbers, where omega is the set ...

The closure of a set A is the smallest closed set containing A. Closed sets are closed under arbitrary intersection, so it is also the intersection of all closed sets ...

The dihedral group D_4 is one of the two non-Abelian groups of the five groups total of group order 8. It is sometimes called the octic group. An example of D_4 is the ...

The total power of a triangle is defined by P=1/2(a_1^2+a_2^2+a_3^2), (1) where a_i are the side lengths, and the "partial power" is defined by p_1=1/2(a_2^2+a_3^2-a_1^2). ...

A quartic symmetric graph on 30 nodes and 60 edges corresponding to the skeleton of the Archimdean icosidodecahedron, great dodecahemidodecahedron, great icosidodecahedron, ...

A palindromic prime is a number that is simultaneously palindromic and prime. The first few (base-10) palindromic primes are 2, 3, 5, 7, 11, 101, 131, 151, 181, 191, 313, ...

The Tilley graph is a polyhedral graph that arises in the investigation of Kempe chainsKempe Chain (Tilley 2018). It has 12 vertices, 29 edges, and 19 faces (one of which is ...