Search Results for ""

A k-partite graph is a graph whose graph vertices can be partitioned into k disjoint sets so that no two vertices within the same set are adjacent.

n-minex is defined as 10^(-n).

n-plex is defined as 10^n.

A p-elementary subgroup of a finite group G is a subgroup H which is the group direct product H=C_n×P, where P is a p-group, C_n is a cyclic group, and p does not divide n.

A p-system of a set S is a sequence of subsets A_1, A_2, ..., A_p of S, among which some may be empty or coinciding with each other.

A real number that is b-normal for every base 2, 3, 4, ... is said to be absolutely normal. As proved by Borel (1922, p. 198), almost all real numbers in [0,1) are absolutely ...

An automorphic graph is a distance-transitive graph Gamma for which the automorphism group Aut(Gamma) acts primitively on the vertices of Gamma and is not a complete graph or ...

An infinite sequence of positive integers 1<=b_1<b_2<b_3<..., (1) also called a Sidon sequence, such that all pairwise sums b_i+b_j (2) for i<=j are distinct (Guy 1994). An ...

The sequence a(n) given by the exponents of the highest power of 2 dividing n, i.e., the number of trailing 0s in the binary representation of n. For n=1, 2, ..., the first ...

The bracket polynomial is one-variable knot polynomial related to the Jones polynomial. The bracket polynomial, however, is not a topological invariant, since it is changed ...