Search Results for ""

Let L be a language of first-order predicate logic, let I be an indexing set, and for each i in I, let A_i be a structure of the language L. Let u be an ultrafilter in the ...

Let any finite or infinite set of points having no finite limit point be prescribed, and associate with each of its points a definite positive integer as its order. Then ...

An s-route of a graph G is a sequence of vertices (v_0,v_1,...,v_s) of G such that v_iv_(i+1) in E(G) for i=0, 1, ..., s-1 (where E(G) is the edge set of G) and ...

A finite group is a group having finite group order. Examples of finite groups are the modulo multiplication groups, point groups, cyclic groups, dihedral groups, symmetric ...

A finite simple group of Lie-type. The following table summarizes the types of twisted Chevalley groups and their respective orders. In the table, q denotes a prime power and ...

An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...

The Bonferroni correction is a multiple-comparison correction used when several dependent or independent statistical tests are being performed simultaneously (since while a ...

A doubly nonnegative matrix is a real positive semidefinite n×n square matrix with nonnegative entries. Any doubly nonnegative matrix A of order n can be expressed as a Gram ...

The graph diameter of a graph is the length max_(u,v)d(u,v) of the "longest shortest path" (i.e., the longest graph geodesic) between any two graph vertices (u,v), where ...

Laguerre-Gauss quadrature, also called Gauss-Laguerre quadrature or Laguerre quadrature, is a Gaussian quadrature over the interval [0,infty) with weighting function ...