On computing the closures of solvable permutation groups
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929371369963520 |
|---|---|
| author | Ponomarenko, Ilia Vasil'ev, Andrey V. |
| author_facet | Ponomarenko, Ilia Vasil'ev, Andrey V. |
| contents | Let $m\ge 3$ be an integer. It is proved that the $m$-closure of a given solvable permutation group of degree $n$ can be constructed in time $n^{O(m)}$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2304_02817 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | On computing the closures of solvable permutation groups Ponomarenko, Ilia Vasil'ev, Andrey V. Group Theory 20B25, 20B40 F.2.2 Let $m\ge 3$ be an integer. It is proved that the $m$-closure of a given solvable permutation group of degree $n$ can be constructed in time $n^{O(m)}$. |
| title | On computing the closures of solvable permutation groups |
| topic | Group Theory 20B25, 20B40 F.2.2 |
| url | https://arxiv.org/abs/2304.02817 |