English
Related papers

Related papers: Finite groups in which every proper characteristic…

200 papers

We introduce two common divisor graphs associated with a finite skew brace, based on its $\lambda$- and $\theta$-orbits. We prove that the number of connected components is at most two and the diameter of a connected component is at most…

Combinatorics · Mathematics 2025-02-04 Silvia Properzi , Arne Van Antwerpen

A rank $n$ generalized Baumslag-Solitar group is a group that splits as a finite graph of groups such that all vertex and edge groups are isomorphic to $\mathbb{Z}^n$. In this paper we classify these groups in terms of their separability…

Group Theory · Mathematics 2025-01-31 Jone Lopez de Gamiz Zearra , Sam Shepherd

Let $k$ be an algebraically closed field of characteristic $p>0$ and let $C/k$ be a smooth connected affine curve. Denote by $\pi_1(C)$ its algebraic fundamental group. The goal of this paper is to characterize a certain subset of closed…

Algebraic Geometry · Mathematics 2013-12-03 Amilcar Pacheco , Pavel Zalesskii , Katherine F. Stevenson

In this paper, we classify all the finite groups $G$ such that the commuting graph $\Gamma_C(G)$, order-sum graph $\Gamma_{OS}(G)$ and non-inverse graph $\Gamma_{NI}(G)$ are minimally edge connected graphs. We also classify all the finite…

Combinatorics · Mathematics 2024-12-02 Siddharth Malviy , Vipul Kakkar

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

Group Theory · Mathematics 2019-05-31 S. P. Glasby

In this article, we introduce the study of a class of finite groups $G$ which admits a subgroup which intersects all non-trivial subgroups of $G$. We also explore a subclass of it consisting of all groups $G$ in which the prime order…

Group Theory · Mathematics 2023-10-20 Angsuman Das , Arnab Mandal

A group is called a CA-group if the centralizer of every non-central element is abelian. Furthermore, a group is called a minimal non-CA-group if it is not a CA-group itself, but all of its proper subgroups are. In this paper, we give a…

Group Theory · Mathematics 2019-12-18 L. Jafari , S. Kohl , M. Zarrin

Consider a graph $\Gamma$. 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 containing cycles. If $\Gamma$ has a cyclic vertex cutset, then it…

Combinatorics · Mathematics 2025-04-02 Ramesh Prasad Panda

Let W be an arbitrary Coxeter group. If two elements have expressions that are cyclic shifts of each other (as words), then they are conjugate (as group elements) in W. We say that w is "cyclically fully commutative" (CFC) if every cyclic…

Combinatorics · Mathematics 2024-02-12 Tomas Boothby , Jeffrey Burkert , Morgan Eichwald , R. M. Green , Dana C. Ernst , Matthew Macauley

The authors classify the finite index subgroups of R. Thompson's group $F$. All such groups that are not isomorphic to $F$ are non-split extensions of finite cyclic groups by $F$. The classification describes precisely which finite index…

Group Theory · Mathematics 2007-11-08 Collin Bleak , Bronlyn Wassink

A group $G$ is said to be $\frac{3}{2}$-generated if every nontrivial element belongs to a generating pair. It is easy to see that if $G$ has this property then every proper quotient of $G$ is cyclic. In this paper we prove that the…

Group Theory · Mathematics 2021-02-02 Timothy C. Burness , Robert M. Guralnick , Scott Harper

Let $\mathcal C$ be a class of Hausdorff topological semigroups which contains all zero-dimensional Hausdorff topological semigroups. A semigroup $X$ is called $\mathcal C$-$closed$ if $X$ is closed in each topological semigroup $Y\in…

Commutative Algebra · Mathematics 2022-02-08 Taras Banakh , Serhii Bardyla

Let $ G $ be a finite group and $ \chi \in \mathrm{Irr}(G) $. Define $ \mathrm{cv}(G)=\{\chi(g)\mid \chi \in \mathrm{Irr}(G), g\in G \} $, $ \mathrm{cv}(\chi)=\{\chi(g)\mid g\in G \} $ and denote $ \mathrm{dl}(G) $ by the derived length of…

Group Theory · Mathematics 2025-04-01 Sesuai Y. Madanha , X. Mbaale , Tendai M. Mudziiri Shumba

Recent results of Qu and Tuarnauceanu describe explicitly the finite p-groups which are not elementary abelian and have the property that the number of their subgroups is maximal among p-groups of a given order. We complement these results…

Group Theory · Mathematics 2020-09-21 Stefanos Aivazidis , Thomas Müller

In this note we establish the existence of all Curtis-Tits groups and Phan groups with $3$-spherical diagram as classified previously and investigate some of their geometric and group theoretic properties. Whereas it is known that…

Group Theory · Mathematics 2016-11-04 Rieuwert J. Blok , Corneliu G Hoffman

Let $G$ be a group and $S$ an inverse closed subset of $G\setminus \{1\}$. By a Cayley graph $Cay(G,S)$ we mean the graph whose vertex set is the set of elements of $G$ and two vertices $x$ and $y$ are adjacent if $x^{-1}y\in S$. A group…

Group Theory · Mathematics 2017-10-13 A. Abdollahi , M. Zallaghi

In a finite group, a subset is called a Lagrange subset if its size divides the group order, and a factor if it admits a complementary subset. We provide a new and comparatively direct proof of the classification of groups in which every…

Group Theory · Mathematics 2025-12-30 Mikhail Kabenyuk

The spectrum of a finite group is the set of element orders of this group. The main goal of this paper is to survey results concerning recognition of finite simple groups by spectrum, in particular, to list all finite simple groups for…

Group Theory · Mathematics 2024-06-06 Maria A. Grechkoseeva , Victor D. Mazurov , Wujie Shi , Andrey V. Vasil'ev , Nanying Yang

The cyclic matching sequenceability of a simple graph $G$, denoted $\mathrm{cms}(G)$, is the largest integer $s$ for which there exists a cyclic ordering of the edges of $G$ so that every set of $s$ consecutive edges forms a matching. In…

Combinatorics · Mathematics 2021-06-23 Daniel Horsley , Adam Mammoliti

A circulant is a Cayley graph over a cyclic group. A well-covered graph is a graph in which all maximal stable sets are of the same size, or in other words, they are all maximum. A CIS graph is a graph in which every maximal stable set and…

Combinatorics · Mathematics 2014-02-11 Endre Boros , Vladimir Gurvich , Martin Milanic