Search Results for ""

An n-Hadamard graph is a graph on 4n vertices defined in terms of a Hadamard matrix H_n=(h)_(ij) as follows. Define 4n symbols r_i^+, r_i^-, c_i^+, and c_i^-, where r stands ...

The numerical value of Khinchin's constant K is given by K=2.685452001... (OEIS A002210). However, the numerical value of K is notoriously difficult to calculate to high ...

The Knödel graph W_(Delta,n) is a regular bipartite graph of vertex degree Delta on n nodes for even n>=2 and 1<=Delta<=|_log_2n_| with edges defined as follows. Label the ...

The numerical value of ln10 is given by ln10=2.302585092994045684... (OEIS A002392). It was computed to 10^(11) decimal digits by S. Kondo on May 20, 2011 (Yee). The Earls ...

A nonhamiltonian graph is a graph that is not Hamiltonian. All disconnected graphs are therefore nonhamiltoinian, as are acylic graphs. Classes of connected graphs that are ...

An algorithm which can be used to find integer relations between real numbers x_1, ..., x_n such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. Although the algorithm ...

Consider the plane figure obtained by drawing each diagonal in a regular polygon with n vertices. If each point of intersection is associated with a node and diagonals are ...

Quantifier elimination is the removal of all quantifiers (the universal quantifier forall and existential quantifier exists ) from a quantified system. A first-order theory ...

Any square matrix T has a canonical form without any need to extend the field of its coefficients. For instance, if the entries of T are rational numbers, then so are the ...

The Rhind papyrus is a famous document from the Egyptian Middle Kingdom that dates to 1650 BC. It was purchased by Henry Rhind in Egypt in 1858, and placed in the British ...