Standard

Subgroups of minimal index in polynomial time. / Skresanov, Saveliy V.

In: Journal of Algebra and its Applications, Vol. 19, No. 1, 2050010, 01.01.2020.

Research output: Contribution to journal › Article › peer-review

Harvard

Skresanov, SV 2020, 'Subgroups of minimal index in polynomial time', Journal of Algebra and its Applications, vol. 19, no. 1, 2050010. https://doi.org/10.1142/S0219498820500103

APA

Skresanov, S. V. (2020). Subgroups of minimal index in polynomial time. Journal of Algebra and its Applications, 19(1), [2050010]. https://doi.org/10.1142/S0219498820500103

Vancouver

Skresanov SV. Subgroups of minimal index in polynomial time. Journal of Algebra and its Applications. 2020 Jan 1;19(1):2050010. doi: 10.1142/S0219498820500103

Author

Skresanov, Saveliy V. / Subgroups of minimal index in polynomial time. In: Journal of Algebra and its Applications. 2020 ; Vol. 19, No. 1.

BibTeX

@article{91e8349989aa48498bb87ed8efd9b031,
title = "Subgroups of minimal index in polynomial time",
abstract = "By applying an old result of Y. Berkovich, we provide a polynomial-time algorithm for computing the minimal possible index of a proper subgroup of a finite permutation group G. Moreover, we find that subgroup explicitly and within the same time if G is given by a Cayley table. As a corollary, we get an algorithm for testing whether or not a finite permutation group acts on a tree non-trivially.",
keywords = "group representability on trees, group representability problem, minimal permutation representation, permutation group algorithms, Subgroup of minimal index, FINITE",
author = "Skresanov, {Saveliy V.}",
year = "2020",
month = jan,
day = "1",
doi = "10.1142/S0219498820500103",
language = "English",
volume = "19",
journal = "Journal of Algebra and its Applications",
issn = "0219-4988",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "1",

}

RIS

TY - JOUR

T1 - Subgroups of minimal index in polynomial time

AU - Skresanov, Saveliy V.

PY - 2020/1/1

Y1 - 2020/1/1

N2 - By applying an old result of Y. Berkovich, we provide a polynomial-time algorithm for computing the minimal possible index of a proper subgroup of a finite permutation group G. Moreover, we find that subgroup explicitly and within the same time if G is given by a Cayley table. As a corollary, we get an algorithm for testing whether or not a finite permutation group acts on a tree non-trivially.

AB - By applying an old result of Y. Berkovich, we provide a polynomial-time algorithm for computing the minimal possible index of a proper subgroup of a finite permutation group G. Moreover, we find that subgroup explicitly and within the same time if G is given by a Cayley table. As a corollary, we get an algorithm for testing whether or not a finite permutation group acts on a tree non-trivially.

KW - group representability on trees

KW - group representability problem

KW - minimal permutation representation

KW - permutation group algorithms

KW - Subgroup of minimal index

KW - FINITE

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

U2 - 10.1142/S0219498820500103

DO - 10.1142/S0219498820500103

M3 - Article

AN - SCOPUS:85060685589

VL - 19

JO - Journal of Algebra and its Applications

JF - Journal of Algebra and its Applications

SN - 0219-4988

IS - 1

M1 - 2050010

ER -

ID: 18506803