Date/Time : 10 Jan 2020 15:00
Venue : S17 #04-05 SR2
Speaker : Seung-Hyeok Kye, Seoul National University, South Korea

Date/Time:10 Jan 2020 15:00 Venue: S17 #04-05 SR2 Speaker: Seung-Hyeok Kye, Seoul National University, South Korea A lattice arising from quantum information theory The notion of separability/entanglement is one of the central themes in the current quantum information theory, and it is known to be NP hard in general to determine if a given state is separable or entangled. In multipartite systems, the notions of separability depend on partitions of systems to yield the notions of partial separability and partial entanglement. In the simplest multipartite case of the three qubit system, there are three kinds of basic partial separability which give rise to corresponding convex sets. Intersections and convex hulls of them also have been considered by researchers to get more kinds of separability and entanglement. In this talk, we consider the lattice generated by these three convex sets, with respect to two operations: convex hull and intersection. We will discuss mathematical properties of this lattice. This talk is based on three papers: arXiv 1812.01227 (with Kyung Hoon Han), arXiv 1905.07678 (with Kyung Hoon Han) and arXiv 1911.06496 (with Kyung Hoon Han and Szilard Szalay). Add to calendar: 

Add to calendar :

Date/Time : 03 Jan 2020 15:00
Venue : S17 #04-05 SR2
Speaker : Paul Van Dooren, Catholic University of Louvain, Belgium

Date/Time:03 Jan 2020 15:00 Venue: S17 #04-05 SR2 Speaker: Paul Van Dooren, Catholic University of Louvain, Belgium Detecting roles in very large graphs Computing meaningful clusters of nodes is crucial to analyze very large networks, but since this is a combinatorial optimization problem, its complexity can be prohibitive. In this talk, we present a pairwise node similarity measure that allows to extract roles, i.e. group of nodes sharing similar flow patterns within a network. We then propose a low rank iterative scheme to approximate the similarity measure for very large networks and we show that our low rank similarity score successfully extracts the different roles in random graphs of Erdös-Renyi type. We then argue that when projecting our similarity measure onto a low rank manifold (say, of rank r), the role models can be recovered using classical clustering techniques in an r-dimensional space, which reduces the complexity significantly. We illustrate these ideas with a number of real world applications including coral spawning in the great barrier reef. Add to calendar: 

Add to calendar :

Date/Time : 03 Jan 2020 16:00
Venue : S17 #04-06 SR1
Speaker : HAN Jiequn, Princeton University

Date/Time:03 Jan 2020 16:00 Venue: S17 #04-06 SR1 Speaker: HAN Jiequn, Princeton University Deep BSDE: A Unified Framework for Solving High-Dimensional PDEs, FBSDEs, and Control Problems Developing algorithms for solving high-dimensional partial differential equations (PDEs), forward-backward stochastic differential equations (FBSDEs), and control problems has been an exceedingly difficult task for a long time, due to the notorious difficulty known as the curse of dimensionality. In this talk we introduce the “deep BSDE method” as a unified framework to solve general high-dimensional PDEs and FBSDEs. Starting from the BSDE formulation, we approximate the unknown component by neural networks and design a proper loss function to optimize parameters. Numerical results of a variety of examples, including applications in game theory and eigenvalue problem, demonstrate that the proposed algorithm is quite effective in high- dimensions, in terms of both accuracy and speed. We furthermore provide a theoretical error analysis to illustrate the validity and property of the objective function. Add to calendar: 

Add to calendar :

Date/Time : 27 Dec 2019 14:00
Venue : S17 #04-06 SR1
Speaker : Xiaoming Wang, Southern University of Science and Technology

We show that the Principle of Exchange of Stability holds for convection in a layer of fluids overlaying a porous media with proper interface boundary conditions and suitable assumption on the parameters. The physically relevant small Darcy number regime as well as the dependence of the convection on various parameters will be discussed. A theory on the dependence of the depth ratio of the onset of deep convection will be put forth together with supporting numerical evidence. A decoupled uniquely solvable, unconditionally stable numerical scheme for solving the system will be presented as well.

Add to calendar :

Date/Time : 26 Dec 2019 16:00
Venue : S17 #05-11 SR5
Speaker : Hu Jingwei, Purdue University

Date/Time:26 Dec 2019 16:00 Venue: S17 #05-11 SR5 Speaker: Hu Jingwei, Purdue University A second-order asymptotic-preserving and positivity-preserving exponential Runge-Kutta method for a class of stiff kinetic equations We introduce a second-order time discretization method for stiff kinetic equations. The method is asymptotic-preserving (AP) — can capture the Euler limit without numerically resolving the small Knudsen number; and positivity-preserving — can preserve the non- negativity of the solution which is a probability density function for arbitrary Knudsen numbers. The method is based on a new formulation of the exponential Runge-Kutta method and can be applied to a large class of stiff kinetic equations including the BGK/ES-BGK equation (relaxation type), the Fokker-Planck equation (diffusion type), and even the full Boltzmann equation (nonlinear integral type). Furthermore, we show that when coupled with suitable spatial discretizations the fully discrete scheme satisfies an entropy-decay property. Various numerical results are provided to demonstrate the theoretical properties of the method. This is joint work with Ruiwen Shu (University of Maryland). Add to calendar: 

Add to calendar :

Date/Time : 21 Dec 2019 15:00
Venue : S17 #04-06 SR1
Speaker : Oleg Evnin , Chulalongkorn University

Date/Time:21 Dec 2018 15:00 Venue: S17 #04-06 SR1 Speaker: Oleg Evnin, Chulalongkorn University Large structured matrices and quantum chaos in resonant systems Resonant systems emerge as weakly nonlinear approximations to problems of mathematical physics with highly resonant linearized perturbations, including Bose-Einstein condensates in harmonic traps and dynamics in AdS spacetimes. The classical dynamics within this class of systems can be very rich, ranging from fully integrable to chaotic as one changes the values of the mode coupling coefficients. Despite the complexity of the corresponding classical dynamics, the quantum version turns out to be remarkably simple: the Hamiltonian is block-diagonal in the Fock basis, with all blocks of varying finite sizes. One thus deals with the systematics of eigenvalues of highly structured finite matrices, including limits when these matrices become very large. I’ll report on a recent study of both numerical patterns emerging for the integrable cases, and the spectral statistics, which efficiently distinguishes the special integrable cases from generic (chaotic) points in the parameter space, and discuss a range of potential applications.

Add to calendar :

Date/Time : 10 Dec 2019 14:00
Venue : S17 #04-04 SR3
Speaker : Cheng-Chiang Tsai, Stanford University

Date/Time:10 Dec 2019 14:00 Venue: S17 #04-04 SR3 Speaker: Cheng-Chiang Tsai, Stanford University Local Langlands and character sheaves Let G be a connected reductive group and G^{\vee} be its dual group. For example, G=SO_{2n+1} and G^{\vee}=Sp_{2n} the symplectic group on a 2n-dimensional space. The Langlands correspondence can be interpreted as attaching monodromies to representations. Over a local or global field, to certain representation one can attach a Galois representation (or some variant of it), in other words monodromic datum over the field. While local/global Langlands is largely mysterious, over a finite field there is the Deligne-Lusztig theory and theory of character sheaves; to each irreducible representation of G(F_q) or character sheaf on G one can attache a monodromy as a semisimple element in G^{\vee}. This finite field picture is completely established by Lusztig. In this talk, we survey three seemingly unrelated connections between the local picture (in depth-zero case) and the finite field picture, raising new questions and proposing new conjectures. There will be no theorem in this talk. Add to calendar: 

Add to calendar :

Date/Time : 09 Dec 2019 15:30
Venue : S17 #05-12 SR4
Speaker : Zhao Lifeng, University of Science and Technology of China

Date/Time:09 Dec 2019 15:30 Venue: S17 #05-12 SR4 Speaker: Zhao Lifeng, University of Science and Technology of China Asymptotic behaviours for energy-subcritical damped Klein-Gordon equations In this talk, we will investigate the long-time behaviour of damped Klein-Gordon equation in the energy subcritical case. In fact, we will establish the soliton resolution for this equation which means that the global bounded solution evolves into the super-position of moving solitons. Moreover, we will give some further information about the resolution. The talk is based on joint works with Ze Li, Raphael Cote, Yvan Martel and Xu Yuan. Add to calendar: 

Add to calendar :

Date/Time : 02 Dec 2019 17:00
Venue : S17 #06-11
Speaker : Rupert Hoelzl, University of the Bundeswehr, Munich

Date/Time:02 Dec 2019 17:00 Venue: S17 #06-11 Speaker: Rupert Hoelzl, University of the Bundeswehr, Munich Randomness for computable measures and complexity We study the possible growth rates of the Kolmogorov complexity of initial segments of sequences that are random with respect to some computable measure on the Cantor Space, the so-called proper sequences. Our main results are as follows: (1) We show that the initial segment complexity of a proper sequence X is bounded from below by a computable function (that is, X is complex) if and only if X is random with respect to some computable, continuous measure. (2) We prove that a uniform version of the previous result fails to hold: there is a family of complex sequences that are random with respect to a single computable measure such that for every computable, continuous measure mu, some sequence in this family fails to be random with respect to mu. (3) We show that there are proper sequences with extremely slow-growing initial segment complexity, that is, there is a proper sequence the initial segment complexity of which is infinitely often below every computable function, and even a proper sequence the initial segment complexity of which is dominated by all computable functions. (4) We prove various facts about the Turing degrees of such sequences and show that they are useful in the study of certain classes of pathological measures on the Cantor Space, namely diminutive measures and trivial measures. Add to calendar: 

Add to calendar :