3 citations · 4 across the 10 of their papers we have counts for
8 papers · 1 filter
Orbifold Euler characteristics and the number of commuting n-tuples in symmetric groups
Jim Bryan, Jason Fulman
Generating functions for the number of commuting m-tuples in the symmetric groups are obtained. We define a natural sequence of ``orbifold Euler characteristics'' for a finite grou…
Descent identities, Hessenberg varieties, and the Weil conjectures
Jason Fulman
The Weil Conjectures are applied to the Hessenberg Varieties to obtain interesting information about the combinatorics of descents in the symmetric group. Combining this with eleme…
The combinatorics of biased riffle shuffles
Jason Fulman
This paper studies biased riffle shuffles, first defined by Diaconis, Fill, and Pitman. These shuffles generalize the well-studied Gilbert-Shannon-Reeds shuffle and convolve nicely…
Cycle indices for the finite classical groups
Jason Fulman
This paper defines and develops cycle indices for the finite classical groups. These tools are then applied to study properties of a random matrix chosen uniformly from one of thes…
A probabilistic approach toward the finite general linear and unitary groups
Jason Fulman
Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moeb…
Probabilistic measures and algorithms arising from the Macdonald symmetric functions
Jason Fulman
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to t…