Pith. sign in

REVIEW

Splitting fields of characteristic polynomials of random elements in arithmetic groups

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1008.3662 v4 pith:3YX32JW5 submitted 2010-08-21 math.NT

Splitting fields of characteristic polynomials of random elements in arithmetic groups

classification math.NT
keywords groupsplittingalgebraicarithmeticcharacteristicclassescomputedconjugacy
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We discuss rather systematically the principle, implicit in earlier works, that for a "random" element in an arithmetic subgroup of a (split, say) reductive algebraic group over a number field, the splitting field of the characteristic polynomial, computed using any faitfhful representation, has Galois group isomorphic to the Weyl group of the underlying algebraic group. Besides tools such as the large sieve, which we had already used, we introduce some probabilistic ideas (large deviation estimates for finite Markov chains) and the general case involves a more precise understanding of the way Frobenius conjugacy classes are computed for such splitting fields (which is related to a map between regular elements of a finite group of Lie type and conjugacy classes in the Weyl group which had been considered earlier by Carter and Fulman for other purposes; we show in particular that the values of this map are equidistributed).

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.