A temporal graph is a graph whose edges are available only at specific times. In this scenario, the only valid walks are the ones traversing adjacent edges respecting their availability, i.e. sequence of adjacent edges whose appearing times are non-decreasing. Given a graph G and vertices s and t of G, Menger’s Theorem states that the maximum number of (internally) vertex disjoint s,t-paths is equal to the minimum size of a subset X for which G-X contains no s,t-path. This is a classical result in Graph Theory, taught in most basic Graph Theory courses, and it holds also when G is directed and when edge disjoint paths and edge cuts are considered instead. A direct translation of Menger’s Theorem to the temporal context has been known not to hold since an example was shown in the seminal paper by Kempe, Kleinberg and Kumar (STOC’00). In this talk, an overview of possible temporal versions of Menger’s Theorem will be discussed, as well as the complexity of the related problems.

We prove that for $n>k\geq 3$, if $G$ is an $n$-vertex graph with chromatic number $k$ but any its proper subgraph has smaller chromatic number, then $G$ contains at most $n-k+3$ copies of cliques of size $k-1$. This answers a problem of Abbott and Zhou and provides a tight bound on a conjecture of Gallai. This is joint work with Jie Ma.

The Structural Theorem of the Graph Minors series of Robertson and Seymour asserts that, for every $t\in\mathbb{N},$ there exists some constant $c_{t}$ such that every $K_{t}$-minor-free graph admits a tree decomposition whose torsos can be transformed, by the removal of at most $c_{t}$ vertices, to graphs that can be seen as the union of some graph that is embeddable to some surface of Euler genus at most $c_{t}$ and "at most $c_{t}$ vortices of depth $c_{t}$". Our main combinatorial result is a "vortex-free" refinement of the above structural theorem as follows: we identify a (parameterized) graph $H_{t}$, called shallow vortex grid, and we prove that if in the above structural theorem we replace $K_{t}$ by $H_{t},$ then the resulting decomposition becomes "vortex-free". Up to now, the most general classes of graphs admitting such a result were either bounded Euler genus graphs or the so called single-crossing minor-free graphs. Our result is tight in the sense that, whenever we minor-exclude a graph that is not a minor of some $H_{t},$ the appearance of vortices is unavoidable. Using the above decomposition theorem, we design an algorithm that, given an $H_{t}$-minor-free graph $G$, computes the generating function of all perfect matchings of $G$ in polynomial time. This algorithm yields, on $H_{t}$-minor-free graphs, polynomial algorithms for computational problems such as the {dimer problem, the exact matching problem}, and the computation of the permanent. Our results, combined with known complexity results, imply a complete characterization of minor-closed graphs classes where the number of perfect matchings is polynomially computable: They are exactly those graph classes that do not contain every $H_{t}$ as a minor. This provides a sharp complexity dichotomy for the problem of counting perfect matchings in minor-closed classes. This is joint work with Dimitrios M. Thilikos.

Over recent years, data science and machine learning have been the center of attention in both the scientific community and the general public. Closely tied to the ‘AI-hype’, these fields are enjoying expanding scientific influence as well as a booming job market. In this talk, I will first discuss why mathematical knowledge is important for becoming a good machine learner and/or data scientist, by covering various topics in modern deep learning research. I will then introduce my recent efforts in utilizing various deep learning methods for statistical analysis of mathematical simulations and observational data, including surrogate modeling, parameter estimation, and long-term trend reconstruction. Various scientific application examples will be discussed, including ocean diffusivity estimation, WRF-hydro calibration, AMOC reconstruction, and SIR calibration.

TBA

In this talk, I will mostly discuss the singularity formation of Burgers equation. It is well-known that, when the initial data has negative gradient at some point, the solutions blow up in a finite time. We shall study the properties of the blow-up profile of Burgers equation by introducing the self-similar variables and the modulations, which can be used to study the blow-up for general nonlinear hyperbolic systems. If time permits, I will also discuss the singularity formation for the 1D compressible Euler equations and the related open questions.

In this talk, I will mostly discuss the singularity formation of Burgers equation. It is well-known that, when the initial data has negative gradient at some point, the solutions blow up in a finite time. We shall study the properties of the blow-up profile of Burgers equation by introducing the self-similar variables and the modulations, which can be used to study the blow-up for general nonlinear hyperbolic systems. If time permits, I will also discuss the singularity formation for the 1D compressible Euler equations and the related open questions.

In this talk, we present a Weisfielier-Leman Isomorphism test algorithm of featured graphs and how it can be used to extract representing features of nodes or entire graphs. This leads to a message passing framework of Aggregate-Combine of node-features which is one of the fundamental procedures to currently uesd graph neural networks. We proceed by showing various basic examples arised in real-world non-standard datasets like social network, knowledge graph and chemical compounds.

In this talk, I will mostly discuss the singularity formation of Burgers equation. It is well-known that, when the initial data has negative gradient at some point, the solutions blow up in a finite time. We shall study the properties of the blow-up profile of Burgers equation by introducing the self-similar variables and the modulations, which can be used to study the blow-up for general nonlinear hyperbolic systems. If time permits, I will also discuss the singularity formation for the 1D compressible Euler equations and the related open questions.

Various plasma phenomena will be discussed using a fundamentalfluid model for plasmas, called the Euler-Poisson system. These include plasma sheaths and plasma soliton. First we will briefly introduce recent results on the stability of plasma sheath solutions, and the quasi-neutral limit of the Euler-Poisson system in the presence of plasma sheaths. Another example of ourinterest is plasma solitary waves, for which we discuss existence, stability, and the time-asymptotic behavior. To study the nonlinear stability of solitary waves, the global existence of smooth solutions must be established, which is completelyopen. As a negative answer for global existence, we look into the finite-time blow-up results for the Euler-Poisson system, and discuss the related open questions.

Abstract: Let S:=S(a_{1}, ..., a_{n}) \subset P^{n} be a smooth rational normal n-fold scroll. Then the dimension of the projective automophism group {rm Aut}(S,``VecP^ {N} ) of S is \dim(Aut(S, P^{N})) = 2+ \frac{n(n+1)}{2}-(n+1)(N-n+1)+2 sum _{ n} ^{ j=1} ja_j + #{(i,j)|i Host: 곽시종     Contact: 김윤옥 (5745)     To be announced     2022-08-13 17:47:33 Update