Groups whose orders factorise into at most four primes

نویسندگان

چکیده

The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types n together with effective algorithms enumerate, construct, identify these groups. are implemented for computer algebra system GAP.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orders of CM elliptic curves modulo p with at most two primes

Nowadays the generation of cryptosystems requires two main aspects. First the security, and then the size of the keys involved in the construction and comunication process. About the former one needs a difficult mathematical assumption which ensures your system will not be broken unless a well known difficult problem is solved. In this context one of the most famous assumption underlying a wide...

متن کامل

Fite : Groups Whose Orders Are Powers of a Prime

In this article two somewhat distinct methods are used to study the properties of groups whose orders are powers of a prime. What may, for the purpose of distinction, be called the usual method is applied in the first part to establish certain properties of the commutators of a group. The commutators are differentiated among themselves by the introduction of the notion of successive commutators...

متن کامل

On finite loops whose inner mapping groups have small orders

We investigate the situation that the inner mapping group of a loop is of order which is a product of two small prime numbers and we show that then the loop is soluble.

متن کامل

The Number of Finite Groups Whose Element Orders is Given

The spectrum ω(G) of a finite group G is the set of element orders of G. If Ω is a non-empty subset of the set of natural numbers, h(Ω) stands for the number of isomorphism classes of finite groups G with ω(G) = Ω and put h(G) = h(ω(G)). We say that G is recognizable (by spectrum ω(G)) if h(G) = 1. The group G is almost recognizable (resp. nonrecognizable) if 1 < h(G) < ∞ (resp. h(G) = ∞). In t...

متن کامل

Characterization of some projective special linear groups in dimension four by their orders and degree patterns

‎Let $G$ be a finite group‎. ‎The degree pattern of $G$ denoted by‎ ‎$D(G)$ is defined as follows‎: ‎If $pi(G)={p_{1},p_{2},...,p_{k}}$ such that‎ ‎$p_{1}

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2022

ISSN: ['1095-855X', '0747-7171']

DOI: https://doi.org/10.1016/j.jsc.2021.04.005