English
Related papers

Related papers: Normal restriction in finite groups

200 papers

In this paper, we study the residual solvability of the generalized free product of solvable groups.

Group Theory · Mathematics 2011-03-23 Delaram Kahrobaei , Stephen Majewicz

Let $G$ be a finite group. In this short note, we give a criterion of nilpotency of $G$ based on the existence of elements of certain order in each section of $G$.

Group Theory · Mathematics 2018-02-13 Marius Tărnăuceanu

In this article we prove results about finite soluble groups that act with fixity 2 or 3.

Group Theory · Mathematics 2024-12-23 Paula Hähndel , Christoph Möller , Rebecca Waldecker

In 1968, John Thompson proved that a finite group $G$ is solvable if and only if every $2$-generator subgroup of $G$ is solvable. In this paper, we prove that solvability of a finite group $G$ is guaranteed by a seemingly weaker condition:…

Group Theory · Mathematics 2010-08-02 Silvio Dolfi , Marcel Herzog , Cheryl E. Praeger

Say that a finite group $G$ is mixable if a product of random elements, each chosen independently from two options, can distribute uniformly on $G$. We present conditions and obstructions to mixability. We show that $2$-groups, the…

Group Theory · Mathematics 2025-01-30 Gideon Amir , Guy Blachar , Subhajit Ghosh , Uzi Vishne

Let $G$ be a finite group and $\psi(G) = \sum_{g \in G} o(g)$, where $o(g)$ denotes the order of $g \in G$. In [M. Herzog, et. al., Two new criteria for solvability of finite groups, J. Algebra, 2018], the authors put forward the following…

Group Theory · Mathematics 2018-08-02 Morteza Baniasad Azad , Behrooz Khosravi

We provide new bounds for the divisibility function of the free group F_2 and construct short laws for the symmetric groups Sym(n). The construction is random and relies on the classification of the finite simple groups. We also give bounds…

Group Theory · Mathematics 2014-05-21 Gady Kozma , Andreas Thom

We give a new criterion for solvability of group equations, providing proofs of various generalizations of the Kervaire-Laudenbach conjecture for Connes-embeddable groups.

Group Theory · Mathematics 2021-09-27 Martin Nitsche , Andreas Thom

We describe finite soluble groups in which every $n$-maximal subgroup is $\mathfrak F$-subnormal.

Group Theory · Mathematics 2013-05-06 Vika A. Kovaleva , Alexander N. Skiba

Necessary and sufficient conditions for the solvability of boundary value problems for a family of functional differential equations with a non-integrable singularity are obtained.

Classical Analysis and ODEs · Mathematics 2013-07-16 Eugene Bravyi

In 1968, John Thompson proved that a finite group G is solvable if and only if every 2-generator subgroup of G is solvable. In this paper, we prove that solvability of a finite group G is guaranteed by a seemingly weaker condition: G is…

Group Theory · Mathematics 2014-02-26 Silvio Dolfi , Robert Guralnick , Marcel Herzog , Cheryl Praeger

Thompson's theorem stated that a finite group $G$ is solvable if and only if every $2$-generated subgroup of $G$ is solvable. In this paper, we prove some new criteria for both solvability and nilpotency of a finite group using certain…

Group Theory · Mathematics 2024-02-29 Hung P. Tong-Viet

In this paper, we study the structures of finite groups using some arithmetic conditions on the sizes of real conjugacy classes. We prove that a finite group is solvable if the prime graph on the real class sizes of the group is…

Group Theory · Mathematics 2018-03-06 Hung P. Tong-Viet

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

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

Group Theory · Mathematics 2019-12-03 Mark Pengitore

Given a finite group $G$, we denote by $\nu(G)$ the probability that two randomly chosen elements of $G$ generate a nilpotent subgroup. We prove that if $\nu(G)>1/12,$ then $G$ is solvable.

Group Theory · Mathematics 2026-04-07 Andrea Lucchini

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ß

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 the paper new criteria of existence and conjugacy of Hall subgroups of finite groups are given.

Group Theory · Mathematics 2012-05-14 Wenbin Guo , Alexander N. Skiba

A covering of a group is a finite set of proper subgroups whose union is the whole group. A covering is minimal if there is no covering of smaller cardinality, and it is nilpotent if all its members are nilpotent subgroups. We complete a…

Group Theory · Mathematics 2014-09-29 Russell D. Blyth , Francesco Fumagalli , Marta Morigi