| 词条 | Subgroup method |
| 释义 | {{unreferenced|date=January 2019}} 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''' subgroup(g) sequence := (set of subgroups that will be used, depending on the method.) word := [] '''for''' subgroup in sequence coset_representatives := [] '''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{{Algorithm-stub}}{{Abstract-algebra-stub}} 1 : Group theory |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。