Robert M. Guralnick
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Robert M. Guralnick has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Pham Huu Tiep
Department of Mathematics University of Arizona Tucson AZ 85721 USA
5 shared publications - Pham Huu Tiep
University of Florida
5 shared publications - Michael Larsen
Department of Mathematics, Indiana University, Bloomington, USA
4 shared publications - Pham Huu Tiep
Department of Mathematics, Rutgers University, Piscataway, USA
4 shared publications - Jan Saxl
University of Cambridge
3 shared publications - Jason Fulman
Department of Mathematics, University of Southern California, Los Angeles, CA, 90089, USA
3 shared publications
Latest Publications
- Open Access
An extension of Gow's theorem
We extend Gow's theorem on products of semisimple regular conjugacy classes to finite groups whose generalized Fitting subgroup is Z(G)S where S is a quasisimple group of Lie type in characteristic p and Z(G) has order prime to p.
Open AccessAn extension of Gow's theorem
We extend Gow's theorem on products of semisimple regular conjugacy classes to finite groups whose generalized Fitting subgroup is Z(G)S where S is a quasisimple group of Lie type in characteristic p and Z(G) has order prime to p.
- Open Access
- 29 September 2023
- Published by Springer Nature in Inventiones Mathematicae
- Vol. 235 (1) , 151-210
Character levels and character bounds for finite classical groups
The main results of the paper develop a level theory and establish strong character bounds for finite classical groups, in the case that the centralizer of the element has small order compared to $|G|$ | G | in a logarithmic sense.
- 29 September 2023
- Published by Springer Nature in Inventiones Mathematicae
- Vol. 235 (1) , 151-210
Open AccessCharacter levels and character bounds for finite classical groups
The main results of the paper develop a level theory and establish strong character bounds for finite classical groups, in the case that the centralizer of the element has small order compared to $|G|$ | G | in a logarithmic sense.
- Open Access
- 24 January 2020
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Pi
- Vol. 8
CHARACTER LEVELS AND CHARACTER BOUNDS
We develop the concept of character level for the complex irreducible characters of finite, general or special, linear and unitary groups. We give characterizations of the level of a character in terms of its Lusztig label and in terms of its degree. Then we prove explicit upper bounds for character values at elements with not-too-large centralizers and derive upper bounds on the covering number and mixing time of random walks corresponding to these conjugacy classes. We also characterize the level of the character in terms of certain dual pairs and prove explicit exponential character bounds for the character values, provided that the level is not too large. Several further applications are also provided. Related results for other finite classical groups are obtained in the sequel [Guralnicket al. ‘Character levels and character bounds for finite classical groups’, Preprint, 2019,arXiv:1904.08070] by different methods.
- 24 January 2020
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Pi
- Vol. 8
Open AccessCHARACTER LEVELS AND CHARACTER BOUNDS
We develop the concept of character level for the complex irreducible characters of finite, general or special, linear and unitary groups. We give characterizations of the level of a character in terms of its Lusztig label and in terms of its degree. Then we prove explicit upper bounds for character values at elements with not-too-large centralizers and derive upper bounds on the covering number and mixing time of random walks corresponding to these conjugacy classes. We also characterize the level of the character in terms of certain dual pairs and prove explicit exponential character bounds for the character values, provided that the level is not too large. Several further applications are also provided. Related results for other finite classical groups are obtained in the sequel [Guralnicket al. ‘Character levels and character bounds for finite classical groups’, Preprint, 2019,arXiv:1904.08070] by different methods.
- Open Access
Character Levels and Character Bounds. II
This paper is a continuation of [GLT], which develops a level theory and establishes strong character bounds for finite simple groups of linear and unitary type in the case that the centralizer of the element has small order compared to $|G|$ in a logarithmic sense. We strengthen the results of [GLT] and extend them to all groups of classical type.Open AccessCharacter Levels and Character Bounds. II
This paper is a continuation of [GLT], which develops a level theory and establishes strong character bounds for finite simple groups of linear and unitary type in the case that the centralizer of the element has small order compared to $|G|$ in a logarithmic sense. We strengthen the results of [GLT] and extend them to all groups of classical type. - Open Access
Character Levels and Character Bounds
We develop the concept of character level for the complex irreducible characters of finite, general or special, linear and unitary groups. We give characterizations of the level of a character in terms of its Lusztig's label and in terms of its degree. Then we prove explicit upper bounds for character values at elements with not-too-large centralizers and derive upper bounds on the covering number and mixing time of random walks corresponding to these conjugacy classes. We also characterize the level of the character in terms of certain dual pairs and prove explicit exponential character bounds for the character values, provided that the level is not too large.
Open AccessCharacter Levels and Character Bounds
We develop the concept of character level for the complex irreducible characters of finite, general or special, linear and unitary groups. We give characterizations of the level of a character in terms of its Lusztig's label and in terms of its degree. Then we prove explicit upper bounds for character values at elements with not-too-large centralizers and derive upper bounds on the covering number and mixing time of random walks corresponding to these conjugacy classes. We also characterize the level of the character in terms of certain dual pairs and prove explicit exponential character bounds for the character values, provided that the level is not too large.
- Open Access
Normalizers of Primitive Permutation Groups
Let $G$ be a transitive normal subgroup of a permutation group $A$ of finite degree $n$. The factor group $A/G$ can be considered as a certain Galois group and one would like to bound its size. One of the results of the paper is that $|A/G| < n$ if $G$ is primitive unless $n = 3^{4}$, $5^4$, $3^8$, $5^8$, or $3^{16}$. This bound is sharp when $n$ is prime. In fact, when $G$ is primitive, $|\mathrm{Out}(G)| < n$ unless $G$ is a member of a given infinite sequence of primitive groups and $n$ is different from the previously listed integers. Many other results of this flavor are established not only for permutation groups but also for linear groups and Galois groups.Open AccessNormalizers of Primitive Permutation Groups
Let $G$ be a transitive normal subgroup of a permutation group $A$ of finite degree $n$. The factor group $A/G$ can be considered as a certain Galois group and one would like to bound its size. One of the results of the paper is that $|A/G| < n$ if $G$ is primitive unless $n = 3^{4}$, $5^4$, $3^8$, $5^8$, or $3^{16}$. This bound is sharp when $n$ is prime. In fact, when $G$ is primitive, $|\mathrm{Out}(G)| < n$ unless $G$ is a member of a given infinite sequence of primitive groups and $n$ is different from the previously listed integers. Many other results of this flavor are established not only for permutation groups but also for linear groups and Galois groups. - Open Access
- 20 June 2016
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 369 (4) , 2521-2572
Derangements in subspace actions of finite classical groups
This is the third in a series of four papers in which we prove a conjecture made by Boston et al. and Shalev that the proportion of derangements (fixed point free elements) is bounded away from zero for transitive actions of finite simple groups on a set of size greater than one. This paper treats the case of primitive subspace actions. It is also shown that if the dimension and codimension of the subspace go to infinity, then the proportion of derangements goes to one. Similar results are proved for elements in finite classical groups in cosets of the simple group. The results in this paper have applications to probabilistic generation of finite simple groups and maps between varieties over finite fields.
- 20 June 2016
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 369 (4) , 2521-2572
Open AccessDerangements in subspace actions of finite classical groups
This is the third in a series of four papers in which we prove a conjecture made by Boston et al. and Shalev that the proportion of derangements (fixed point free elements) is bounded away from zero for transitive actions of finite simple groups on a set of size greater than one. This paper treats the case of primitive subspace actions. It is also shown that if the dimension and codimension of the subspace go to infinity, then the proportion of derangements goes to one. Similar results are proved for elements in finite classical groups in cosets of the simple group. The results in this paper have applications to probabilistic generation of finite simple groups and maps between varieties over finite fields.
- Open Access
Derangements in Subspace Actions of Finite Classical Groups
This is the third in a series of papers in which we prove a conjecture of Boston and Shalev that the proportion of derangements (fixed point free elements) is bounded away from zero for transitive actions of finite simple groups on a set of size greater than one. This paper treats the case of primitive subspace actions. It is also shown that if the dimension and codimension of the subspace go to infinity, then the proportion of derangements goes to one. Similar results are proved for elements in finite classical groups in cosets of the simple group. The results in this paper have applications to probabilistic generation of finite simple groups and maps between varieties over finite fields.
Open AccessDerangements in Subspace Actions of Finite Classical Groups
This is the third in a series of papers in which we prove a conjecture of Boston and Shalev that the proportion of derangements (fixed point free elements) is bounded away from zero for transitive actions of finite simple groups on a set of size greater than one. This paper treats the case of primitive subspace actions. It is also shown that if the dimension and codimension of the subspace go to infinity, then the proportion of derangements goes to one. Similar results are proved for elements in finite classical groups in cosets of the simple group. The results in this paper have applications to probabilistic generation of finite simple groups and maps between varieties over finite fields.
- Open Access
On rational and concise words
A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of w-values is finite for a group G in X, it always follows that w(G) is finite. P. Hall asked whether every word is concise. Due to Ivanov the answer to this problem is known to be negative. It is still an open problem whether every word is concise in the class of residually finite groups. A word w is rational if the number of solutions to the equation w=g is the same as the number of solutions to w=g^e for every finite group G and for every e relatively prime to |G|. We observe that any rational word is concise in the class of residually finite groups. Further we give a sufficient condition for rationality of a word. This is used to produce a new family of words that are concise in the class of residually finite groups.
Open AccessOn rational and concise words
A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of w-values is finite for a group G in X, it always follows that w(G) is finite. P. Hall asked whether every word is concise. Due to Ivanov the answer to this problem is known to be negative. It is still an open problem whether every word is concise in the class of residually finite groups. A word w is rational if the number of solutions to the equation w=g is the same as the number of solutions to w=g^e for every finite group G and for every e relatively prime to |G|. We observe that any rational word is concise in the class of residually finite groups. Further we give a sufficient condition for rationality of a word. This is used to produce a new family of words that are concise in the class of residually finite groups.
- Open Access
The number of regular semisimple conjugacy classes in the finite classical groups
Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special orthogonal groups the results are new.
Open AccessThe number of regular semisimple conjugacy classes in the finite classical groups
Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special orthogonal groups the results are new.