This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially when working over finite fields ...

We call a non-discrete Euclidean building a Bruhat-Tits space if its automorphism group contains a subgroup that induces the subgroup generated by all the root groups of a root datum of the building ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...