In this talk, we introduce a two-dimensional semiflexible membrane model whose Hamiltonian is given by $H[\phi]=\sum_x |\nabla \phi_x|^2 +N^\lambda |\Delta \phi_x|^2$, interpolating between the discrete Gaussian free field (DGFF) and the membrane model (MM). We analyze its infinite-volume behavior and identify distinct regimes depending on the parameter $\lambda$. If $\lambda<0$, the covariance behaves similarly to that of the DGFF, while for $\lambda>2$, it resembles a rescaled MM. In the intermediate regime $0\le \lambda\le 2$, we observe a qualitatively different behavior: a nontrivial dependence on the distance between points. We further determine the leading order constant of the covariance. These results provide a unified description of the crossover from gradient-dominated to curvature-dominated behavior in this class of models.

We study the dynamics of a single vortex ring of small cross-section in the three-dimensional incompressible Euler equations. For a broad class of initial vorticities concentrated near a vortex ring, we prove that the solution remains sharply localized around a moving core for all times and propagates along its axis with the classical logarithmic speed predicted by the vortex filament conjecture. Moreover, we show that such vortex rings are dynamically unstable under arbitrarily small perturbations: suitable smooth perturbations lead to linear-in-time filamentation in the axial direction. These results provide a quantitative description of the coexistence of long-time coherence and instability mechanisms for vortex rings in inviscid flows.

This lecture series is based on the 6 lectures I gave at the instructional workshop "Iwasawa Theory over function fields" at ICMAT (Madrid, Spain). The aim of this lecture series is to explain the formulation of the equivariant BSD conjecture over global function fields, following the joint work with D. Burns and M. Kakde. In the next two--three talks, I will explain the backgrounds on K_1 and relative K_0 of group rings for finite groups over local/global fields of characteristic 0 and their orders.

Separating hash families are useful combinatorial structures that generalize several well-studied objects in cryptography and coding theory. Let $p_t(N, q)$ denote the maximum size of the universe for a $t$-perfect hash family of length $N$ over an alphabet of size ( q ). We show that $q^{2 – o(1)} < p_t(t, q) = o(q^2)$ for all  $t \ge 3$, thereby resolving an open problem raised by Blackburn et al. (2008) for certain parameter ranges. Previously, this result was known only for $t = 3$ and $t = 4$. Our approach establishes the existence of a large set of integers that avoids nontrivial solutions to a system of correlated linear equations. This is joint work with Xiande Zhang and Gennian Ge.

In this talk, we discuss the existence and stability of subsonic potential flow for the steady Euler--Poisson system in a 2-dimensional nozzle of finite length with prescribing some suitable boundary conditions. The purpose of this talk is to introduce the small-perturbation method for the steady Euler--Poisson system, which reduces to an elliptic system in our present situation. As a starting point of our discussion, we introduce the notion of background solution about which we may linearize the equations, and then point out the property of the linearized coefficients that turns out to be extremely crucial for the $$H^1$$-estimates. Next, we establish the iteration scheme and show the necessary estimates in a very brief manner, which may immediately lead us to the proof of the main existence and stability theorem. Finally, if time permits, we will take a glance at the general situation such as flows with nonzero vorticity. Main Reference: M. Bae, B. Duan, and C. Xie, Subsonic Flow for the Multidimensional Euler–Poisson System, Arch. Rational Mech. Anal. 220 (2016), 155–191.

Hirzebruch proved a beautiful inequality for complex line arrangements in CP^2, giving strong bounds on the their combinatorics. In the quest for a topological proof of this inequality, Paolo Aceto and I studied odd and even line arrangements (which I will define in the talk). We proved Hirzebruch-like inequalities for these arrangements, and drew some corollaries about configurations of lines. Time (and audience) permitting, I will also discuss some more speculative ideas and generalisations of our results.

Curves in the complex projective planes can be viewed as PL-submanifolds. Taking this perspective allows to deduce a number of interesting results about them. The goal of these lectures is two-fold: first, I will give a topological description of some algebro-geometric objects (singularities and Milnor fibres, curves, blow-ups), and then I will talk about some topological tools one can use to study complex curves. I will focus on rational cuspidal curves (those which are homeomorphic to spheres) and line arrangements (collections of lines).

Curves in the complex projective planes can be viewed as PL-submanifolds. Taking this perspective allows to deduce a number of interesting results about them. The goal of these lectures is two-fold: first, I will give a topological description of some algebro-geometric objects (singularities and Milnor fibres, curves, blow-ups), and then I will talk about some topological tools one can use to study complex curves. I will focus on rational cuspidal curves (those which are homeomorphic to spheres) and line arrangements (collections of lines).

In this talk, we discuss the initial–boundary value problem for one-dimensional hyperbolic conservation laws on the half-line, focusing on linear systems and scalar conservation laws. We begin with a discussion of the theory of the Cauchy problem. We then turn to the half-line setting, where we introduce two formulations of boundary conditions: one based on the vanishing viscosity method and the other based on the Riemann problem. We show that these two formulations are equivalent for linear systems and scalar conservation laws. Finally, we present remarks on boundary conditions for general hyperbolic systems of conservation laws. Reference: Dubois, F., and LeFloch, P. Boundary conditions for nonlinear hyperbolic systems of conservation laws. J. Differential Equations 71, 1 (1988), 93–122.

In this talk, I will begin by presenting some classic constructions of smooth non-orientable 4-manifolds arising from certain Brieskorn homology 3-spheres. I will then explain how to construct new examples, including infinitely many smooth fake copies of *RP4#*CP2. In addition, I will describe a method for generating a collection of Brieskorn homology 3-spheres that can be realized via integer surgery on knots in the 3-sphere. This is joint work with Jae Choon Cha and Oguz Savk.

Curves in the complex projective planes can be viewed as PL-submanifolds. Taking this perspective allows to deduce a number of interesting results about them. The goal of these lectures is two-fold: first, I will give a topological description of some algebro-geometric objects (singularities and Milnor fibres, curves, blow-ups), and then I will talk about some topological tools one can use to study complex curves. I will focus on rational cuspidal curves (those which are homeomorphic to spheres) and line arrangements (collections of lines).

Hamiltonian dynamics is a fundamental mathematical framework for describing classical mechanics, and it can be formulated in terms of vector fields on manifolds. While studying the three-body problem, a central example in Hamiltonian dynamics, Poincaré highlighted the crucial role of periodic orbits. This theme remains central in modern symplectic geometry. In this talk, we introduce the relationship between Hamiltonian dynamics and symplectic geometry, and survey classical and modern approaches to the study of periodic orbits. We also explain how minimal period orbits can be understood from a symplectic-geometric perspective and present an approach to establishing the existence of Birkhoff sections of minimal area using these ideas.

Curves in the complex projective planes can be viewed as PL-submanifolds. Taking this perspective allows to deduce a number of interesting results about them. The goal of these lectures is two-fold: first, I will give a topological description of some algebro-geometric objects (singularities and Milnor fibres, curves, blow-ups), and then I will talk about some topological tools one can use to study complex curves. I will focus on rational cuspidal curves (those which are homeomorphic to spheres) and line arrangements (collections of lines).

This lecture series is based on the 6 lectures I gave at the instructional workshop "Iwasawa Theory over function fields" at ICMAT (Madrid, Spain). The aim of this lecture series is to explain the formulation of the equivariant BSD conjecture over global function fields, following the joint work with D. Burns and M. Kakde. In the first three talks, I will explain the backgrounds on Selmer groups and flat cohomology.

In this seminar, we study the Vlasov–Maxwell system, a fundamental collisionless kinetic model for plasmas, posed in a three-dimensional half-space with boundaries. We begin with a brief warm-up by revisiting the one-dimensional Vlasov–Poisson system in the absence of magnetic fields, focusing on Penrose’s classical 1960 spectral criterion for linear stability and instability. We then turn to the full Vlasov–Maxwell system and discuss the major analytical difficulties introduced by electromagnetic coupling, boundary effects, and nonlinear interactions. In particular, we highlight the role of an effective gravitational force directed toward the boundary and its interplay with boundary temperature conditions. This viewpoint naturally leads us to formulate a conjectural linear instability criterion associated with boundary-induced confinement effects. Within this framework, we construct global-in-time classical solutions to the nonlinear Vlasov–Maxwell system beyond the vacuum scattering regime. Our approach combines the construction of stationary boundary equilibria with a proof of their asymptotic stability in the $L^\infty$ setting under small perturbations. This work provides a new framework for analyzing long-time plasma dynamics in bounded domains with interacting magnetic fields. To our knowledge, it yields the first construction of asymptotically stable non-vacuum steady states for the full three-dimensional nonlinear Vlasov–Maxwell system. This is joint work with Chanwoo Kim.

Wenrui Hao Data-driven modeling is essential for deciphering complex biological systems, yet its utility is often constrained by two fundamental hurdles: the inability to guarantee parameter identifiability and the high computational cost of learning nonlinear dynamics. This talk introduces a unified computational framework designed to overcome these challenges, bridging theoretical rigor with scalable machine learning. The first component of the framework establishes a computational foundation for practical identifiability. By leveraging the Fisher Information Matrix and its theoretical links to coordinate identifiability, we propose an efficient method for identifiability assessment. We further introduce regularization-based strategies to manage non-identifiable parameters, thereby enhancing model reliability and facilitating robust uncertainty quantification. To address the discovery of nonlinear dynamics, we present the Laplacian Eigenfunction-Based Neural Operator (LE-NO). This operator learning framework is specifically engineered for modeling reaction–diffusion equations. By projecting nonlinear operators onto Laplacian eigenfunctions, LE-NO achieves superior computational efficiency and generalization across varying boundary conditions, effectively bypassing the limitations of large-scale architectures and data scarcity. Finally, we demonstrate the framework’s utility in the context of Alzheimer’s disease modeling. We show that this integrated approach ensures reliable parameter inference while capturing the intricate nonlinear dynamics of disease progression, providing a critical step toward the development of high-fidelity digital twins for neurodegenerative pathology.

Wenrui Hao Data-driven modeling is essential for deciphering complex biological systems, yet its utility is often constrained by two fundamental hurdles: the inability to guarantee parameter identifiability and the high computational cost of learning nonlinear dynamics. This talk introduces a unified computational framework designed to overcome these challenges, bridging theoretical rigor with scalable machine learning. The first component of the framework establishes a computational foundation for practical identifiability. By leveraging the Fisher Information Matrix and its theoretical links to coordinate identifiability, we propose an efficient method for identifiability assessment. We further introduce regularization-based strategies to manage non-identifiable parameters, thereby enhancing model reliability and facilitating robust uncertainty quantification. To address the discovery of nonlinear dynamics, we present the Laplacian Eigenfunction-Based Neural Operator (LE-NO). This operator learning framework is specifically engineered for modeling reaction–diffusion equations. By projecting nonlinear operators onto Laplacian eigenfunctions, LE-NO achieves superior computational efficiency and generalization across varying boundary conditions, effectively bypassing the limitations of large-scale architectures and data scarcity. Finally, we demonstrate the framework’s utility in the context of Alzheimer’s disease modeling. We show that this integrated approach ensures reliable parameter inference while capturing the intricate nonlinear dynamics of disease progression, providing a critical step toward the development of high-fidelity digital twins for neurodegenerative pathology.

Wenrui Hao Data-driven modeling is essential for deciphering complex biological systems, yet its utility is often constrained by two fundamental hurdles: the inability to guarantee parameter identifiability and the high computational cost of learning nonlinear dynamics. This talk introduces a unified computational framework designed to overcome these challenges, bridging theoretical rigor with scalable machine learning. The first component of the framework establishes a computational foundation for practical identifiability. By leveraging the Fisher Information Matrix and its theoretical links to coordinate identifiability, we propose an efficient method for identifiability assessment. We further introduce regularization-based strategies to manage non-identifiable parameters, thereby enhancing model reliability and facilitating robust uncertainty quantification. To address the discovery of nonlinear dynamics, we present the Laplacian Eigenfunction-Based Neural Operator (LE-NO). This operator learning framework is specifically engineered for modeling reaction–diffusion equations. By projecting nonlinear operators onto Laplacian eigenfunctions, LE-NO achieves superior computational efficiency and generalization across varying boundary conditions, effectively bypassing the limitations of large-scale architectures and data scarcity. Finally, we demonstrate the framework’s utility in the context of Alzheimer’s disease modeling. We show that this integrated approach ensures reliable parameter inference while capturing the intricate nonlinear dynamics of disease progression, providing a critical step toward the development of high-fidelity digital twins for neurodegenerative pathology.

Generative modeling has emerged as a powerful tool for molecular design and structure prediction, offering the ability for molecular discovery. However, challenges such as synthetic feasibility, novelty, diversity of generated molecules, and generalization ability of predictions remain critical for real-world applications, particularly in drug discovery. In this presentation, we introduce an overview of state-of-the-art generative models, including graph-based methods, generative flow networks, and diffusion methods, all aimed at addressing these challenges. First, we will show how generative modeling can facilitate the structural prediction of protein-ligand complexes and its expansion. Second, we focus on strategies that improve the synthesizability of generated molecules by incorporating chemical reaction templates, enabling the generation of novel compounds that are not only drug-like but also synthetically accessible. Third, large language models fine-tuned with drug-related data can be used to elucidating complex relationships between drugs, proteins, and diseases. Through case studies in drug design and broader molecular applications, we demonstrate how these generative modeling can help accelerate drug discovery, offering a pathway to more practical and innovative solutions across molecular discovery domains.

Diffusion is a macroscopic phenomenon arising from the random movement of particles at the microscopic level. Fick’s law predicts uniform spreading of particles over time, while fractionation is often observed in heterogeneous environments, as in the Soret effect and Darken’s experiment. In this talk, we show that such heterogeneous diffusion can be described by a two-coefficient diffusion equation derived from particle dynamics. In particular, for persistent random walks, fractionation occurs only when both heterogeneity and anisotropy are present. We formally derive the limiting diffusion equation and present a methodology to rigorously establish convergence from a persistent discrete kinetic equation to the macroscopic diffusion equation.

This talk provides an overview of Photoacoustic Tomography (PAT) from both the imaging and mathematical perspectives, and then develops a unified integral-transform viewpoint via a generalized spherical mean operator. In PAT, a short optical pulse induces an initial acoustic pressure distribution \(f(\mathbf x)\), which evolves according to a wave equation. The measured time-dependent acoustic data on an acquisition surface \(\Gamma\) form the forward map, and the central inverse problem is to reconstruct \(f\) from boundary observations. Key mathematical issues include uniqueness, and explicit reconstruction formulas, all of which depend sensitively on the measurement geometry and observation time.

his lecture series is based on the 6 lectures I gave at the instructional workshop "Iwasawa Theory over function fields" at ICMAT (Madrid, Spain). The aim of this lecture series is to explain the formulation of the equivariant BSD conjecture over global function fields, following the joint work with D. Burns and M. Kakde. In the first two or three talks, I will explain the backgrounds on Selmer groups and flat cohomology.

Strong flip-flatness appears to be the analogue of uniform almost-wideness in the setting of dense classes of graphs. Almost-wideness is a notion that was central in different characterisations of nowhere dense classes of graphs, and in particular the game-theoretic one. In this talk I will present the flip-flatness notions and conjectures about the characterization of strongly flip-flat graph classes. Then, I will present a proof that strongly flip-flat classes of graphs that are weakly sparse are indeed uniformly almost-wide, making a step towards their characterisation. A consequence is a characterization of strongly flip-flat graph classes with low rank-depth colourings. This is a joint work with F. Ghasemi, J. Grange and F. Madelaine.

In this talk, we study the non-cutoff Boltzmann equation with moderately soft potentials, a classical kinetic model. The uniqueness of large weak solutions is challenging due to the nonlinearity and limited regularity. To overcome these difficulties, we utilize dilated dyadic decompositions in phase space $(v,\xi,\eta)$ to capture hypoellipticity and reduce the fractional derivative structure $(-\Delta_v)^s$ of the Boltzmann collision operator to a zeroth-order form. Within this framework, we establish the uniqueness of large-data weak solutions under the assumption of finite $L^2$--$L^r$ energy, namely that $\|\mu^{-\frac{1}{2}}(F-\mu)\|_{L^\infty_t L^{r}_{x,v}}+\|\mu^{-\frac{1}{2}}(F-\mu)\|_{L^\infty_t L^2_{x,v}}$ is bounded for some sufficiently large $r>0$. The challenges arising from large solutions are handled via a negative-order hypoelliptic estimate, which yields additional integrability in $(t,x)$.

Stochastic modeling and analysis can help answer pressing medical questions. In this talk, I will attempt to justify this claim by describing recent work on two problems in medicine. The first problem concerns ovarian tissue cryopreservation, which is a proven tool to preserve ovarian follicles prior to gonadotoxic treatments. Can this procedure be applied to healthy women to delay or eliminate menopause? How can it be optimized? The second problem concerns medication nonadherence. What should you do if you miss a dose of medication? How can physicians design dosing regimens that are robust to missed/late doses? I will describe (a) how stochastics theory offers insights into these questions and (b) the mathematical questions that emerge from this investigation.

Any reasonable exotic phenomena in simply-connected 4-manifolds are unstable. It is an open question if there is an universal upper bound to the number of stabilizations needed. The case of 1 stabilization was proven in works of Lin and Guth-K., but whether we need more than two stabilizations has been open because it is significantly harder. In this talk, we discuss my recent proof with Park and Taniguchi that two stabilizations are indeed not enough for exotic diffeomorphisms.

A freshman can calculate that the probability of picking $k$ blue balls after sampling $n$ balls from a bin of $K$ blue balls and $N-K$ red balls is $$\frac{\dbinom{n}{k} \dbinom{N-n}{K-k}}{\dbinom{N}{K}}$$ if one samples without replacement, while it is $$\frac{\dbinom{n}{k} (\frac{K}{N})^k(\frac{N-K}{N})^{n-k}$$ if one samples with replacement. We demonstrate that comparing probabilities of sampling with replacement vs. without replacement leads to De Finetti's Theorem, the Aldous-Hoover Theorem, and even a weak form of Szemeredi's Regularity Lemma which plays a crucial role in the study of graphons. This comparison also leads to a strong version of a representation for DAG-exchangeable arrays (Jung, Lee, Staton, Yang (2021)) which generalize Aldous-Hoover arrays as well as Hierarchical Exchangeable arrays (Austin-Panchenko (2014)).

This lecture series is based on the 6 lectures I gave at the instructional workshop "Iwasawa Theory over function fields" at ICMAT (Madrid, Spain). The aim of this lecture series is to explain the formulation of the equivariant BSD conjecture over global function fields, following the joint work with D. Burns and M. Kakde. In the first two talks, I will explain the backgrounds on Selmer groups and flat cohomology.

We overview the recent resolution of a 1985 open problem of Gyárfás, that chromatic number is polynomially bounded by clique number for graphs with no induced five-vertex path. The proof introduces a chromatic density framework involving chromatic quasirandomness and chromatic density increment, which allows us to deduce the desired statement from the Erdős–Hajnal result for the five-vertex path.

We establish the stability of a pair of Hill's spherical vortices moving away from each other in 3D incompressible axisymmetric Euler equations without swirl. Each vortex in the pair propagates away from its odd-symmetric counterpart, while keeping its vortex profile close to Hill's vortex. This is achieved by analyzing the evolution of the interaction energy of the pair and combining it with the compactness of energy-maximizing sequences in the variational problem concerning Hill's vortex. The key strategy is to confirm that, if the interaction energy is initially small enough, the kinetic energy of each vortex in the pair remains so close to that of a single Hill's vortex for all time that each vortex profile stays close to the energy maximizer: Hill's vortex. An estimate of the propagating speed of each vortex in the pair is also obtained by tracking the center of mass of each vortex. This estimate is optimal in the sense that the power exponent of the epsilon (the small perturbation measured in the "L^1+L^2+impulse" norm) appearing in the error bound cannot be improved. This talk is based on the paper [Y.-J. Sim, Nonlinearity, 2026].

The celebrated formula of Otter \emph{[Ann. of Math. (2) 49 (1948), 583--599]} asserts that the complete graph contains exponentially many non-isomorphic spanning trees. In this paper, we show that every connected almost regular graph with sufficiently large degree already contains exponentially many non-isomorphic spanning trees. Indeed, we prove a stronger statement: for every fixed $n$-vertex tree $T$, $$\Pr\bigl[\mathcal{T} \simeq_{\mathrm{iso}} T\bigr] = e^{-\Omega(n)},$$ where $\mathcal{T}$ is a uniformly random spanning tree of a connected $n$-vertex almost regular graph with sufficiently large degree. To prove this, we introduce a graph-theoretic variant of the classical balls--into--bins model, which may be of independent interest.

Biochemical reaction networks and gene regulatory networks in cells are prototypical examples of complex systems, characterized by highly nonlinear and stochastic, multilevel dynamical interactions. Gaining a deep understanding of the stochastic dynamics and thermodynamic principles governing biochemical reaction networks not only helps elucidate the intrinsic mechanisms underlying cell fate decisions and the onset and progression of diseases, but also provides new theoretical paradigms for the study of complex systems. This line of research has become one of the forefront interdisciplinary areas, bridging mathematics, physics, biology, chemistry, statistics, and intelligent science. In this talk, I will present our recent research progress in this area, with the hope of stimulating further discussion and inspiring new ideas.

We consider the computation of internal solutions for a time domain plasma wave equation with unknown coefficients from the data obtained by sampling its transfer function at the boundary. The computation is performed by transforming the background snapshots for a known background coefficient using the Cholesky decomposition of the data-driven Gramian. We show that this approximation is asymptotically close to the projection of the internal solution onto the subspace of background snapshots. This allows us to derive a generally applicable bound for the error in the approximation of internal fields from boundary data only for a time domain plasma wave equation with an unknown potential q. We use this to show convergence for general unknown $q$ in one dimension. We show numerical experiments and applications to SAR imaging in higher dimensions.

---

Meeting ID: 830 2123 3470 Passcode: 080691

A backedge graph of a tournament $T$ with respect to a total ordering $\prec$ of the vertices of $T$ is a graph on $V(T)$ where $uv$ is an edge if and only if $uv \in A(T)$ and $v \prec u$. In 2023, Aboulker, Aubian, Charbit and Lopes introduced the clique number of tournaments based on backedge graphs as a natural counterpart to the dichromatic number of tournaments. Specifically, the clique number of a tournament is the minimum clique number of a backedge graph when considering all possible orderings. Given this definition, it is not immediately clear what the canonical clique object should be. In this talk, we provide an answer to this question. We show that if a tournament has large clique number, it contains a reasonably large subtournament from one of two simple and previously studied families of tournaments of unbounded clique number. This talk is based on joint work with Logan Crew, Xinyue Fan, Benjamin Moore, and Sophie Spirkl.

We discuss sharp local smoothing estimates for curve averages. The proof introduces a new method for estimating oscillatory integrals based on wave packet analysis and a high–low decomposition. We outline the main ideas of the local smoothing estimates for curve averages in three dimensions, focusing on the treatment of the relevant oscillatory integrals.

We will define twisted homology and Reidemeister torsion. These are invariants of smooth manifolds together with a representation. We will show that Reidemeister torsion can be used to classify lens spaces up to diffeomorphism and we will see that Reidemeister torsion can be used to give invariants of knots and links.

Bubbling is a form of singularity formation that commonly arises in critical partial differential equations. In the context of dispersive equations, this phenomenon is closely related to what is commonly known as soliton resolution: the asymptotic decomposition of solutions into a sum of several solitons (each modulated by time dependent parameters) and a radiation term. This talk focuses on classifying the asymptotic behavior of these modulation parameters, thereby providing a more refined understanding of bubbling dynamics. Modulation analysis serves as both the key methodology and the guiding philosophy. I will present several results in this direction.

We will define twisted homology and Reidemeister torsion. These are invariants of smooth manifolds together with a representation. We will show that Reidemeister torsion can be used to classify lens spaces up to diffeomorphism and we will see that Reidemeister torsion can be used to give invariants of knots and links.

We show how specific families of positive definite kernels serve as powerful tools in analyses of iteration algorithms for multiple layer feedforward Neural Network models. Our focus is on particular kernels that adapt well to learning algorithms for data-sets/features which display intrinsic self-similarities at feedforward iterations of scaling.

---

Meeting ID: 856 9123 8129 Passcode: 712180

We will define twisted homology and Reidemeister torsion. These are invariants of smooth manifolds together with a representation. We will show that Reidemeister torsion can be used to classify lens spaces up to diffeomorphism and we will see that Reidemeister torsion can be used to give invariants of knots and links.

Abstract: In this talk, we discuss finite-time blow-up dynamics for the nonlinear heat equation (NLH). We explain the notion of finite-time blow-up, introduce Type I and Type II blow-ups, and discuss the difference between these two behaviors. Restricting to radially symmetric solutions, we review known blow-up results and give a heuristic explanation of when only Type I blow-up is possible and when Type II blow-up may occur. Finally, we describe possible Type II blow-up scenarios through their formal mechanisms. Reference: [1] Hiroshi Matano, Frank Merle. On Nonexistence of type II blowup for a supercritical nonlinear heat equation. Communications on Pure and Applied Mathematics, 2004, 57. 1494 - 1541. [2] Asato Mukai, Yukihiro Seki. Refined construction of type II blow-up solutions for semilinear heat equations with Joseph–Lundgren supercritical nonlinearity. Discrete and Continuous Dynamical Systems, 2021, 41(10): 4847-4885

We will define twisted homology and Reidemeister torsion. These are invariants of smooth manifolds together with a representation. We will show that Reidemeister torsion can be used to classify lens spaces up to diffeomorphism and we will see that Reidemeister torsion can be used to give invariants of knots and links.

Many complete Riemannian manifolds of constant curvature, including complete hyperbolic manifolds, can be realized as quotients of convex domains in real projective spaces by discrete linear group actions. Among these discrete groups, an important and broad class is given by linear reflection groups (also called linear Coxeter groups). In dimension 3, many such linear reflection groups arise from hyperbolic reflection groups, using Andreev’s theorem, through small deformations and gluing constructions. In this talk, I will introduce these ideas and concepts, explain the basic picture, and discuss some recent developments related to the projective Andreev theorem.

Given two knots in a 3-manifold M (e.g. in Euclidean 3-space) the Gordian distance is defined as the minimal number of crossing changes needed to turn one knot into the other. I will discuss the relationship between the Gordian distance in Euclidean 3-space and Gordian distance in general 3-dimensional manifolds.

Two related papers will be discussed: 1. In 1966, Erdős, Goodman, and Pósa showed that if $G$ is an $n$-vertex graph, then at most $\lfloor n^2/4 \rfloor$ cliques of $G$ are needed to cover the edges of $G$, and the bound is best possible as witnessed by the balanced complete bipartite graph. This was generalized independently by Győri–Kostochka, Kahn, and Chung, who showed that every $n$-vertex graph admits an edge-decomposition into cliques of total `cost’ at most $2 \lfloor n^2/4 \rfloor$, where an $i$-vertex clique has cost $i$. Erdős suggested the following strengthening: every $n$-vertex graph admits an edge-decomposition into cliques of total cost at most $\lfloor n^2/4 \rfloor$, where now an $i$-vertex clique has cost $i-1$. We prove fractional relaxations and asymptotically optimal versions of both this conjecture and a conjecture of Dau, Milenkovic, and Puleo on covering the $t$-vertex cliques of a graph instead of the edges. Our proofs introduce a general framework for these problems using Zykov symmetrization, the Frankl–Rödl nibble method, and the Szemerédi Regularity Lemma. It is joint work with Jialin He, Robert Krueger, The Nguyen, and Michael Wigal. 2. Let $r \ge 3$ be fixed and $G$ be an $n$-vertex graph. A long-standing conjecture of Győri states that if $e(G) = t_{r-1}(n) + k$, where $t_{r-1}(n)$ denotes the number of edges of the Turán graph on $n$ vertices and $r – 1$ parts, then $G$ has at least $(2 – o(1))k/r$ edge-disjoint $r$-cliques. We prove this conjecture. It is joint work with Michael Wigal.

We will define twisted homology and Reidemeister torsion. These are invariants of smooth manifolds together with a representation. We will show that Reidemeister torsion can be used to classify lens spaces up to diffeomorphism and we will see that Reidemeister torsion can be used to give invariants of knots and links.

Directed graphs prove to be very hard to tame in contrast to undirected graphs. In particular, they are not well-quasi-ordered by any known relevant inclusion relation, and are lacking fruitful structure theorems. This motivates the search for structurally rich subclasses of directed graphs that are well behaved. Eulerian directed graphs are a particularly prominent example, sharing many similarities with undirected graphs. In fact, it is conjectured that Eulerian directed graphs are well-quasi-ordered by weak immersion, and even well-quasi-ordered by strong immersion when restricting to classes of bounded degree. We believe that we have a proof of both conjectures, and I will report on the current status, progress, and steps towards said proof and its implications. This is joint work with Ken-ichi Kawarabayashi and Stephan Kreutzer.

Abstract: In this seminar, we study the logistic diffusion equation, a reaction–diffusion model, and its equilibria. We first establish existence and regularity of positive solutions to the parabolic problem. We then use the comparison principle to show that, as time tends to infinity, the solution converges to a steady state solving the corresponding elliptic equation. We recall why the existence of solutions to this elliptic problem is not easily obtained by standard variational methods. Finally, we discuss how stability depends on the resource term and how the solution behavior changes with the diffusion rate. References: [1] Cantrell, R.S., Cosner, C. Spatial ecology via reaction-diffusion equation. Wiley series in mathematical and computational biology, John Wiley & Sons Ltd (2003)

Quantum computing offers new possibilities for scientific computing by enabling operations on exponentially large state spaces. In this lecture, we discuss how nonlinear partial differential equations (PDEs) can be connected to quantum algorithms through mathematical linearization frameworks. After a brief introduction to the fundamentals of quantum computation and quantum numerical linear algebra, we present Koopman and Koopman–von Neumann (KvN) formulations that embed nonlinear dynamics into linear operators. We then outline how these ideas, combined with Carleman linearization and relaxation-based methods, can lead to quantum-ready formulations of nonlinear PDE solvers.

A k-coloring of a graph is an assignment of k colors to its vertices such that no two adjacent adjacent vertices receive the same color. The Coloring Problem is the problem of determining the smallest k such that the graph admits a k-coloring. Given a set L of graphs, a graph G is L-free if G does not contain any graph in L as an induced subgraph. The complexity of the Coloring Problem for L-free graphs is known (NP-complete or polynomial-time solvable) whenever L contains a single graph. There has been keen interest in coloring graphs whose forbidden list L contains basic graphs such as induced paths, induced cycles and their complements. In this talk, I will provide a survey of recent progress on this topic.