Exposés de recherche

Collection Exposés de recherche

00:00:00 / 00:00:00
23 380

Unramified graph covers of finite degree

By Winnie Li

Also appears in collection : Dynamics and graphs over finite fields: algebraic, number theoretic and algorithmic aspects / Dynamique et graphes sur les corps finis : aspects algebriques, arithmétiques et algorithmiques

Given a finite connected undirected graph $X$, its fundamental group plays the role of the absolute Galois group of $X$. The familiar Galois theory holds in this setting. In this talk we shall discuss graph theoretical counter parts of several important theorems for number fields. Topics include (a) Determination, up to equivalence, of unramified normal covers of $X$ of given degree, (b) Criteria for Sunada equivalence, (c) Chebotarev density theorem. This is a joint work with Hau-Wen Huang.

Information about the video

Citation data

  • DOI 10.24350/CIRM.V.18951603
  • Cite this video Li, Winnie (30/03/2016). Unramified graph covers of finite degree. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.18951603
  • URL https://dx.doi.org/10.24350/CIRM.V.18951603

Bibliography

  • Cassels, J.W.S. (Ed.), & Fröhlich, A. (Ed.). (2010). Algebraic number theory. London: London Mathematical Society
  • Huang, H-W., & Li, W. Unramified graph covers of finite degree, preprint, 2015
  • Somodi, M. (2015). On Sunada equivalent graph coverings. Journal of Combinatorics and Number Theory, 7(2)
  • A. Terras, Zeta Functions of Graphs: A Stroll through the Garden. Cambridge Studies in Advanced Mathematics, vol. 128 (2010) - http://bibli.cirm-math.fr/Record.htm?idlist=1&record=19271403124910996859

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback