Name
Abstract | ||
|---|---|---|
We show how to compute efficiently a lexicographic ordering for subgroups and cosets of permutation groups and, more generally, of finite groups with a faithful permutation representation. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1145/860854.860892 | ISSAC |
Keywords | Field | DocType |
permutation group,faithful permutation representation,finite group,algorithm,matrix group,total order,lexicographic order | Permutation graph,Discrete mathematics,Combinatorics,Symmetric group,Permutation,Cyclic permutation,Permutation matrix,Random permutation,Bit-reversal permutation,Partial permutation,Mathematics | Conference |
ISBN | Citations | PageRank |
1-58113-641-2 | 2 | 0.46 |
References | Authors | |
2 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Hulpke | 1 | 64 | 9.89 |
| Steve Linton | 2 | 10 | 1.39 |