English
Related papers

Related papers: Prime simplicial complexes of finite groups

200 papers

T.C. Burness and S.D. Scott \cite{3} classified finite groups $G$ such that the number of prime order subgroups of $G$ is greater than $|G|/2-1$. In this note, we study finite groups $G$ whose subgroup graph contains a vertex of degree…

Group Theory · Mathematics 2025-02-05 Marius Tărnăuceanu

Let $ H $ be a subgroup of a finite group $ G $. We say that $ H $ satisfies the partial $ \Pi $-property in $ G $ if there exists a $G$-chief series $ \varGamma_{G}: 1 =G_{0} < G_{1} < \cdot\cdot\cdot < G_{n}= G $ of $ G $ such that $ | G…

Group Theory · Mathematics 2024-07-16 Zhengtian Qiu , Adolfo Ballester-Bolinches

Let $H$ be a finite quasisimple classical group, i.e. $H$ is perfect and $S:=H/Z(H)$ is a finite simple classical group. We prove in this paper that, excluding the cases when the simple group $S$ has a very exceptional Schur multiplier such…

Group Theory · Mathematics 2011-08-16 Hung Ngoc Nguyen

A representation $\Phi: G \to \mathrm{GL}_n(\mathbb{F})$ of a finite group $G$ is called unisingular if the matrix $\Phi(g)$ admits $1$ as an eigenvalue for any $g\in G$. In this paper, we determine all the complex irreducible unisingular…

Group Theory · Mathematics 2025-11-25 Marco Antonio Pellegrini , Lorenzo Schena

A finite abstract simplicial complex G defines the Barycentric refinement graph phi(G) = (G,{ (a,b), a subset b or b subset a }) and the connection graph psi(G) = (G,{ (a,b), a intersected with b not empty }). We note here that both…

Combinatorics · Mathematics 2020-12-15 Oliver Knill

Let $G$ be a finite group. Denote by $\textrm{Irr}(G)$ the set of all irreducible complex characters of $G.$ Let $\textrm{cd}(G)=\{\chi(1)\;|\;\chi\in \textrm{Irr}(G)\}$ be the set of all irreducible complex character degrees of $G$…

Group Theory · Mathematics 2011-02-23 Hung P. Tong-Viet

Let $p$ be a prime and $\mathbb{F}_p$ be a finite field of $p$ elements. Let $\mathbb{F}_pG$ denote the group algebra of the finite $p$-group $G$ over the field $\mathbb{F}_p$ and $V(\mathbb{F}_pG)$ denote the group of normalized units in…

Group Theory · Mathematics 2024-01-02 Yulei Wang , Heguo Liu

In this paper we describe all the finite almost simple groups whose Gruenberg--Kegel graphs coincide with Gruenberg--Kegel graphs of finite solvable groups.

Group Theory · Mathematics 2016-06-14 Ilya B. Gorshkov , Natalia V. Maslova

Let $G$ be a finite insoluble group with soluble radical $ R(G)$. The solubility graph $\Gamma_{\rm S}(G)$ of $G$ is a simple graph whose vertices are the elements of $G\setminus R(G) $ and two distinct vertices $x$ and $y$ are adjacent if…

Group Theory · Mathematics 2023-05-29 Mina Poozesh , Yousef Zamani

The independence complex $\mathrm{Ind}(G)$ of a graph $G$ is the simplicial complex formed by its independent sets. This article introduces a deformation of the simplicial boundary map of $\mathrm{Ind}(G)$ that gives rise to a double…

Algebraic Topology · Mathematics 2020-10-01 Marko Berghoff

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 containing cycles. If $\Gamma$ has a cyclic…

Group Theory · Mathematics 2024-05-29 Ramesh Prasad Panda

We classify finite groups in which the centralisers of certain non-central elements are soluble. This includes a full structural description of groups whose non-central element centralisers are all soluble, and a reduction theorem for the…

Group Theory · Mathematics 2025-11-19 Valentina Grazian , Carmine Monetta , Gareth Tracey

Let $G$ be a free product of two groups with amalgamated subgroup, $\pi$ be either the set of all prime numbers or the one-element set \{$p$\} for some prime number $p$. Denote by $\Sigma$ the family of all cyclic subgroups of group $G$,…

Group Theory · Mathematics 2007-08-22 E. V. Sokolov

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple graph with vertex set $G$, in which two distinct vertices are adjacent if one of them is a power of the other. For an integer $n\geq 2$, let $C_n$ denote the cyclic group…

Combinatorics · Mathematics 2025-01-31 Sanjay Mukherjee , Kamal Lochan Patra , Binod Kumar Sahoo

The number of nonisomorphic simplicial complexes with up to $n$ vertices increases super-exponentially with $n$, which makes exhaustive computation of invariants associated with such complexes a daunting task. In this paper we provide a…

Algebraic Topology · Mathematics 2025-11-05 Dejan Govc , Wacław Marzantowicz , Łukasz Patryk Michalak , Petar Pavešić

To any finite group $G$, we may associate a graph whose vertices are the elements of $G$ and where two distinct vertices $x$ and $y$ are adjacent if and only if the order of the subgroup $\langle x, y\rangle$ is divisible by at least 3…

Group Theory · Mathematics 2023-09-12 Karmele Garatea-Zaballa , Andrea Lucchini

We call a set of positive integers closed under taking unitary divisors a unitary ideal. It can be regarded as a simplicial complex. Moreover, a multiplicative arithmetical function on such a set corresponds to a function on the simplicial…

Combinatorics · Mathematics 2007-05-23 Jan Snellman

We consider the line graph of a pure simplicial complex. We prove that, as in the case of line graphs of simple graphs, one can compute the second graded Betti number of the facet ideal of a pure simplicial complex in terms of the…

Commutative Algebra · Mathematics 2025-09-16 Anda Olteanu

We study a class of finite groups $G$ which behave similarly to elementary abelian $p$-groups with $p$ prime, that is, there exists a subgroup $N$ such that all elements of $G\setminus N$ are conjugate or inverse-conjugate under $\Aut(G)$.…

Group Theory · Mathematics 2018-01-30 Lei Wang , Yin Liu

Let $G$ be a finite abelian group, written additively, and $H$ a subgroup of~$G$. The \emph{subgroup sum graph} $\Gamma_{G,H}$ is the graph with vertex set $G$, in which two distinct vertices $x$ and $y$ are joined if $x+y\in…

Combinatorics · Mathematics 2021-11-11 Peter J. Cameron , R. Raveendra Prathap , T. Tamizh Chelvam
‹ Prev 1 4 5 6 7 8 10 Next ›