Search Results for ""

A p-adic number is an extension of the field of rationals such that congruences modulo powers of a fixed prime p are related to proximity in the so called "p-adic metric." ...

A circle packing is an arrangement of circles inside a given boundary such that no two overlap and some (or all) of them are mutually tangent. The generalization to spheres ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

The factorial n! is defined for a positive integer n as n!=n(n-1)...2·1. (1) So, for example, 4!=4·3·2·1=24. An older notation for the factorial was written (Mellin 1909; ...

In Book IX of The Elements, Euclid gave a method for constructing perfect numbers (Dickson 2005, p. 3), although this method applies only to even perfect numbers. In a 1638 ...

The angles mpi/n (with m,n integers) for which the trigonometric functions may be expressed in terms of finite root extraction of real numbers are limited to values of m ...

An Abelian group is a group for which the elements commute (i.e., AB=BA for all elements A and B). Abelian groups therefore correspond to groups with symmetric multiplication ...

The associated Legendre polynomials P_l^m(x) and P_l^(-m)(x) generalize the Legendre polynomials P_l(x) and are solutions to the associated Legendre differential equation, ...