Related papers: An algorithm to construct candidates to counterexa…

I. Hambleton, L. Taylor and B. Williams conjectured a general formula in spirit of H. Lenstra for the decomposition of $G_n(RG)$ for any finite group $G$ and noetherian ring $R.$ The conjectured decomposition was shown to hold for some…

We obtain many results and solve some problems about feebly compact paratopological groups. We obtain necessary and sufficient conditions for such a group to be topological. One of them is the quasiregularity. We prove that each…

Let $G$ be a reductive algebraic group---possibly non-connected---over a field $k$ and let $H$ be a subgroup of $G$. If $G= GL_n$ then there is a degeneration process for obtaining from $H$ a completely reducible subgroup $H'$ of $G$; one…

We develop practical techniques to compute with arithmetic groups $H\leq \mathrm{SL}(n,\mathbb{Q})$ for $n>2$. Our approach relies on constructing a principal congruence subgroup in $H$. Problems solved include testing membership in $H$,…

Suppose that $G$ is a finite group such that $\operatorname{SL}(n,q)\subseteq G \subseteq \operatorname{GL}(n,q)$, and that $Z$ is a central subgroup of $G$. Let $T(G/Z)$ be the abelian group of equivalence classes of endotrivial…

In analogy with the free factors of a free group we define special factors of Generalized Baumslag-Solitar (GBS) groups as non-cyclic subgroups which appear in splittings over infinite cyclic groups. We give an algorithm which, given a GBS…

Let \(\nu_p(G)\) be the number of Sylow \(p\)-subgroups of a finite group \(G\), let \(\sigma_p(G)\) be their common order, and set \[ \gamma(G)=\int_0^1\sum_{p\in\pi(G)}\nu_p(G)x^{\sigma_p(G)}\,dx…

We present a generic algorithm for computing discrete logarithms in a finite abelian p-group H, improving the Pohlig-Hellman algorithm and its generalization to noncyclic groups by Teske. We then give a direct method to compute a basis for…

The main result of this paper states that for any group $G$ with an automatic structure $L$ with unique representatives one can construct a uniform partial algorithm which detects $L$-rational subgroups and gives their preimages in $L$.…

We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…

The study of finite subgroups of a simple algebraic group $G$ reduces in a sense to those which are almost simple. If an almost simple subgroup of $G$ has a socle which is not isomorphic to a group of Lie type in the underlying…

Let $G$ be a finite group and $\psi(G)=\sum_{g\in{G}}{o(g)}$. There are some results about the relation between $\psi(G)$ and the structure of $G$. For instance, it is proved that if $G$ is a group of order $n$ and…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

In this article, we review the proofs of the first Zassenhaus Conjecture on conjugacy of torsion units in integral group rings for the alternating groups of degree 5 and 6, by Luthar-Passi and Hertweck. We describe how the study of these…

We study the finitely generated abelian group $T(G)$ of endo-trivial $kG$-modules where $kG$ is the group algebra of a finite group $G$ over a field of characteristic $p>0$. When the representation type of the group algebra is not wild, the…

An algorithm is constructed that, when given an explicit presentation of a finitely generated nilpotent group $G,$ decides for any pair of endomorphisms $\varphi, \psi : G \to G$ and any pair of elements $u, v \in G,$ whether or not the…

In this paper, we show that each finite group $G$ containing at most $p^2$ Sylow $p$-subgroups for each odd prime number $p$, is a solvable group. In fact, we give a positive answer to the conjecture in \cite{Rob}.

As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…

This paper is centered around the classical problem of extracting properties of a finite group $G$ from the ring isomorphism class of its integral group ring $\mathbb{Z} G$. This problem is considered via describing the unit group…

The note contains a few results related to separation axioms and automatic continuity of operations in compact-like semitopological groups. In particular, is presented a semiregular semitopological group $G$ which is not $T_3$. We show that…