Search Results for ""

An algorithm for computing the eigenvalues and eigenvectors for large symmetric sparse matrices.

The conjecture that the Artin L-function of any n-dimensional complex representation of the Galois group of a finite extension of the rational numbers Q is an Artin ...

A submodule L of a module M such that for any other nonzero submodule K of M, the intersection L intersection K is not the zero module. L is also called an essential ...

The statistical index P_L=(sump_nq_0)/(sump_0q_0), where p_n is the price per unit in period n and q_0 is the quantity produced in the initial period.

A generalization of the concept of set unions and intersections.

A distinct (including reflections and rotations) arrangement of adjacent squares on a grid, also called a fixed polyomino.

A discrete distribution of a random variable such that every possible value can be represented in the form a+bn, where a,b!=0 and n is an integer.

A lattice embedding is a one-to-one lattice homomorphism.

In the plane, there are 17 lattice groups, eight of which are pure translation. In R^3, there are 32 point groups and 230 space groups. In R^4, there are 4783 space lattice ...

A point at the intersection of two or more grid lines in a point lattice.