2008
DOI: 10.1007/s00222-008-0142-x
|View full text |Cite
|
Sign up to set email alerts
|

Mixed Hodge polynomials of character varieties

Abstract: We calculate the E-polynomials of certain twisted GL(n, C)-character varieties M n of Riemann surfaces by counting points over finite fields using the character table of the finite group of Lie-type GL(n, F q ) and a theorem proved in the appendix by N. Katz. We deduce from this calculation several geometric results, for example, the value of the topological Euler characteristic of the associated PGL(n, C)-character variety. The calculation also leads to several conjectures about the cohomology of M n : an exp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

16
372
0
8

Year Published

2012
2012
2022
2022

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 233 publications
(396 citation statements)
references
References 57 publications
16
372
0
8
Order By: Relevance
“…On the other hand, a curious hard Lefschetz theorem is conjectured in [32,Conj. 4.2.7] to hold for the character variety for PGL n , which would of course follow, if P = W , from the relative hard Lefschetz theorem.…”
Section: )mentioning
confidence: 99%
See 2 more Smart Citations
“…On the other hand, a curious hard Lefschetz theorem is conjectured in [32,Conj. 4.2.7] to hold for the character variety for PGL n , which would of course follow, if P = W , from the relative hard Lefschetz theorem.…”
Section: )mentioning
confidence: 99%
“…Character variety. In this section, we recall some definitions and results from [32]. Throughout the paper, the singular homology and cohomology groups are taken with rational coefficients.…”
Section: 2mentioning
confidence: 99%
See 1 more Smart Citation
“…For more general applications (to quiver and character varieties) we refer the reader to [1] and [2].…”
mentioning
confidence: 99%
“…a function called degree such that (1) there are finitely many colors of a given degree; (2) there is a unique color 0 ∈ C of degree 0. A coloring on X is a map…”
mentioning
confidence: 99%