Misplaced Pages

Subgroup method

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
This article does not cite any sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Subgroup method" – news · newspapers · books · scholar · JSTOR (January 2019) (Learn how and when to remove this message)

The subgroup method is an algorithm used in the mathematical field of group theory. It is used to find the word of an element. It doesn't always return the minimal word, but it can return optimal words based on the series of subgroups that is used. The code looks like this:

function operate(element, generator)
    <returns generator operated on element>
function subgroup(g)
    sequence := (set of subgroups that will be used, depending on the method.)
    word := 
    for subgroup in sequence
        coset_representatives := 
        <fill coset_representatives with coset representatives of (next subgroup)/subgroup>
        for operation in coset_representatives
            if operate(g, operation) is in the next subgroup then
                append operation onto word
                g = operate(g, operation)
                break
    return word


Stub icon

This algorithms or data structures-related article is a stub. You can help Misplaced Pages by expanding it.

Stub icon

This group theory-related article is a stub. You can help Misplaced Pages by expanding it.

Categories: