Search Results for ""

Let L be a lattice (or a bounded lattice or a complemented lattice, etc.), and let C_L be the covering relation of L: C_L={(x,y) in L^2|x covers y or y covers x}. Then C_L is ...

A lattice L is locally subbounded if and only if each of its finite subsets is contained in a finitely generated bounded sublattice of L. Every locally bounded lattice is ...

Let any finite or infinite set of points having no finite limit point be prescribed and associate with each of its points a principal part, i.e., a rational function of the ...

In 1979, Conway and Norton discovered an unexpected intimate connection between the monster group M and the j-function. The Fourier expansion of j(tau) is given by (1) (OEIS ...

Simplemindedly, a number theoretic transform is a generalization of a fast Fourier transform obtained by replacing e^(-2piik/N) with an nth primitive root of unity. This ...

Numerical differentiation is the process of finding the numerical value of a derivative of a given function at a given point. In general, numerical differentiation is more ...

The pair group of a group G is the group that acts on the 2-subsets of {1,...,p} whose permutations are induced by G. Pair groups can be calculated using PairGroup[g] in the ...

Given a smooth manifold M with an open cover U_i, a partition of unity subject to the cover U_i is a collection of smooth, nonnegative functions psi_i, such that the support ...

A point group is a group of symmetry operations which all leave at least one point unmoved. Although an isolated object may have an arbitrary Schönflies symbol, the ...

The highest order power in a univariate polynomial is known as its order (or, more properly, its polynomial degree). For example, the polynomial ...