On subgroups of minimal index

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

Let G be a group possessing a proper subgroup of finite index. We prove that if H is a proper subgroup of G of minimal index, then G/core_G(H) is a (finite) simple group. As a corollary, a polynomial algorithm for computing |G : H| for a finite permutation group G is suggested. The latter result yields 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

Subgroups of minimal index in polynomial time

Let G be a finite group and let H be a proper subgroup of G of minimal i...
research
08/13/2019

Beyond the Inverted Index

In this paper, a new data structure named group-list is proposed. The gr...
research
07/24/2023

A Degree Bound For The c-Boomerang Uniformity Of Permutation Monomials

Let 𝔽_q be a finite field of characteristic p. In this paper we prove th...
research
03/23/2023

Nominal Sets in Agda – A Fresh and Immature Mechanization

In this paper we present our current development on a new formalization ...
research
02/13/2023

Computing the congruences of a finite semigroup or monoid

In this paper we describe two different algorithms for computing the con...
research
09/09/2023

Transitions in echo index and dependence on input repetitions

The echo index counts the number of simultaneously stable asymptotic res...
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...

Please sign up or login with your details

Forgot password? Click here to reset