Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Mittagsseminar Talk Information

Date and Time: Tuesday, May 20, 2025, 12:15 pm

Duration: 30 minutes

Location: OAT S15

Speaker: David Fisac (Universitat Autònoma de Barcelona)

A combinatorial perspective on Markov numbers (through geometry)

In this talk, we will introduce the well-known—yet still open—Markov Uniqueness Conjecture on Markov numbers, first proposed by Fröbenius in 1903. We will explore how the geometry of the modular torus leads to a reformulation of the conjecture in terms of the lengths of simple closed curves. Furthermore, we will show how the torus’s hyperbolic structure allows a purely combinatorial reformulation involving almost-equidistributed necklaces of positive integers. This new perspective has yet to be exploited for reproving known partial results or uncovering potential advances. The talk is intended for a broad audience, and no prior background will be assumed.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2025  2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login