Search Results for ""

An algorithm for multiplying two 32-bit integers modulo a 32-bit constant without using any intermediates larger than 32 bits. It is also useful in certain types of random ...

There are seven frieze groups, which can be written in orbifold notation as *22infty, 2*infty, 22infty, *inftyinfty, infty*, inftyx, inftyinfty.

There are 14 families of spherical groups, which can be written in orbifold notation as *532, 532, *432, 432, *332, 3*2, 332, *22N, 2*N, 22N, *NN, N*, Nx, and NN.

In every residue class modulo p, there is exactly one integer polynomial with coefficients >=0 and <=p-1. This polynomial is called the normal polynomial modulo p in the ...

There are two types of bordism groups: bordism groups, also called cobordism groups or cobordism rings, and there are singular bordism groups. The bordism groups give a ...

If G is a perfect group, then the group center of the quotient group G/Z(G), where Z(G) is the group center of G, is the trivial group.

A function f mapping a set X->X/R (X modulo R), where R is an equivalence relation in X, is called a canonical map.

A group action G×X->X is called free if, for all x in X, gx=x implies g=I (i.e., only the identity element fixes any x). In other words, G×X->X is free if the map G×X->X×X ...

Any linear system of point-groups on a curve with only ordinary singularities may be cut by adjoint curves.

Given a group G, the algebra CG is a vector space CG={suma_ig_i|a_i in C,g_i in G} of finite sums of elements of G, with multiplication defined by g·h=gh, the group ...