Search Results for ""

A graph or directed graph together with a function which assigns a positive real number to each edge (Harary 1994, p. 52).

An odd number is an integer of the form n=2k+1, where k is an integer. The odd numbers are therefore ..., -3, -1, 1, 3, 5, 7, ... (OEIS A005408), which are also the gnomonic ...

For an n-dimensional map, the Lyapunov characteristic exponents are given by sigma_i=lim_(N->infty)ln|lambda_i(N)| for i=1, ..., n, where lambda_i is the Lyapunov ...

The path covering number (or path-covering number; Slater 1972) of a graph G, variously denoted as summarized below, is the minimum number of vertex-disjoint paths that cover ...

The permutohedron is the n-dimensional generalization of the hexagon. The n-permutohedron is the convex hull of all permutations of the vector (x_1,x_2,...,x_(n+1)) in ...

A function or curve is piecewise continuous if it is continuous on all but a finite number of points at which certain matching conditions are sometimes required.

Let chi be a nonprincipal number theoretic character over Z/Zn. Then for any integer h, |sum_(x=1)^hchi(x)|<=2sqrt(n)lnn.

When the group order h of a finite group is a prime number, there is only one possible group of group order h. Furthermore, the group is cyclic.

A number r is an nth root of unity if r^n=1 and a primitive nth root of unity if, in addition, n is the smallest integer of k=1, ..., n for which r^k=1.

A Proth number is a number of the form N=k·2^n+1 for odd k, n a positive integer, and 2^n>k. The 2^n>k condition is needed since otherwise, every odd number >1 would be a ...