2011/12/13 by Stefan Witzel, Witzel, Stefan
Computer Science · Mathematics · #Algebraic Geometry and Number Theory #Coding theory and cryptography #Finite Group Theory Research #math.GR #math.GT #msc:20E42 #msc:20F65 #msc:51E24 #msc:57M07
paper · pdf · doi:10.48550/arxiv.1112.2961
119 pages, 10 figures, v2 with new introduction
arxiv created 2012/09/18 · arxiv updated 2012/09/19
In these notes we determine the finiteness length of the groups G(OS) where G is an Fq-isotropic, connected, noncommutative, almost simple Fq-group and OS is one of Fq[t], Fq[t-1], and Fq[t,t-1]. That is, k = Fq(t) and S contains one or both of the places s0 and s_∞ corresponding to the polynomial p(t) = t respectively to the point at infinity. The statement is that the finiteness length of G(OS) is n-1 if S contains one of the two places and is 2n-1 if it contains both places, where n is the Fq-rank of G. For example, the group SL3(Fq[t,t-1]) is of type F3 but not of type F4, a fact that was previously unknown.