Search Results for ""

The irrational constant R = e^(pisqrt(163)) (1) = 262537412640768743.9999999999992500... (2) (OEIS A060295), which is very close to an integer. Numbers such as the Ramanujan ...

A solvable group is a group having a normal series such that each normal factor is Abelian. The special case of a solvable finite group is a group whose composition indices ...

Calculus I

The m×n rook graph (confusingly called the m×n grid by Brouwer et al. 1989, p. 440) and also sometimes known as a lattice graph (e.g., Brouwer) is the graph Cartesian product ...

For any ideal I in a Dedekind ring, there is an ideal I_i such that II_i=z, (1) where z is a principal ideal, (i.e., an ideal of rank 1). Moreover, for a Dedekind ring with a ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

A (0,1)-matrix is an integer matrix in which each element is a 0 or 1. It is also called a logical matrix, binary matrix, relation matrix, or Boolean matrix. The number of ...

A roulette is a curve traced by a fixed point on a closed convex curve as that curve rolls without slipping along a second curve. The roulettes described by the foci of ...

A polynomial with three terms.

The Brinkmann graph (misspelled by Cancela et al. (2004) as "Brinkman") is a weakly regular quartic graph on 21 vertices and 42 edges. It was first mentioned in Brinkmann ...