演講公告

演講主題：Spanning trees and continued fractions
主講人：Swee Hong Chan 教授 (羅格斯大學)
演講日期：2026年3月31日(星期二) 14:00 –15:00
演講地點：(光復校區) 科學一館213室
摘要內容：
Abstract

Consider the set of positive integers representing the number of spanning trees in simple graphs with n vertices. How quickly can this set grow as a function of n? In this talk, we discuss a proof of the exponential growth of this set, which resolves an open problem of Sedlacek from 1966. The proof uses a connection with continued fractions and advances towards Zaremba’s conjecture in number theory. This is joint work with Alex Kontorovich and Igor Pak. This talk is intended for general audience.
相關檔案：Talk_1150331.pdf

$返回$ go back