English
Related papers

Related papers: Nilpotent Groups are Round

200 papers

In this note, we show that among finite nilpotent groups of a given order or finite groups of a given odd order, the cyclic group of that order has the minimum number of edges in its cyclic subgroup graph. We also conjecture that this holds…

Group Theory · Mathematics 2023-02-14 Marius Tărnăuceanu

We provide an explicit construction for a complete set of orthogonal primitive idempotents of finite group algebras over nilpotent groups. Furthermore, we give a complete set of matrix units in each simple epimorphic image of a finite group…

Representation Theory · Mathematics 2013-02-19 Inneke Van Gelder , Gabriela Olteanu

We introduce the concept of quantifying the extent to which a finitely generated group is residually finite. The quantification is carried out for some examples including free groups, the first Grigorchuk group, finitely generated nilpotent…

Group Theory · Mathematics 2010-04-16 Khalid Bou-Rabee

A finite group $G$ is called a Schur group if every $S$-ring over $G$ is schurian, i.e. associated in a natural way with a subgroup of $\sym(G)$ that contains all right translations. We prove that every nonabelian nilpotent Schur group…

Group Theory · Mathematics 2022-09-02 Grigory Ryabov

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…

Group Theory · Mathematics 2024-02-27 N. Ahmadkhah , M. Zarrin

We study random nilpotent groups in the well-established style of random groups, by choosing relators uniformly among freely reduced words of (nearly) equal length and letting the length tend to infinity. Whereas random groups are quotients…

Group Theory · Mathematics 2017-03-29 Matthew Cordes , Moon Duchin , Yen Duong , Meng-Che Ho , Andrew P. Sánchez

In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.

Group Theory · Mathematics 2018-05-24 Marius Tărnăuceanu

In this article, we introduce the concept of nilpotent graph of a finite commutative ring. The set of all non nilpotent elements of a ring is taken as the vertex set and two vertices are adjacent if and only if their sum is nilpotent. We…

Rings and Algebras · Mathematics 2018-04-25 Dhiren Kumar Basnet , Ajay Sharma , Rahul Dutta

In this paper we consider two functions related to the arithmetic and geometric means of element orders of a finite group, showing that certain lower bounds on such functions strongly affect the group structure. In particular, for every…

Group Theory · Mathematics 2023-03-07 Valentina Grazian , Carmine Monetta , Marialaura Noce

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components each containing a cycle. If $\Gamma$ has a…

Combinatorics · Mathematics 2025-04-29 Ramesh Prasad Panda , Papi Ray

A group is called capable if it is a central factor group. We consider the capability of nilpotent products of cyclic groups, and obtain a generalization of a theorem of Baer for the metabelian small class case. The approach is also used to…

Group Theory · Mathematics 2007-05-23 Arturo Magidin

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

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

Group Theory · Mathematics 2022-02-11 Dominik Bernhardt , Tim Boykett , Alice Devillers , Johannes Flake , S. P. Glasby

We make a list of finite simple groups whose group rings over a given field are serial.

Rings and Algebras · Mathematics 2017-01-16 Andrei Kukharev , Gena Puninski

We reformulate several basic notions of notions in finite group theory in terms of iterations of the lifting property (orthogonality) with respect to particular morphisms. Our examples include the notions being nilpotent, solvable, perfect,…

Group Theory · Mathematics 2019-06-06 Misha Gavrilovich

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

We call a finite group irrational if none of its elements is conjugate to a distinct power of itself. We prove that those groups are solvable and describe certain classes of these groups, where the above property is only required for…

Group Theory · Mathematics 2018-07-11 Andreas Bächle , Benjamin Sambale

The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of…

Group Theory · Mathematics 2025-02-11 Costantino Delizia , Michele Gaeta , Mark L. Lewis , Carmine Monetta

Let $G$ be a finite group, $L_1(G)$ be its poset of cyclic subgroups and consider the quantity $\alpha(G)=\frac{|L_1(G)|}{|G|}$. The aim of this paper is to study the class $\cal{C}$ of finite nilpotent groups having…

Group Theory · Mathematics 2018-05-02 Marius Tărnăuceanu , Mihai-Silviu Lazorec

A subgroup of a finite group is wide if each prime divisor of the group order divides the subgroup order. We obtain the description of finite soluble groups with no wide subgroups. We also prove that a finite soluble group with nilpotent…

Group Theory · Mathematics 2018-02-23 V. S. Monakhov , I. L. Sokhor