Related papers: Formations of Finite Groups in Polynomial Time: th…

For a wide family of formations $\mathfrak{F}$ it is proved that the $ \mathfrak{F}$-residual of a permutation finite group can be computed in a polynomial time. Moreover, if in the previous case $\mathfrak{F}$ is hereditary, then an…

For a wide family of formations $\mathfrak{F}$ (which includes Baer-local formations) it is proved that the $ \mathfrak{F}$-hypercenter of a permutation finite group can be computed in polynomial time. In particular, the algorithms for…

L.A. Shemetkov posed a Problem 9.74 in Kourovka Notebook to find all local formations $\mathfrak{F}$ of finite groups such that every finite minimal non-$\mathfrak{F}$-group is either a Schmidt group or a group of prime order. All known…

A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and…

Let $R$ be a finite commutative ring with $1\ne 0$. The set $\mathcal{F}(R)$ of polynomial functions on $R$ is a finite commutative ring with pointwise operations. Its group of units $\mathcal{F}(R)^\times$ is just the set of all…

We show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word problem in the automorphism group of such a group is decidable…

We present the ideas behind an algorithm to compute normalizers of primitive groups with non-regular socle in polynomial time. We highlight a concept we developed called permutation morphisms and present timings for a partial implementation…

Let G=Aut_K (K(x)) be the Galois group of the transcendental degree one pure field extension K(x)/K. In this paper we describe polynomial time algorithms for computing the field Fix(H) fixed by a subgroup H < G and for computing the fixing…

We establish the structure of finite groups with $\mathfrak{F}$-subnormal or self-normalizing primary cyclic subgroups in case $\mathfrak{F}$ is a subgroup-closed saturated superradical formation containing all nilpotent groups.

We propose a polynomial time $f$-algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over $\mathbb{F}_q$) for computing an isomorphism (if there is any) of a finite dimensional…

Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…

All groups under consideration are finite. Let $\sigma =\{\sigma_i \mid i\in I \}$ be some partition of the set of $\mathbb{P}$, $G$ be a group, and $\mathfrak F$ be a class of groups. Then $\sigma (G)=\{\sigma_i\mid \sigma_i\cap \pi (G)\ne…

In this paper, we investigate the complexity of computing minimal faithful permutation representations for groups without abelian normal subgroups (a.k.a. Fitting-free groups). When our groups are given as quotients of permutation groups,…

Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…

The use of permutation polynomials has appeared, along to their compositional inverses, as a good choice in the implementation of cryptographic systems. Hence, there has been a demand for constructions of these polynomials which…

We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…

We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…

We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can…

Choose a random degree d poly f with coefficients in a finite field F. We estimate the ultimate period of f under compositional iteration. We also determine the joint distribution of the small cycle lengths in the graph with edges (x,f(x)),…