On gcd-graphs over polynomial rings
Speaker: Nguyễn Duy Tân (Hanoi University of Science and Technology)

Time: Thursday, September 5, from 2pm to 4pm (Hanoi time).

Abstract: A gcd-graph over the ring of integers modulo n is a  natural generalization of unitary Cayley graphs. The study of these gcd-graphs has foundations in various mathematical fields, including number theory, ring theory, and representation theory. Inspired by the analogy between number fields  and function fields, we define and study gcd-graphs over polynomial rings with coefficients in finite fields. This is joint work with Jan Minac, Tung T. Nguyen.

Back