English
Related papers

Related papers: The Fitting height is bounded by a function of the…

200 papers

A finite group $G$ is called {\it $p^i$-central of height $k$} if every element of order $p^i$ of $G$ is contained in the $k^{th}$-term $\zeta_k(G)$ of the ascending central series of $G$. If $p$ is odd such a group has to be $p$-nilpotent…

Group Theory · Mathematics 2009-05-29 Jon Gonzalez-Sanchez , Thomas S. Weigel

The size of the smallest $k$-regular graph of girth at least $g$ is denoted by the well-studied function $n(k,g)$. We introduce an analogous function $n(H,g)$, defined as the smallest size graph of girth at least $g$ that is a lift (or…

Combinatorics · Mathematics 2025-12-25 Shlomo Hoory

A fractional matching of $G$ is a function $f: E(G)\to [0,1]$ such that $\sum_{e\in E_G(v_i)}f(e)\le 1$ for any $v_i\in V(G)$, where $E_G(v_i)=\{e: e\in E(G) \ \textrm{and}\ e \ \textrm{is incident with} \ v_i\}$. Let $\alpha_f(G)$ denote…

Combinatorics · Mathematics 2025-12-04 Zengzhao Xu , Weige Xi , Ligong Wang

Let G be a finite non-abelian simple group and let p be a prime. We classify all pairs (G,p) such that the sum of the complex irreducible character degrees of G is greater than the index of a Sylow p-subgroup of G. Our classification…

Group Theory · Mathematics 2013-02-07 Pablo Spiga , Alexandre Zalesski

For a character $\chi$ of a finite group $G$, the number cod$(\chi):=|G:\mathrm{ker}(\chi)|/\chi(1)$ is called the codegree of $\chi$.In this paper, we give a solvability criterion for a finite group $G$ depending on the minimum of the…

Group Theory · Mathematics 2022-08-17 Dongfang Yang , Yu Zeng , Heng Lv

For a fixed finite solvable group $G$ and number field $K$, we prove an upper bound for the number of $G$-extensions $L/K$ with restricted local behavior (at infinitely many places) and ${\rm inv}(L/K)<X$ for a general invariant $"{\rm…

Number Theory · Mathematics 2019-12-13 Brandon Alberts

Let $\mathfrak{F}$ be a class of finite groups and $G$ a finite group. Let ${\cal L}_{\mathfrak{F}}(G)$ be the set of all subgroups $A$ of $G$ with $A^{G}/A_{G}\in \mathfrak{F}$. A chief factor $H/K$ of $G$ is $\mathfrak{F}$-central in $G$…

Group Theory · Mathematics 2019-04-16 Zhang Chi , Alexander N. Skiba

Let $G$ be a finite group and let $p$ be a prime. In this paper, we study the structure of finite groups with a large number of $p$-regular conjugacy classes or, equivalently, a large number of irreducible $p$-modular representations. We…

Group Theory · Mathematics 2023-12-19 Christopher A. Schroeder

Finite groups in which every element has prime power order (EPPO-groups) are nowadays fairly well understood. For instance, if $G$ is a soluble EPPO-group, then the Fitting height of $G$ is at most 3 and $|\pi(G)|\leqslant 2$ (Higman,…

Group Theory · Mathematics 2023-12-19 Mateus Figueiredo , Pavel Shumyatsky

An unrefinable chain of a finite group $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal subgroup of $G_{i-1}$. The length (respectively, depth) of $G$ is the maximal (respectively, minimal)…

Group Theory · Mathematics 2019-07-03 Timothy C. Burness , Martin W. Liebeck , Aner Shalev

A graph $G$ is said to be $k$-extendable if every matching of size $k$ in $G$ can be extended to a perfect matching of $G$, where $k$ is a positive integer. We say $G$ is $1$-excludable if for every edge $e$ of $G$, there exists a perfect…

Combinatorics · Mathematics 2023-04-26 Shujing Miao , Shuchao Li , Wei Wei

This work establishes a new probabilistic bound on the number of elements to generate finite nilpotent groups. Let $\varphi_k(G)$ denote the probability that $k$ random elements generate a finite nilpotent group $G$. For any $0 < \epsilon <…

Quantum Physics · Physics 2025-11-26 Ziyuan Dong , Xiang Fan , Tengxun Zhong , Daowen Qiu

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

Group Theory · Mathematics 2026-04-10 Angsuman Das , Hiranya Kishore Dey , Khyati Sharma

We show that a finitely generated soluble group is virtually nilpotent if and only if the diameter of its finite coset spaces admits a uniform polynomial lower bound in terms of their size. We obtain the same conclusion for certain finitely…

Group Theory · Mathematics 2026-04-21 David Guo

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 prove that there exists an integer-valued function f on positive integers such that if a finite group G has at most k real-valued irreducible characters, then |G/Sol(G)| is at most f(k), where Sol(G) denotes the largest solvable normal…

Group Theory · Mathematics 2019-05-28 Nguyen Ngoc Hung , A. A. Schaeffer Fry , Hung P. Tong-Viet , C. Ryan Vinroot

Let $G$ be a finite (not necessarily abelian) group and let $p=p(G)$ be the smallest prime number dividing $|G|$. We prove that $d(G)\leq \frac{|G|}{p}+9p^2-10p$, where $d(G)$ denotes the small Davenport constant of $G$ which is defined as…

Number Theory · Mathematics 2013-08-13 Weidong Gao , Yuanlin Li , Jiangtao Peng

For a connected graph $G$, let $\mu(G)$ denote the distance spectral radius of $G$. A matching in a graph $G$ is a set of disjoint edges of $G$. The maximum size of a matching in $G$ is called the matching number of $G$, denoted by…

Combinatorics · Mathematics 2025-12-04 Zengzhao Xu , Weige Xi , Ligong Wang

The girth of a finitely generated group G is the supremum of the girth of Cayley graphs for G over all finite generating sets. Let G be a finitely generated subgroup of the mapping class group Mod(S), where S is a compact orientable…

Group Theory · Mathematics 2011-05-30 Kei Nakamura

We show that a holomorphic eta quotient has only finitely many factors. We also provide an algorithm for checking irreducibility of holomorphic eta quotients by constructing an upper bound for the minimum of the levels of the proper factors…

Number Theory · Mathematics 2019-09-10 Soumya Bhattacharya