Subgroups of minimal index in polynomial time

07/31/2018
by   Saveliy V. Skresanov, et al.
0

Let G be a finite group and let H be a proper subgroup of G of minimal index. By applying an old result of Y. Berkovich, we provide a polynomial algorithm for computing |G : H| for a permutation group G. Moreover, we find H explicitly if G is given by a Cayley table. As a corollary, we get an algorithm for testing whether a finite permutation group acts on a tree or not.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/31/2018

On subgroups of minimal index

Let G be a group possessing a proper subgroup of finite index. We prove ...
research
12/21/2019

Two-closure of supersolvable permutation group in polynomial time

The 2-closure G of a permutation group G on Ω is defined to be the large...
research
02/08/2022

Two-closure of rank 3 groups in polynomial time

A finite permutation group G on Ω is called a rank 3 group if it has pre...
research
05/15/2023

Algorithms for the Minimum Generating Set Problem

For a finite group G, the size of a minimum generating set of G is denot...
research
02/01/2018

A group law for PKC purposes

Let F be a field, let V=F^3, and let A V→ V a linear map. The polynomial...
research
01/29/2018

An Algorithm to Decompose Permutation Representations of Finite Groups: Polynomial Algebra Approach

We describe an algorithm for splitting a permutation representation of a...
research
07/01/2020

Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach

Let f̃(X)∈ℤ[X] be a degree-n polynomial such that f(X):=f̃(X) p factoriz...

Please sign up or login with your details

Forgot password? Click here to reset