##### Subgroups of simple primitive permutation groups defined by unordered relations
The problem of describing the invariance groups of unordered relations, called briefly \emph{relation groups}, goes back to classical work by H. Wielandt. In general, the problem turned out to be hard, and so far it has been settled only for a few special classes of permutation groups. The problem have been solved, in particular, for the class of primitive permutation groups, using the classification of finite simple groups and other deep results of permutation group theory. In this paper we show that, if $G$ is a finite simple primitive permutation group other then the alternating group $A_n$, then each subgroup of $G$, with four exceptions, is a relation group.
###### NurtureToken New!

Token crowdsale for this paper ends in

###### Authors

Are you an author of this paper? Check the Twitter handle we have for you is correct.

###### Subcategories

#1. Which part of the paper did you read?

#2. The paper contains new data or analyses that is openly accessible?
#3. The conclusion is supported by the data and analyses?
#4. The conclusion is of scientific interest?
#5. The result is likely to lead to future research?

User:
Repo:
Stargazers:
0
Forks:
0
Open Issues:
0
Network:
0
Subscribers:
0
Language:
None
Views:
0
Likes:
0
Dislikes:
0
Favorites:
0
0
###### Other
Sample Sizes (N=):
Inserted:
Words Total:
Words Unique:
Source:
Abstract:
[5, 6, 7, 8, 9]
07/15/19 06:02PM
2,800
902
###### Tweets
mathGRbot: Mariusz Grechand, Andrzej Kisielewicz : Subgroups of simple primitive permutation groups defined by unordered relations https://t.co/lXkiH2hYxp https://t.co/KemoCpqt4j