Name
Abstract | ||
|---|---|---|
The 2-closure
$$\overline{G}$$
of a permutation group G on
$$\Omega$$
is
defined to be the largest permutation group on
$$\Omega$$
, having the
same orbits on
$$\Omega \times \Omega$$
as G. It is proved that ifG is supersolvable, then
$$\overline{G}$$
can be found in polynomial time
in
$$|\Omega|$$
. As a by-product of our technique, it is shown that
the composition factors of
$$\overline{G}$$
are cyclic or alternating. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s00037-020-00195-7 | computational complexity |
Keywords | DocType | Volume |
Permutation group, 2-closure, Polynomial-time algorithm, 20B25, 20B40 | Journal | 29 |
Issue | ISSN | Citations |
1 | 1016-3328 | 0 |
PageRank | References | Authors |
0.34 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ilia N. Ponomarenko | 1 | 40 | 7.24 |
| Vasil'ev Andrey | 2 | 0 | 0.34 |