Homological stability for classical groups over finite fields

Author(s):  
Eric M. Friedlander
Author(s):  
Weiyan Chen

Abstract We prove that the space of complex irreducible polynomials of degree $d$ in $n$ variables satisfies two forms of homological stability: first, its cohomology stabilizes as $d\to \infty $, and second, its compactly supported cohomology stabilizes as $n\to \infty $. Our topological results are inspired by counting results over finite fields due to Carlitz and Hyde.


Author(s):  
Azice C. Niemeyer ◽  
Cheryl E. Praeger

AbstractIn a previous paper the authors described an algorithm to determine whether a group of matrices over a finite field, generated by a given set of matrices, contains one of the classical groups or the special linear group. The algorithm was designed to work for all sufficiently large field sizes and dimensions of the matrix group. However, it did not apply to certain small cases. Here we present an algorithm to handle the remaining cases. The theoretical background of the algorithm presented in this paper is a substantial extension of that needed for the original algorithm.


1983 ◽  
Vol 51 ◽  
pp. 9-15 ◽  
Author(s):  
Hiroyuki Ishibashi

1997 ◽  
Vol 174 (1-3) ◽  
pp. 365-381 ◽  
Author(s):  
Zhe-xian Wan

2001 ◽  
Vol 64 (1) ◽  
pp. 121-129
Author(s):  
Andrew J. Spencer

For some of the classical groups over finite fields it is possible to express the proportion of eigenvalue-free matrices in terms of generating functions. We prove a theorem on the monotonicity of the coefficients of powers of power series and apply this to the generating functions of the general linear, symplectic and orthogonal groups. This proves a conjecture on the monotonicity of the proportions of eigenvalue-free elements in these groups.


2000 ◽  
Vol 234 (2) ◽  
pp. 367-418 ◽  
Author(s):  
Peter M. Neumann ◽  
Cheryl E. Praeger

Sign in / Sign up

Export Citation Format

Share Document