Georgia Institute of Technology College of Sciences

I will consider the isotropic XY quantum chain with a transverse magnetic field acting on a single site and analyze the long time behaviour of the time-dependent state of the system when a periodic perturbation drives the impurity. It has been shown in the early 70’s that, in the thermodynamic limit, the state of such system obeys a linear time-dependent Schrodinger equation with a memory term. I will consider two different regimes, namely when the perturbation has non-zero or zero average, and I will show that if the magnitute of the potential is small enough then for large enough frequencies the state approaches a periodic orbit synchronized with the potential. Moreover I will provide the explicit rate of convergence to the asymptotics. This is a joint work with G. Genovese.

We will introduce Arnold diffusion in Mather's setting. There are many advances toward proof of this. In particular, we will study an approach based on recent work of Marian-Gidea and Jean-Pierre Marco.

In this talk, we study solvers for geometrically embedded graph structured block linear systems. The general form of such systems, PSD-Graph-Structured Block Matrices (PGSBM), arise in scientific computing, linear elasticity, the inner loop of interior point algorithms for linear programming, and can be viewed as extensions of graph Laplacians into multiple labels at each graph vertex. Linear elasticity problems, more commonly referred to as trusses, describe forces on a geometrically embedded object.We present an asymptotically faster algorithm for solving linear systems in well-shaped 3-D trusses. Our algorithm utilizes the geometric structures to combine nested dissection and support theory, which are both well studied techniques for solving linear systems. We decompose a well-shaped 3-D truss into balanced regions with small boundaries, run Gaussian elimination to eliminate the interior vertices, and then solve the remaining linear system by preconditioning with the boundaries.On the other hand, we prove that the geometric structures are ``necessary`` for designing fast solvers. Specifically, solving linear systems in general trusses is as hard as solving general linear systems over the real. Furthermore, we give some other PGSBM linear systems for which fast solvers imply fast solvers for general linear systems.Based on the joint works with Robert Schwieterman and Rasmus Kyng.

Let G be a graph containing 5 different vertices a0, a1, a2, b1 and b2. We say that (G, a0, a1, a2, b1, b2) is feasible if G contains disjoint connected subgraphs G1, G2, such that {a0, a1, a2}⊆V(G1) and {b1, b2}⊆V(G2). In this talk, we will continue our discussion on the operations we use for characterizing feasible (G, a0, a1, a2, b1, b2). If time permits, we will also discuss useful structures for obtaining that characterization, such as frame, ideal frame, and framework. Joint work with Changong Li, Robin Thomas, and Xingxing Yu.