Speaker: Valerii Sopin (SIMIS)
Time: 2025-10-13 16:00-17:00
Location: 1710, SIMIS
Zoom Meeting ID: 844 0594 7424 Passcode: 076895
摘要:
In this talk, we study the possible bifurcations of periodic orbits by reducing them to graphs. The aforementioned allows to study the genericity of routes to chaos, as well as to analyze their possible complexity by applying graph-theoretic tools. In particular, we will prove there is no upper bound on the possible complexity of routes to chaos, which correlates well with several numerical studies. Time permitting, we will also discuss how our results suggest general fermionic description of bifurcations via the virial expansion, and a universal description via the Rado graph.
About Speaker:
Dr. Valerii Sopin is a Postdoc Research Scholar at Shanghai Institute for Mathematics and Interdisciplinary Sciences (SIMIS). Recently, he received his PhD in Mathematical Sciences from Tsinghua University. He obtained master’s degrees in Mathematical Sciences and Computer Sciences from the best Universities in Russia. His current research interests include representation theory and category theory, as well as their applications to study Dynamical Systems.

 简体中文
简体中文				 English
English