activity
19972005
most citedStein's Method and Minimum Parsimony Distance after Shuffles

3 citations · 4 across the 10 of their papers we have counts for

collaborators
Showing math.GRShow all

10 papers · 1 filter

math.GR20031 cited

Conjugacy Class Properties of the Extension of GL(n,q) Generated by the Inverse Tranpose Involution

Jason Fulman, Robert Guralnick

Letting tau denote the inverse transpose automorphism of GL(n,q), a formula is obtained for the number of g in GL(n,q) so that gg^{tau} is equal to a given element h. This generali…

math.GR2002

Derangements in simple and primitive groups

Jason Fulman, Robert Guralnick

We investigate the proportion of fixed point free permutations (derangements) in finite transitive permutation groups. This article is the first in a series where we prove a conjec…

math.GR2000

Finite Affine Groups: Cycle Indices, Hall-Littlewood Polynomials, and Probabilistic Algorithms

Jason Fulman

The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive…

math.GR2000

Random matrix theory over finite fields: a survey

Jason Fulman

First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic pictur…

math.GR2000

A Probabilistic Approach to Conjugacy Classes in the Finite Symplectic and Orthogonal Groups

Jason Fulman

Markov chains are used to give a purely probabilistic way of understanding the conjugacy classes of the finite symplectic and orthogonal groups in odd characteristic. As a corollar…

math.GR1999

Semisimple orbits of Lie algebras and card shuffling on Coxeter groups

Jason Fulman

Random walk on the chambers of hyperplanes arrangements is used to define a family of card shuffling measures for a finite Coxeter group W and real . By algebra…