Fixed‐point ratios, Sylow numbers, and coverings of p$p$‐elements in finite groups

Type: Article
Publication Date: 2025-05-01
Citations: 0
DOI: https://doi.org/10.1112/jlms.70167

Abstract

Abstract Fixed‐point ratios for primitive permutation groups have been extensively studied. Relying on a recent work of Burness and Guralnick, we obtain further results in the area. For a prime and a finite group , we use fixed‐point ratios to study the number of Sylow ‐subgroups of and the minimal size of a covering by proper subgroups of the set of ‐elements of .

Locations

  • Journal of the London Mathematical Society

Similar Works

Fixed point ratios for primitive permutation groups have been extensively studied. Relying on a recent work of Burness and Guralnick, we obtain further results in the area. For a prime … Fixed point ratios for primitive permutation groups have been extensively studied. Relying on a recent work of Burness and Guralnick, we obtain further results in the area. For a prime $p$ and a finite group $G$, we use fixed point ratios to study the number of Sylow $p$-subgroups of $G$ and the minimal size of a covering by proper subgroups of the set of $p$-elements of $G$.
Let $G$ be a finite primitive permutation group on a set $\Omega$ and recall that the fixed point ratio of an element $x \in G$, denoted ${\rm fpr}(x)$, is the … Let $G$ be a finite primitive permutation group on a set $\Omega$ and recall that the fixed point ratio of an element $x \in G$, denoted ${\rm fpr}(x)$, is the proportion of points in $\Omega$ fixed by $x$. Fixed point ratios in this setting have been studied for many decades, finding a wide range of applications. In this paper, we are interested in comparing ${\rm fpr}(x)$ with the order of $x$. Our main theorem classifies the triples $(G,\Omega,x)$ as above with the property that $x$ has prime order $r$ and ${\rm fpr}(x) > 1/(r+1)$. There are several applications. Firstly, we extend earlier work of Guralnick and Magaard by determining the primitive permutation groups of degree $m$ with minimal degree at most $2m/3$. Secondly, our main result plays a key role in recent work of the authors (together with Moret\'{o} and Navarro) on the commuting probability of $p$-elements in finite groups. Finally, we use our main theorem to investigate the minimal index of a primitive permutation group, which allows us to answer a question of Bhargava.
Let $G$ be a finite primitive permutation group on a set $\Omega$ and recall that the fixed point ratio of an element $x \in G$, denoted ${\rm fpr}(x)$, is the … Let $G$ be a finite primitive permutation group on a set $\Omega$ and recall that the fixed point ratio of an element $x \in G$, denoted ${\rm fpr}(x)$, is the proportion of points in $\Omega$ fixed by $x$. Fixed point ratios in this setting have been studied for many decades, finding a wide range of applications. In this paper, we are interested in comparing ${\rm fpr}(x)$ with the order of $x$. Our main theorem classifies the triples $(G,\Omega,x)$ as above with the property that $x$ has prime order $r$ and ${\rm fpr}(x) > 1/(r+1)$. There are several applications. Firstly, we extend earlier work of Guralnick and Magaard by determining the primitive permutation groups of degree $m$ with minimal degree at most $2m/3$. Secondly, our main result plays a key role in recent work of the authors (together with Moret\'{o} and Navarro) on the commuting probability of $p$-elements in finite groups. Finally, we use our main theorem to investigate the minimal index of a primitive permutation group, which allows us to answer a question of Bhargava.
Let G be a finite primitive permutation group on a set Ω and recall that the fixed point ratio of an element x∈G, denoted fpr(x), is the proportion of points … Let G be a finite primitive permutation group on a set Ω and recall that the fixed point ratio of an element x∈G, denoted fpr(x), is the proportion of points in Ω fixed by x. Fixed point ratios in this setting have been studied for many decades, finding a wide range of applications. In this paper, we are interested in comparing fpr(x) with the order of x. Our main theorem provides a classification of the triples (G,Ω,x) as above with the property that x has prime order r and fpr(x)>1/(r+1). There are several applications. Firstly, we extend earlier work of Guralnick and Magaard by determining the primitive permutation groups of degree m with minimal degree at most 2m/3. Secondly, our main result plays a key role in recent joint work with Moretó and Navarro on the commuting probability of p-elements in finite groups. Finally, we use our main theorem to investigate the minimal index of a primitive permutation group, which allows us to answer a question of Bhargava.
Let $G$ be a finite group, let $p$ be a prime and let ${\rm Pr}_p(G)$ be the probability that two random $p$-elements of $G$ commute. In this paper we prove … Let $G$ be a finite group, let $p$ be a prime and let ${\rm Pr}_p(G)$ be the probability that two random $p$-elements of $G$ commute. In this paper we prove that ${\rm Pr}_p(G) > (p^2+p-1)/p^3$ if and only if $G$ has a normal and abelian Sylow $p$-subgroup, which generalizes previous results on the widely studied commuting probability of a finite group. This bound is best possible in the sense that for each prime $p$ there are groups with ${\rm Pr}_p(G) = (p^2+p-1)/p^3$ and we classify all such groups. Our proof is based on bounding the proportion of $p$-elements in $G$ that commute with a fixed $p$-element in $G \setminus \textbf{O}_p(G)$, which in turn relies on recent work of the first two authors on fixed point ratios for finite primitive permutation groups.
We say that a finite group $G$ acting on a set $\Omega$ has Property $(*)_p$ for a prime $p$ if $P_\omega$ is a Sylow $p$-subgroup of $G_\omega$ for all $\omega\in\Omega$ … We say that a finite group $G$ acting on a set $\Omega$ has Property $(*)_p$ for a prime $p$ if $P_\omega$ is a Sylow $p$-subgroup of $G_\omega$ for all $\omega\in\Omega$ and Sylow $p$-subgroups $P$ of $G$. Property $(*)_p$ arose in the recent work of Tornier (2018) on local Sylow $p$-subgroups of Burger-Mozes groups, and he determined the values of $p$ for which the alternating group $A_n$ and symmetric group $S_n$ acting on $n$ points has Property $(*)_p$. In this paper, we extend this result to finite $2$-transitive groups and we give a structural characterisation result for the finite primitive groups that satisfy Property $(*)_p$ for an allowable prime $p$.
We say that a finite group $G$ acting on a set $\Omega$ has Property $(*)_p$ for a prime $p$ if $P_\omega$ is a Sylow $p$-subgroup of $G_\omega$ for all $\omega\in\Omega$ … We say that a finite group $G$ acting on a set $\Omega$ has Property $(*)_p$ for a prime $p$ if $P_\omega$ is a Sylow $p$-subgroup of $G_\omega$ for all $\omega\in\Omega$ and Sylow $p$-subgroups $P$ of $G$. Property $(*)_p$ arose in the recent work of Tornier (2018) on local Sylow $p$-subgroups of Burger-Mozes groups, and he determined the values of $p$ for which the alternating group $A_n$ and symmetric group $S_n$ acting on $n$ points has Property $(*)_p$. In this paper, we extend this result to finite $2$-transitive groups and we give a structural characterisation result for the finite primitive groups that satisfy Property $(*)_p$ for an allowable prime $p$.
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 … 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 $(1-\frac{1}{p})$-th power of the number of Sylow $p$-subgroups of $G$. We prove this conjecture if $G$ is $p$-solvable. Moreover, we prove that the conjecture is true in its generality if a somewhat similar condition holds for every almost simple group.
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 … 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 $(1-\frac{1}{p})$-th power of the number of Sylow $p$-subgroups of $G$. We prove this conjecture if $G$ is $p$-solvable. Moreover, we prove that the conjecture is true in its generality if a somewhat similar condition holds for every almost simple group.
Let G be a finite group, let p be a prime and let Pr p (G) be the probability that two random p-elements of G commute.In this paper we prove … Let G be a finite group, let p be a prime and let Pr p (G) be the probability that two random p-elements of G commute.In this paper we prove that Pr p (G) > ( p 2 + p -1)/ p 3 if and only if G has a normal and abelian Sylow p-subgroup, which generalizes previous results on the widely studied commuting probability of a finite group.This bound is best possible in the sense that for each prime p there are groups with Pr p (G) = ( p 2 + p -1)/ p 3 and we classify all such groups.Our proof is based on bounding the proportion of p-elements in G that commute with a fixed p-element in G \ O p (G), which in turn relies on recent work of the first two authors on fixed point ratios for finite primitive permutation groups.
We provide structural criteria for some finite factorised groups $G = AB$ when the conjugacy class sizes in $G$ of certain $\pi$-elements in $A\cup B$ are either $\pi$-numbers or $\pi'$-numbers, … We provide structural criteria for some finite factorised groups $G = AB$ when the conjugacy class sizes in $G$ of certain $\pi$-elements in $A\cup B$ are either $\pi$-numbers or $\pi'$-numbers, for a set of primes $\pi$. In particular, we extend for products of groups some earlier results.
Let $G$ be a finite group and $n_p(G)$ the number of Sylow $p$-subgroups of $G$. In this paper, we prove if $n_p(G)<p^2$ then almost all numbers $n_p(G)$ are a power … Let $G$ be a finite group and $n_p(G)$ the number of Sylow $p$-subgroups of $G$. In this paper, we prove if $n_p(G)<p^2$ then almost all numbers $n_p(G)$ are a power of a prime.
Let Gp be the set of p-elements of a finite group G. Do we need all the Sylow p-subgroups of G to cover Gp? Although this question does not have … Let Gp be the set of p-elements of a finite group G. Do we need all the Sylow p-subgroups of G to cover Gp? Although this question does not have an affirmative answer in general, our work indicates that the answer is yes more often than one could perhaps expect.
Abstract Let G be a transitive permutation group on a set Ω of n points, and let P be a Sylow p -subgroup of G for some prime p dividing … Abstract Let G be a transitive permutation group on a set Ω of n points, and let P be a Sylow p -subgroup of G for some prime p dividing ∣G∣. If P has t long orbits and f fixed points in Ω, then it is shown that f ≦ tp − i p (n) , where i p (n) = p – r p (n), r p (n) denoting the residue of n modulo p . In addition, groups for which f attains the upper bound are classified.

Cited by (0)

References (24)

If $G$ is a finite group and $p$ is a prime number, let $\nu _p(G)$ be the number of Sylow $p$-subgroups of $G$. If $H$ is a subgroup of a … If $G$ is a finite group and $p$ is a prime number, let $\nu _p(G)$ be the number of Sylow $p$-subgroups of $G$. If $H$ is a subgroup of a $p$-solvable group $G$, we prove that $\nu _p(H)$ divides $\nu _p(G)$.
This paper is an attempt to provide a partial answer to the following question put forward by Bernhard H. Neumann in 2000: “Let G be a finite group of order … This paper is an attempt to provide a partial answer to the following question put forward by Bernhard H. Neumann in 2000: “Let G be a finite group of order g and assume that however a set M of m elements and a set N of n elements of the group is chosen, at least one element of M commutes with at least one element of N . What relations between g, m, n guarantee that G is Abelian?” We find an exponential function f ( m,n ) such that every such group G is Abelian whenever | G | &gt; f ( m,n ) and this function can be taken to be polynomial if G is not soluble. We give an upper bound in terms of m and n for the solubility length of G , if G is soluble.
If the group G contains at most n pairwise non-commuting elements, then |G:Z(G)| ⩽ cn for some constant c. This answers a question of B. H. Neumann and also solves … If the group G contains at most n pairwise non-commuting elements, then |G:Z(G)| ⩽ cn for some constant c. This answers a question of B. H. Neumann and also solves a problem of P. Erdös.
Let G be a group, and associate with G a graph 1 γ = Γ ( G ) as follows: the vertices of Γ are the elements of G , … Let G be a group, and associate with G a graph 1 γ = Γ ( G ) as follows: the vertices of Γ are the elements of G , and two vertices g, h of Γ are joined by an undirected edge if, and only if, g and h do not commute as elements of G , that is [g, h] ≠ 1 [where [g, h] is the commutator g −1 h −1 gh , and 1 is the unit element of the groups that occur as well as the integer, according to context].We are interested in complete subgraphs of Γ, or equivalently in sets of elements of G no two of which commute.
We derive a new bound for the minimal degree of an almost simple primitive permutation group, and settle a conjecture of Cameron and Kantor concerning the base size of such … We derive a new bound for the minimal degree of an almost simple primitive permutation group, and settle a conjecture of Cameron and Kantor concerning the base size of such a group. Additional results concern random generation of simple groups, and the so-called genus conjecture of Guralnick and Thompson. Our proofs are based on probabilistic arguments, together with a new result concerning the size of the intersection of a maximal subgroup of a classical group with a conjugacy class of elements.
Of the $(2H+1)^n$ monic integer polynomials $f(x)=x^n+a_1 x^{n-1}+\cdots+a_n$ with $\max\{|a_1|,\ldots,|a_n|\}\leq H$, how many have associated Galois group that is not the full symmetric group $S_n$? There are clearly $\gg H^{n-1}$ … Of the $(2H+1)^n$ monic integer polynomials $f(x)=x^n+a_1 x^{n-1}+\cdots+a_n$ with $\max\{|a_1|,\ldots,|a_n|\}\leq H$, how many have associated Galois group that is not the full symmetric group $S_n$? There are clearly $\gg H^{n-1}$ such polynomials, as may be obtained by setting $a_n=0$. In 1936, van der Waerden conjectured that $O(H^{n-1})$ should in fact also be the correct upper bound for the count of such polynomials. The conjecture has been known previously for degrees $n\leq 4$, due to work of van der Waerden and Chow and Dietmann. The purpose of this paper is to prove van der Waerden's Conjecture for all degrees $n$.
Let G be a finite primitive permutation group on a set Ω and recall that the fixed point ratio of an element x∈G, denoted fpr(x), is the proportion of points … Let G be a finite primitive permutation group on a set Ω and recall that the fixed point ratio of an element x∈G, denoted fpr(x), is the proportion of points in Ω fixed by x. Fixed point ratios in this setting have been studied for many decades, finding a wide range of applications. In this paper, we are interested in comparing fpr(x) with the order of x. Our main theorem provides a classification of the triples (G,Ω,x) as above with the property that x has prime order r and fpr(x)>1/(r+1). There are several applications. Firstly, we extend earlier work of Guralnick and Magaard by determining the primitive permutation groups of degree m with minimal degree at most 2m/3. Secondly, our main result plays a key role in recent joint work with Moretó and Navarro on the commuting probability of p-elements in finite groups. Finally, we use our main theorem to investigate the minimal index of a primitive permutation group, which allows us to answer a question of Bhargava.
Let G be a finite group, let p be a prime and let Pr p (G) be the probability that two random p-elements of G commute.In this paper we prove … Let G be a finite group, let p be a prime and let Pr p (G) be the probability that two random p-elements of G commute.In this paper we prove that Pr p (G) > ( p 2 + p -1)/ p 3 if and only if G has a normal and abelian Sylow p-subgroup, which generalizes previous results on the widely studied commuting probability of a finite group.This bound is best possible in the sense that for each prime p there are groups with Pr p (G) = ( p 2 + p -1)/ p 3 and we classify all such groups.Our proof is based on bounding the proportion of p-elements in G that commute with a fixed p-element in G \ O p (G), which in turn relies on recent work of the first two authors on fixed point ratios for finite primitive permutation groups.
Abstract Let be a finite group, be a set of primes, and be the smallest prime in . In this work, we prove that possesses a normal and abelian Hall … Abstract Let be a finite group, be a set of primes, and be the smallest prime in . In this work, we prove that possesses a normal and abelian Hall ‐subgroup if and only if the probability that two random ‐elements of commute is larger than . We also prove that if is a ‐element not lying in , then the proportion of ‐elements commuting with is at most .