Search Results for ""

Given a planar graph G, a geometric dual graph and combinatorial dual graph can be defined. Whitney showed that these are equivalent (Harary 1994), so that one may speak of ...

The Eisenstein integers, sometimes also called the Eisenstein-Jacobi integers (Finch 2003, p. 601), are numbers of the form a+bomega, where a and b are normal integers, ...

The elliptic curve factorization method, abbreviated ECM and sometimes also called the Lenstra elliptic curve method, is a factorization algorithm that computes a large ...

A Gaussian integer is a complex number a+bi where a and b are integers. The Gaussian integers are members of the imaginary quadratic field Q(sqrt(-1)) and form a ring often ...

A graphic sequence is a sequence of numbers which can be the degree sequence of some graph. A sequence can be checked to determine if it is graphic using GraphicQ[g] in the ...

For an integer n>=2, let gpf(x) denote the greatest prime factor of n, i.e., the number p_k in the factorization n=p_1^(a_1)...p_k^(a_k), with p_i<p_j for i<j. For n=2, 3, ...

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 ...

An International Standard Book Number (ISBN) is a code used to uniquely identify a book together. It also uniquely encodes the book's publisher and includes information about ...

Let omega_1 and omega_2 be periods of a doubly periodic function, with tau=omega_2/omega_1 the half-period ratio a number with I[tau]!=0. Then Klein's absolute invariant ...

Landau's function g(n) is the maximum order of an element in the symmetric group S_n. The value g(n) is given by the largest least common multiple of all partitions of the ...