Search Results for ""

The Nauru graph is the name given by Eppstein (2007) to the generalized Petersen graph GP(12,5) on 24 nodes and 36 edges which is also cubic symmetric graph F_(024)A, the ...

An incidence system (v, k, lambda, r, b) in which a set X of v points is partitioned into a family A of b subsets (blocks) in such a way that any two points determine lambda ...

While many computations admit shortcuts that allow them to be performed more rapidly, others cannot be sped up. Computations that cannot be sped up by means of any shortcut ...

If a discrete group of displacements in the plane has more than one center of rotation, then the only rotations that can occur are by 2, 3, 4, and 6. This can be shown as ...

For a real number x in (0,1), let m be the number of terms in the convergent to a regular continued fraction that are required to represent n decimal places of x. Then Lochs' ...

Modular arithmetic is the arithmetic of congruences, sometimes known informally as "clock arithmetic." In modular arithmetic, numbers "wrap around" upon reaching a given ...

A prime ideal is an ideal I such that if ab in I, then either a in I or b in I. For example, in the integers, the ideal a=<p> (i.e., the multiples of p) is prime whenever p ...

The logarithmic integral is defined as the Cauchy principal value li(x) = PVint_0^x(dt)/(lnt) (1) = ...

A twin prime cluster of order n is a collection of 2n consecutive prime numbers such that consecutive pairs form twin primes. Twin prime clusters were discussed by Mudge ...

Multiple series generalizations of basic hypergeometric series over the unitary groups U(n+1). The fundamental theorem of U(n) series takes c_1, ..., c_n and x_1, ..., x_n as ...