Abstract. We present polynomial-time algorithms for computation in quotient groups G/K of a permutation group G. In effect, these solve, for quotient groups ...
People also ask
Recommendations · A generalized notion of quotient for finite Abelian groups. A finite Abelian group G is partitioned into subsets which are translations of ...
A quotient group or factor group is a mathematical group obtained by aggregating similar elements of a larger group using an equivalence relation
Mar 15, 1990 · Computing in Quotient Groups i. William M. Kantor2. Mathematics Department. University of Oregon. Eugene, OR 97403. Eugene M. Luks3. Computer ...
Abstract. We present polynomial-time algorithms for computation in quotient groups G=K of a permutation group G. In effect, these solve, for quotient groups, ...
A software package designed to solve computationally hard problems in algebra, number theory, geometry and combinatorics.
This identification is done via equivalence classes! Even numbers are an equivalence class, and so are odd numbers.