Search Results for ""

The flower snarks, denoted J_n for n=5, 7, 9, ..., are a family of graphs discovered by Isaacs (1975) which are snarks. The construction for flower snarks may be generalized ...

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs, including the Herschel graph and the Goldner-Harary ...

The Meringer graph is one of the four (5,5)-cage graphs, discovered by Meringer (1999) after it had long been thought that only three such cages existed. Like the other ...

The usual number of scalar operations (i.e., the total number of additions and multiplications) required to perform n×n matrix multiplication is M(n)=2n^3-n^2 (1) (i.e., n^3 ...

The only known classically known algebraic curve of curve genus g>1 that has an explicit parametrization (x(t),y(t)) in terms of standard special functions (Burnside 1893, ...

Let (K,L) be a pair consisting of finite, connected CW-complexes where L is a subcomplex of K. Define the associated chain complex C(K,L) group-wise for each p by setting ...

Define a power difference prime as a number of the form n^n-(n-1)^(n-1) that is prime. The first few power difference primes then have n=2, 3, 4, 7, 11, 17, 106, 120, 1907, ...

A group or other algebraic object is said to be Abelian (sometimes written in lower case, i.e., "abelian") if the law of commutativity always holds. The term is named after ...

The nonconservation of adiabatic invariants which arises in systems with three or more degrees of freedom.

Three elements x, y and z of a set S are said to be associative under a binary operation * if they satisfy x*(y*z)=(x*y)*z. (1) Real numbers are associative under addition ...