Date/Time : 12 May 2026 14:00
Venue : S17 #05-12 (Seminar Room 4)
Speaker : LIU Jie, Chinese Academy of Sciences

I will report a joint work with Baohua Fu proving that most Hamiltonian reductions of cotangent bundles are affine closures of cotangent bundles, together with some applications.

Add to calendar :

Date/Time : 04 May 2026 15:00
Venue : S17 #04-04 (Seminar Room 3)
Speaker : Chung Pang Mok , Shanghai Institute for Mathematics and Interdisciplinary Sciences

In this talk we discuss the Birch and Swinnerton-Dyer formula modulo square of rational numbers for the quadratic twist family of a given elliptic curve over Q. In particular we show the following: let E be a semistable elliptic curve over Q with conductor N, whose analytic rank is at most one, then for any positive fundamental discriminant D that is relatively prime to N, such that the quadratic twist E^D again has analytic rank at most one, we have that the Birch and Swinnerton-Dyer formula modulo square of rational numbers holds for E if and only if it holds for E^D.

Joint work with Alexander Barrios.

Add to calendar :

Date/Time : 29 Apr 2026 15:00
Venue : S17 #04-06 (Seminar Room 1)
Speaker : Juncheng Wei, The Chinese University of Hong Kong

In 2023, one year before his death, H. Brezis posted 28 open questions which he described as “challenging and difficult”. In this talk I will give complete answer to the first open question—Problem 1.1 on Brezis-Nirenberg problem on three dimensional unit ball, and the seventh open question—Problem 3.1 on harmonic map equation on disk.

Add to calendar :

Date/Time : 15 Apr 2026 16:30
Venue : S17 #05-11 (Seminar Room 5)
Speaker : Zhang Junyi, Nanyang Technological University

Quantum Approximate Optimization Algorithm (QAOA) was proposed as a variational quantum algorithm for solving combinatorial optimization problems. In this talk, I will discuss some recent observations in quantum circuit dynamics of QAOA. We identify three dynamical phases in the quantum circuits: 1) quasi-adiabatic phase, 2) quantum chaotic phase, and 3) shallow circuit phase. Particularly, we find that the quasi-adiabatic phase and the shallow circuit phase are separated by a dynamical quantum critical point indicated by the entanglement entropy. Moreover, the quantum chaotic phase emerges in digitized quantum circuit while absent for continuous unitary evolution. Our study calls for better understanding of quantum algorithms realized in quantum circuits.

Add to calendar :

Date/Time : 10 Apr 2026 14:00
Venue : S17 #04-06 (Seminar Room 1)
Speaker : Samuel Hon, National University of Singapore

The closures of conjugacy classes in classical real linear lie groups were determined by Djokovic in his 1982 paper. Through a series of theorems, the proof reduces to mainly combinatorial arguments which aren’t difficult, but tedious to check. In this talk, I will discuss how we are formalizing the proof in LEAN and how this makes the checks simpler. I will begin with a short introduction on the proof, how and why LEAN works, and how we can leverage AI to simplify and speed up the process.

Add to calendar :

Date/Time : 08 Apr 2026 14:00
Venue : S17 #04-04 (Seminar Room 3)
Speaker : Fabrizio Bianchi , University of Pisa, Italy

Around 1980, Ruelle gave an explicit second-order expansion at c=0 of the Hausdorff dimension of the Julia set of the quadratic family f_c(z)=z^2+c. McMullen later extended this result to polynomial perturbations of z^d for arbitrary degree d. I will discuss an analogue of this problem and formula for skew-product maps of C^2. This is a joint work with Yan Mary He.

Add to calendar :

Date/Time : 08 Apr 2026 16:30
Venue : S17 #05-11 (Seminar Room 5)
Speaker : Feng Yue, Xi'an Jiaotong University

In this talk, I will introduce the long-time problem for the nonlinear Schrodinger equation (NLSE) with weak nonlinearity, which is characterized by with a dimensionless parameter. We solve the NLSE using various temporal discretization, including finite difference methods, exponential integrators and time-splitting methods combined with different spatial discretization. By introducing a new technique–Regularity Compensation Oscillation (RCO) which controls the high frequency modes by the regularity of the exact solution and analyzes the low frequency modes by phase cancellation and energy method, we carry out the improved uniform error bounds for the time-splitting Fourier pseudospectral method in the long-time regime. In addition, we design new exponential integrators for the low-regularity initial data and extend this result to other dispersive PDEs.

Add to calendar :

Date/Time : 08 Apr 2026 15:00
Venue : S17 #04-04 (Seminar Room 3)
Speaker : Rao Rui, National University of Singapore

Consider the family of all k-element subsets of {1,…,n}. A subfamily F is called intersecting if any two of its sets have non empty intersection. Huang and Zhao proved that when n>2k, every intersecting family F contains an element i in [n] that belongs to at most {n-2 \choose k-2} members of F. This bound is tight, being attained by 1-star: all k-sets containing a fixed element.

We show that, for n sufficiently large (depending on k), all but at most k+1 elements of [n] have the same property: each of those elements appears in at most {n-2 \choose k-2} sets of F. The number k+1 is tight because of the Hilton-Milner construction of non trivial intersecting family.

This is joint work with Hao Huang.

Add to calendar :

Date/Time : 08 Apr 2026 16:00
Venue : S17 #04-04 (Seminar Room 3)
Speaker : Ho Boon Suan, National University of Singapore

Given a bipartite graph G with parts of size m and n, Ehrenborg conjectured in 2006 that the number of spanning trees in G is at most the product of all vertex degrees, divided by mn. We will discuss a linear-algebraic proof of this bound, including a characterization of when equality holds.

Add to calendar :