Search Results for ""

The thickness (or depth) t(G) (Skiena 1990, p. 251; Beineke 1997) or theta(G) (Harary 1994, p. 120) of a graph G is the minimum number of planar edge-induced subgraphs P_i of ...

A method for generating random (pseudorandom) numbers using the linear recurrence relation X_(n+1)=aX_n+c (mod m), where a and c must assume certain fixed values, m is some ...

For every even dimension 2n, the symplectic group Sp(2n) is the group of 2n×2n matrices which preserve a nondegenerate antisymmetric bilinear form omega, i.e., a symplectic ...

Let J be a finite group and the image R(J) be a representation which is a homomorphism of J into a permutation group S(X), where S(X) is the group of all permutations of a ...

Let theta be an irrational number, define S(theta)={c+dtheta:c,d in N}, and let c_n(theta)+thetad_n(theta) be the sequence obtained by arranging the elements of S(theta) in ...

A classic arithmetical problem probably first posed by Euclid and investigated by various authors in the Middle Ages. The problem is formulated as a dialogue between the two ...

Let B_k be the kth Bernoulli number and consider nB_(n-1)=-1 (mod n), where the residues of fractions are taken in the usual way so as to yield integers, for which the ...

Three point geometry is a finite geometry subject to the following four axioms: 1. There exist exactly three points. 2. Two distinct points are on exactly one line. 3. Not ...

Andrica's conjecture states that, for p_n the nth prime number, the inequality A_n=sqrt(p_(n+1))-sqrt(p_n)<1 holds, where the discrete function A_n is plotted above. The ...

Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...