Related papers: On the odd order composition factors of finite lin…

We first obtain finiteness properties for the collection of closed normal subgroups of a compactly generated locally compact group. Via these properties, every compactly generated locally compact group admits an essentially chief series -…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…

We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…

Finite elements, which are well-known and studied in the framework of vector lattices, are investigated in $\ell$-algebras, preferably in $f$-algebras, and in product algebras. The additional structure of an associative multiplication leads…

Let G be the space of generating functions of a periodic infinite order linear recurrence. In this paper we provide an explicit procedure for computing a basis of G.

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…

We study linear divisibility sequences of order 4, providing a characterization by means of their characteristic polynomials and finding their factorization as a product of linear divisibility sequences of order 2. Moreover, we show a new…

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.

In the present work, we continue the research initiated in the preprint: V. G. Bardakov, A. L. Iskra, Orders of products of horizontal class transpositions, arXiv:2409.13341, and related to S. Kohl's question on the orders of products of…

In this paper, we characterize completely the structure of Clifford semigroups of matrices over an arbitrary field. It is shown that a semigroups of matrices of finite order is a Clifford semigroup if and only if it is isomorphic to a…

We shall given a new effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent, improving our old result in T. Yamada, Colloq. Math. 103 (2005), 303--307.

In this note we study a class of finite groups for which the orders of subgroups satisfy a certain inequality. In particular, characterizations of the well-known groups $\mathbb{Z}_2\times\mathbb{Z}_2$ and $S_3$ are obtained.

In this article, the order of some classes of fractional linear differential equations is determined, based on asymptotic behavior of the solution as time tends to infinity. The order of fractional derivative has been proved to be of great…

Two finite groups are said to have the same order type if for each positive integer $n$ both groups have the same number of elements of order $n$. In 1987 John G. Thompson asked if in this case the solvability of one group implies the…

We complete the classification of the finite special linear groups $\SL_n(q)$ which are $(2,3)$-generated, i.e., which are generated by an involution and an element of order $3$. This also gives the classification of the finite simple…

A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…

This article investigates the properties of order-divisor graphs associated with finite groups. An order-divisor graph of a finite group is an undirected graph in which the set of vertices includes all elements of the group, and two…

An example of two $\mathbb R$-factorizable groups whose product is not $\mathbb R$-factorizable is constructed. One of these groups is second-countable and the other Lindel\"of to any finite power.