RGRobert M. Guralnick

Robert M. Guralnick

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Robert M. Guralnick has a total of 29 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    An extension of Gow's theorem

    by Robert M. Guralnick, Pham Huu Tiep

    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

    Character levels and character bounds for finite classical groups

    by Robert M. Guralnick, Michael Larsen, Pham Huu Tiep

    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

    CHARACTER LEVELS AND CHARACTER BOUNDS

    by Robert M. Guralnick, Michael Larsen, Pham Huu Tiep

    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

    by Robert M. Guralnick, Michael Larsen, Pham Huu Tiep

    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

    by Robert M. Guralnick, Michael Larsen, Pham Huu Tiep

    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

    by Robert M. Guralnick, Attila Maróti, László Pyber

    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

    Derangements in subspace actions of finite classical groups

    by Jason Fulman, Robert Guralnick

    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

    by Jason Fulman, Robert Guralnick

    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

    by Robert Guralnick, Pavel Shumyatsky

    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

    by Jason Fulman, Robert Guralnick

    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.