Standard

The 3-closure of a solvable permutation group is solvable. / O'Brien, E. A.; Ponomarenko, I.; Vasil'ev, A. V. et al.

In: Journal of Algebra, Vol. 607, 01.10.2022, p. 618-637.

Research output: Contribution to journalArticlepeer-review

Harvard

APA

Vancouver

O'Brien EA, Ponomarenko I, Vasil'ev AV, Vdovin E. The 3-closure of a solvable permutation group is solvable. Journal of Algebra. 2022 Oct 1;607:618-637. doi: 10.1016/j.jalgebra.2021.07.002

Author

O'Brien, E. A. ; Ponomarenko, I. ; Vasil'ev, A. V. et al. / The 3-closure of a solvable permutation group is solvable. In: Journal of Algebra. 2022 ; Vol. 607. pp. 618-637.

BibTeX

@article{5aa3add88c37463f8d28a0388ac3506d,
title = "The 3-closure of a solvable permutation group is solvable",
abstract = "Let m be a positive integer and let Ω be a finite set. The m-closure of G≤Sym(Ω) is the largest permutation group on Ω having the same orbits as G in its induced action on the Cartesian product Ωm. The 1-closure and 2-closure of a solvable permutation group need not be solvable. We prove that the m-closure of a solvable permutation group is always solvable for m≥3.",
keywords = "Finite groups, m-closure, Permutation groups",
author = "O'Brien, {E. A.} and I. Ponomarenko and Vasil'ev, {A. V.} and E. Vdovin",
note = "Funding Information: O'Brien was supported by the Marsden Fund of New Zealand grant UOA 107 ; Ponomarenko and Vasil'ev were supported by the Mathematical Center in Akademgorodok under agreement No. 075-15-2019-1613 with the Ministry of Science and Higher Education of the Russian Federation ; Vdovin was supported by the RFBR grant No. 18-01-00752 . We thank the referee for helpful feedback. Publisher Copyright: {\textcopyright} 2021 Elsevier Inc.",
year = "2022",
month = oct,
day = "1",
doi = "10.1016/j.jalgebra.2021.07.002",
language = "English",
volume = "607",
pages = "618--637",
journal = "Journal of Algebra",
issn = "0021-8693",
publisher = "Academic Press Inc.",

}

RIS

TY - JOUR

T1 - The 3-closure of a solvable permutation group is solvable

AU - O'Brien, E. A.

AU - Ponomarenko, I.

AU - Vasil'ev, A. V.

AU - Vdovin, E.

N1 - Funding Information: O'Brien was supported by the Marsden Fund of New Zealand grant UOA 107 ; Ponomarenko and Vasil'ev were supported by the Mathematical Center in Akademgorodok under agreement No. 075-15-2019-1613 with the Ministry of Science and Higher Education of the Russian Federation ; Vdovin was supported by the RFBR grant No. 18-01-00752 . We thank the referee for helpful feedback. Publisher Copyright: © 2021 Elsevier Inc.

PY - 2022/10/1

Y1 - 2022/10/1

N2 - Let m be a positive integer and let Ω be a finite set. The m-closure of G≤Sym(Ω) is the largest permutation group on Ω having the same orbits as G in its induced action on the Cartesian product Ωm. The 1-closure and 2-closure of a solvable permutation group need not be solvable. We prove that the m-closure of a solvable permutation group is always solvable for m≥3.

AB - Let m be a positive integer and let Ω be a finite set. The m-closure of G≤Sym(Ω) is the largest permutation group on Ω having the same orbits as G in its induced action on the Cartesian product Ωm. The 1-closure and 2-closure of a solvable permutation group need not be solvable. We prove that the m-closure of a solvable permutation group is always solvable for m≥3.

KW - Finite groups

KW - m-closure

KW - Permutation groups

UR - http://www.scopus.com/inward/record.url?scp=85110998304&partnerID=8YFLogxK

U2 - 10.1016/j.jalgebra.2021.07.002

DO - 10.1016/j.jalgebra.2021.07.002

M3 - Article

AN - SCOPUS:85110998304

VL - 607

SP - 618

EP - 637

JO - Journal of Algebra

JF - Journal of Algebra

SN - 0021-8693

ER -

ID: 34108115