Search Results for ""

A class number formula is a finite series giving exactly the class number of a ring. For a ring of quadratic integers, the class number is denoted h(d), where d is the ...

A partition p is said to contain another partition q if the Ferrers diagram of p contains the Ferrers diagram of q. For example, {3,3,2} (left figure) contains both {3,3,1} ...

One of the Plücker characteristics, defined by p=1/2(n-1)(n-2)-(delta+kappa)=1/2(m-1)(m-2)-(tau+iota), where m is the class, n the order, delta the number of nodes, kappa the ...

For discrete problems in which no efficient solution method is known, it might be necessary to test each possibility sequentially in order to determine if it is the solution. ...

If x_1<x_2<...<x_n denote the zeros of p_n(x), there exist real numbers lambda_1,lambda_2,...,lambda_n such that ...

A symmetric block design (4n+3, 2n+1, n) which is equivalent to a Hadamard matrix of order 4n+4. It is conjectured that Hadamard designs exist for all integers n>0, but this ...

Let M_r be an r-rowed minor of the nth order determinant |A| associated with an n×n matrix A=a_(ij) in which the rows i_1, i_2, ..., i_r are represented with columns k_1, ...

In a lattice, any two elements a and b have a least upper bound. This least upper bound is often called the join of a and b, and is denoted by a v b. One can also speak of ...

A number triangle of order n with entries 1 to n such that entries are nondecreasing across rows and down columns and all entries in column j are less than or equal to j. An ...

In a lattice, any two elements a and b have a greatest lower bound. This greatest lower bound is often called the meet of a and b, and is denoted by a ^ b. One can also speak ...