Related papers: Detecting large groups

Every finite group $G$ has a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. We define the nonsoluble length $\lambda (G)$ as the minimum number of nonsoluble factors in a series of…

Given a set of primes $\pi$, the $\pi$-index of an element $x$ of a finite group $G$ is the $\pi$-part of the index of the centralizer of $x$ in $G$. If $\pi=\{p\}$ is a singleton, we just say the $p$-index. If the $\pi$-index of $x$ is…

In this note, we prove: \medskip \noindent {\bf Theorem A:} \emph{ There is a fixed constant $C$ such that for any positive integer $n$ and prime $p$, every finite subgroup $G$ of order coprime to $p$ of ${\rm GL}(n,\mathbb{C})$ has an…

Let p be a prime. Every finite group G has a normal series each of whose quotients either is p-soluble or is a direct product of nonabelian simple groups of orders divisible by p. The non-p-soluble length of G is defined as the minimal…

Let $G$ be a finite group and $N$ a normal subgroup of $G$. We prove that the knowledge of the sizes of the conjugacy classes of $G$ that are contained in $N$ and of their multiplicities provides information of $N$ in relation to the…

A p-group G is p-central if the central quotient has exponent p. We prove that for a subset of finite p-central p-groups, the order of the group G divides the order of Aut(G).

Let $G$ be a finite group. For some fixed prime $p$, let $\Gamma_p(G)$ be the common divisor graph built on the set of sizes of $p$-regular conjugacy classes of $G$: this is the simple undirected graph whose vertices are the class sizes of…

Let the group $G = AB$ be the product of the subgroups $A$ and $B$. We determine some structural properties of $G$ when the $p$-elements in $A\cup B$ have prime power indices in $G$, for some prime $p$. More generally, we also consider the…

We prove that if $G$ is a totally bounded abelian group \st\ its dual group $\widehat{G}_p$ equipped with the finite-open topology is a Baire group, then every compact subset of $G$ must be finite. This solves an open question by Chasco,…

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…

A word $w$ is said to be concise in a class of groups if, for every $G$ in that class such that the set of $w$-values $w\{G\}$ is finite, the verbal subgroup $w(G)$ is also finite. In the context of profinite groups, the notion of strong…

Given a finite group $G$ and a prime $p$, let $\mathcal{A}_p(G)$ be the poset of nontrivial elementary abelian $p$-subgroups of $G$. The group $G$ satisfies the Quillen dimension property at $p$ if $\mathcal{A}_p(G)$ has non-zero homology…

Suppose that $x$, $y$ are elements of a finite group $G$ lying in conjugacy classes of coprime sizes. We prove that $\langle x^G \rangle \cap \langle y^G \rangle$ is an abelian normal subgroup of $G$ and, as a consequence, that if $x$ and…

We introduce the subgroup identification problem, and show that there is a finitely presented group G for which it is unsolvable, and that it is uniformly solvable in the class of finitely presented locally Hopfian groups. This is done as…

In this paper we study the ratio between the number of $p$-elements and the order of a Sylow $p$-subgroup of a finite group $G$. As well known, this ratio is a positive integer and we conjecture that, for every group $G$, it is at least the…

Let K/Q be Galois, and let eta in K* whose conjugates are multiplicatively independent. For a prime p, unramified, prime to eta, let np be the residue degree of p and gp the number of P I p, then let o\_P(eta) and o\_p(eta) be the orders of…

A group-word $w$ is called concise if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G$. It is known that there are words that are not concise. The problem whether every word is concise in the…

The Gruenberg-Kegel graph $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of order $rs$…

The `upper rank' of a group is the supremum of the (Pr\"{u}fer) ranks of its finite quotients, and for a prime $p$, the `upper $p$-rank' is the supremum of the sectional $p$-ranks of those quotients. The former is finite if and only if the…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…