Search Results for ""

The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

In a cochain complex of modules ...->C^(i-1)->^(d^(i-1))C^i->^(d^i)C^(i+1)->..., the module B^i of i-coboundaries is the image of d^(i-1). It is a submodule of C^i and is ...

Also called Macaulay ring, a Cohen Macaulay ring is a Noetherian commutative unit ring R in which any proper ideal I of height n contains a sequence x_1, ..., x_n of elements ...

The number 163 is very important in number theory, since d=163 is the largest number such that the imaginary quadratic field Q(sqrt(-d)) has class number h(-d)=1. It also ...

A hypergeometric class of orthogonal polynomials defined by R_n(lambda(x);alpha,beta,gamma,delta) =_4F_3(-n,n+alpha+beta+1,-x,x+gamma+delta+1; alpha+1,beta+delta+1,gamma+1;1) ...

A finite group G has a finite number of conjugacy classes and a finite number of distinct irreducible representations. The group character of a group representation is ...

A set is a finite or infinite collection of objects in which order has no significance, and multiplicity is generally also ignored (unlike a list or multiset). Members of a ...

The number one (1), also called "unity," is the first positive integer. It is an odd number. Although the number 1 used to be considered a prime number, it requires special ...

If f has no spectrum in [-lambda,lambda], then ||f||_infty<=pi/(2lambda)||f^'||_infty (1) (Bohr 1935). A related inequality states that if A_k is the class of functions such ...

A Borel set is an element of a Borel sigma-algebra. Roughly speaking, Borel sets are the sets that can be constructed from open or closed sets by repeatedly taking countable ...