On the geometry of global function fields, the Riemann-Roch theorem, and finiteness properties of S-arithmetic groups

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Harder's reduction theory provides filtrations of euclidean buildings that allow one to deduce cohomological and homological properties of S-arithmetic groups over global function fields. In this survey I will sketch the main points of Harder's reduction theory starting from Weil's geometry of numbers and the Riemann-Roch theorem, describe a filtration that is particularly useful for deriving finiteness properties of S-arithmetic groups, and state the rank conjecture and its partial verifications that do not restrict the cardinality of the underlying field of constants. As a motivation for further research I also state a much more general conjecture on isoperimetric properties of S-arithmetic groups over global fields (number fields or function fields).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the geometry of global function fields, the Riemann-Roch theorem, and finiteness properties of S-arithmetic groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the geometry of global function fields, the Riemann-Roch theorem, and finiteness properties of S-arithmetic groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the geometry of global function fields, the Riemann-Roch theorem, and finiteness properties of S-arithmetic groups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-165673

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.