Search Results for ""

Discrepancy is a measure of the deviation of a point set from a uniform distribution. In general, the computation of the discrepancy of a point set is computationally ...

The length of the largest-sized square contained within the Ferrers diagram of a partition. Its size can be determined using DurfeeSquare[f] in the Wolfram Language package ...

An n×n matrix A is an elementary matrix if it differs from the n×n identity I_n by a single elementary row or column operation.

The matrix operations of 1. Interchanging two rows or columns, 2. Adding a multiple of one row or column to another, 3. Multiplying any row or column by a nonzero element.

The series sumf(n) for a monotonic nonincreasing f(x) is convergent if lim_(x->infty)^_(e^xf(e^x))/(f(x))<1 and divergent if lim_(x->infty)__(e^xf(e^x))/(f(x))>1.

A closed ideal I in a C^*-algebra A is called essential if I has nonzero intersection with every other nonzero closed ideal A or, equivalently, if aI={0} implies a=0 for all ...

A bounded operator U on a Hilbert space H is called essentially unitary if U^*U-I and UU^*-I are compact operators.

The kurtosis excess of a distribution is sometimes called the excess, or excess coefficient. In graph theory, excess refers to the quantity e=n-n_l(v,g) (1) for a v-regular ...

A class of processes which attempt to round off a domain and simplify its theory by adjoining elements.

A line segment connecting nonadjacent polyhedron vertices sharing a common face in a parallelepiped or other similar solid.