English
Related papers

Related papers: A new solvability criterion for finite groups

200 papers

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…

Computational Complexity · Computer Science 2020-10-23 Paweł Idziak , Piotr Kawałek , Jacek Krzaczkowski , Armin Weiß

Let $G$ be a finite group, $N(G)$ be the set of conjugacy classes of the group $G$. In the present paper it is proved $G\simeq L$ if $N(G)=N(L)$, where $G$ is a finite group with trivial center and $L$ is a finite simple group.

Group Theory · Mathematics 2018-06-25 Ilya Gorshkov

Considering a finite group $G$, for any element $x\in G$, the solvabilizer of $x$ in $G$ is defined as $Sol_G(x)=\{y \in G : \langle x, y \rangle \text{ is solvable}\}$. In this paper, we introduce $Solv(G)$ as the number of distinct…

Group Theory · Mathematics 2025-12-02 Banafsheh Akbari , Ethan Han , Sasha Lin , Benjamin Vakil

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…

For a finite group $G$ denote by $N(G)$ the set of conjugesy class sizes of $G$. We show that every finite group $G$ with the property $N(G)=N(Alt_n), n>4$ or $N(G)=N(Sym_n), n>22$ is non-solvable.

Group Theory · Mathematics 2015-02-12 Ilya B. Gorshkov

In this paper, we will show that if for every nonlinear complex irreducible character of a finite group G, some multiple of it is induced from an irreducible character of some proper subgroup of G, then G is solvable. This is a…

Group Theory · Mathematics 2012-11-09 Tung Le , Jamshid Moori , Hung P. Tong-Viet

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. Under some restrictions on the number of conjugacy classes of (non-normal) maximal subgroups of $G$, we prove that if $\sigma_1(G)<\frac{117}{20}\,$, then $G$ is…

Group Theory · Mathematics 2024-09-23 Marius Tărnăuceanu

A theorem of Z. Arad and E. Fisman establishes that if $A$ and $B$ are two conjugacy classes of a finite group $G$ such that either $AB=A\cup B$ or $AB=A^{-1} \cup B$, then $G$ cannot be non-abelian simple. We demonstrate that, in fact,…

Group Theory · Mathematics 2024-10-04 Antonio Beltrán , María José Felipe , Carmen Melchor

Bouc proposed the following conjecture: a finite group $G$ is nilpotent if and only if its largest quotient $B$-group $\beta(G)$ is nilpotent. And he has prove that this conjecture holds when $G$ is solvable. In this paper, we consider the…

Group Theory · Mathematics 2019-05-17 Xingzhong Xu , Jiping Zhang

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this note, we prove that if $\sigma_1(G)<\frac{117}{20}$, then $G$ is solvable. Moreover, we have $\sigma_1(G)=\frac{117}{20}$ if and only if $G\cong A_5$.…

Group Theory · Mathematics 2019-08-13 Marius Tărnăuceanu

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.

Group Theory · Mathematics 2011-09-23 Michael J. J. Barry

Let G be a finite group. Denote by \psi(G) the sum \psi(G)=\sum_{x\in G}|x| where |x| denotes the order of the element x, and by o(G) the quotient o(G)=\frac{\psi(G)}{|G|}. Confirming a conjecture posed by E.I. Khukhro, A. Moreto and M.…

Group Theory · Mathematics 2021-12-09 M. Herzog , P. Longobardi , M. Maj

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…

Group Theory · Mathematics 2025-02-07 M. Amiri , I. Kashuba , I. Lima

We say that a finite group $G$ satisfies the independence property if, for every pair of distinct elements $x$ and $y$ of $G$, either $\{x,y\}$ is contained in a minimal generating set for $G$ or one of $x$ and $y$ is a power of the other.…

Group Theory · Mathematics 2023-05-30 Saul D. Freedman , Andrea Lucchini , Daniele Nemmi , Colva M. Roney-Dougal

The set of finitely generated subgroups of the group $PL_+(I)$ of orientation-preserving piecewise-linear homeomorphisms of the unit interval includes many important groups, most notably R.~Thompson's group $F$. In this paper we show that…

Group Theory · Mathematics 2016-05-23 Collin Bleak , Tara Brough , Susan Hermiller

In this paper, we provide new criteria for the solvability and supersolvability of a finite group based on its number of cyclic subgroups. A finite group G is called n-cyclic if it contains n cyclic subgroups. This paper also partially…

Group Theory · Mathematics 2026-04-28 Angsuman Das , Khyati Sharma

In this paper, we consider solvable groups that satisfy the two-prime hypothesis. We prove that if $G$ is such a group and $G$ has no nonabelian nilpotent quotients, then $|\cd G| \le 462,515$. Combining this result with the result from…

Group Theory · Mathematics 2010-10-20 James Hamblin , Mark L. Lewis

We construct a solvable group G of order 5648590729620 such that the set of element orders of G coincides with that of the simple group S(4,3). This completes the determination of finite simple groups isospectral to solvable groups.

Group Theory · Mathematics 2012-02-16 Andrei V. Zavarnitsine

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…

Group Theory · Mathematics 2019-04-02 Afsaneh Bahri , Behrooz Khosravi , Zeinab Akhlaghi

We show that for any finite group $G$ and for any $d$ there exists a word $w\in F_{d}$ such that a $d$-tuple in $G$ satisfies $w$ if and only if it generates a solvable subgroup. In particular, if $G$ itself is not solvable, then it cannot…

Group Theory · Mathematics 2007-05-23 Miklos Abert