Georgia Institute of Technology College of Sciences

Given an immersed, Maslov-0, exact Lagrangian filling of a Legendrian knot, if the filling has a vanishing index and action double point, then through Lagrangian surgery it is possible to obtain a new immersed, Maslov-0, exact Lagrangian filling with one less double point and with genus increased by one. We show that it is not always possible to reverse the Lagrangian surgery: not every immersed, Maslov-0, exact Lagrangian filling with genus g ≥ 1 and p double points can be obtained from such a Lagrangian surgery on a filling of genus g − 1 with p+1 double points. To show this, we establish the connection between the existence of an immersed, Maslov-0, exact Lagrangian filling of a Legendrian Λ that has p double points with action 0 and the existence of an embedded, Maslov-0, exact Lagrangian cobordism from p copies of a Hopf link to Λ. We then prove that a count of augmentations provides an obstruction to the existence of embedded, Maslov-0, exact Lagrangian cobordisms between Legendrian links. Joint work with Noemie Legout, Maylis Limouzineau, Emmy Murphy, Yu Pan and Lisa Traynor.

Abstract: In the field of structural dynamics, engineers heavily rely on high-fidelity models of the structure at hand to predict its dynamic response and identify potential threats to its integrity.

The structure under investigation, be it an aircraft wing or a MEMS device, is typically discretised with finite elements, giving rise to a very large system of nonlinear ODEs. Due to the high dimensionality, the solution of such systems is very expensive in terms of computational time. For this reason, a large amount of literature in this field is devoted to the development of reduced order models of much lower dimensionality, able to accurately reproduce the original system’s dynamics. Not only the lower dimensionality increases the computational speed, but also provides engineers with interpretable and manageable models of complex systems, which can be easily coupled with data and uncertainty quantification, and whose parameter space can be easily explored. Slow invariant manifolds prove to be the perfect candidate for dimensionality reduction, however their computation for large scale systems has only been proposed in recent years (see Gonzalez et al. (2019), Haller et al. (2020), AV et al. (2019)).

In this talk, the Direct Parametrisation of Invariant Manifolds method (DPIM) will be presented. The theoretical basis of the method is provided by the results of Cabré, Fontich and de la Llave and its algorithmic implementation relies on the parametrisation method for invariant manifolds proposed by Haro et al.. The idea is to parametrise the invariant manifold around a fixed point through a power series expansion which can be solved recursively for each monomial in the reduced coordinates. The main limitation of the original algorithm is the necessity to operate in diagonal representation, which is unfeasible for large finite element systems as it would require the computation of the whole eigenspectrum. The main novelty of the proposed method lies in the expression of the normal homological equation directly in physical coordinates, which is the key aspect that permits its application to large scale systems.

The talk will focus on problems in structural dynamics in both autonomous and nonautonomous settings. The accuracy of the reduction will be shown on several examples, covering phenomena like internal resonances and parametric resonances. Finally, the current limitations and future developments of the method will be discussed.

Determinant maximization problem gives a general framework that models problems arising in as diverse fields as statistics, convex geometry, fair allocations, combinatorics, spectral graph theory, network design, and random processes. In an instance of a determinant maximization problem, we are given a collection of vectors $U = {v_1, \ldots, v_n}$ in $d$ dimensions, and a goal is to pick a subset $S$ of given vectors to maximize the determinant of the matrix $\sum_{i \in S} v_i v_i^T$. Often, the set $S$ of picked vectors must satisfy additional combinatorial constraints such as cardinality constraint ($|S| \leq k$) or matroid constraint ($S$ is a basis of a matroid defined on the vectors). In this talk, we give a polynomial-time deterministic algorithm that returns an $r^{O(r)}$-approximation for any matroid of rank $r \leq d$. Our algorithm builds on combinatorial algorithms for matroid intersection, which iteratively improves any solution by finding an alternating negative cycle in the exchange graph defined by the matroids. While the determinant function is not linear, we show that taking appropriate linear approximations at each iteration suffice to give the improved approximation algorithm.

This talk is based on joint work with Adam Brown, Madhusudhan Pittu, Mohit Singh, and Prasad Tetali.