Related papers: A note about solvable and non-solvable finite grou…

The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…

The solvability of monomial groups is a well-known result in character theory. Certain properties of Artin L-series suggest a generalization of these groups, namely to such groups where every irreducible character has some multiple which is…

We study equations in groups G with unique m-th roots for each positive integer m. A word equation in two letters is an expression of the form w(X,A) = B, where w is a finite word in the alphabet {X,A}. We think of A,B in G as fixed…

We give a description of a finite group whose maximal subgroups possess only soluble proper subgroups, which implies the answer to the well-known question on composition factors of finite groups, whose second maximal subgroups are soluble.

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

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…

A finite group $G$ is called monomial if every irreducible character of $G$ is induced from a linear character of some subgroup of $G$. One of the main questions regarding monomial groups is whether or not a normal subgroup $N$ of a…

Recent work of Kaplan and Levy refining a nonsolvability criterion proved by Thompson in his N-Groups paper prompts questions on whether certain conditions on groups are equivalent to nonsolvability.

For a finite group $G$, let $LC(G)$ be the subgroup generated by elements $x$ such that, for all $y \in G$ and all integers $n$, the order of $x^n y$ divides the least common multiple of the orders of $x$ and $y$. This subgroup is a…

For a finite group $G$ and an element $x\in G$, the subset $$ nil_G(x)=\{y\in G \mid <x,y>~~ is ~~ nilpotent\}$$ is called nilpotentizer of $x$ in $G$. In this paper, we give two solvabilty criteria for a finite group by the structure and…

We call an order type inscribable if it is realized by a point configuration where the extreme points are all on a circle. In this paper, we investigate inscribability of order types. We first show that every simple order type with at most…

In this paper, we study the product of orders of composition factors of odd order in a composition series of a finite linear group. First we generalize a result by Manz and Wolf about the order of solvable linear groups of odd order. Then…

We prove that if $G$ is a finite simple group which is the unit group of a ring, then $G$ is isomorphic to either (a) a cyclic group of order 2; (b) a cyclic group of prime order $2^k -1$ for some $k$; or (c) a projective special linear…

Let $n>0$ be an integer and $\mathcal{X}$ be a class of groups. We say that a group $G$ satisfies the condition $(\mathcal{X},n)$ whenever in every subset with $n+1$ elements of $G$ there exist distinct elements $x,y$ such that $<x,y>$ is…

In this paper we prove that any finite group of order $n$ can be viewed as the group of the solutions of a certain matrix equation $XB=BY$, where the unknowns $X,Y$ are two permutation matrices of order $n$ and $(1+k)n+2 $ respectively and…

Given a finite group $G$, we denote by $\psi\,'(G)$ the product of element orders of $G$. Our main result proves that the restriction of $\psi\,'$ to abelian $p$-groups of order $p^n$ is strictly increasing with respect to a natural order…

It is a theorem of Artin, Tits et al. that a finite simple group is determined by its order, with the exception of the groups (A_3(2), A_2(4)) and (B_n(q), C_n(q)) for n > 2, q odd. We investigate the situation for finite semisimple groups…

We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…

In this paper we study the ratio between the number of $p$-elements and the order of a Sylow $p$-subgroup of a finite group $G$. As well known, this ratio is a positive integer and we conjecture that, for every group $G$, it is at least the…

A finite group G is said to be a POS-group if the number of elements of every order occurring in G divides |G|. We answer two questions by Finch and Jones by providing an infinite family of nonabelian POS-groups with orders not divisible by…