Past

The celebrated Lang-Vojta Conjecture predicts degeneracy of S-integral points on varieties of log general type defined over number fields. It admits a geometric analogue over function fields, where stronger results have been obtained applying a method developed by Corvaja and Zannier. In this talk, we present a recent result for non-isotrivial surfaces over function fields dominating a two-dimensional torus. This extends Corvaja and Zannier’s result in the isotrivial case and it is based on a refinement of gcd estimates for polynomials evaluated at S-units. This is a joint work with A. Turchet.

Motion at the microscale is a fascinating field visualizing non-equilibrium behaviour of matter. Evolution has optimized the ability of microscale swimming on different length scales from tedpoles, to sperm and bacteria. A constant metabolic energy input is required to achieve active propulsion which means these systems are obeying the laws imposed by a low Reynolds number. Several strategies - including topography1 , chemotaxis or rheotaxis2 - have been used to reliably determine the path of active particles. Curiously, many of these strategies can be recognized as analogues of approaches employed by nature and are found in biological microswimmers.

[[{"fid":"53543","view_mode":"media_square","fields":{"format":"media_square","field_file_image_alt_text[und][0][value]":false,"field_file_image_title_text[und][0][value]":false},"type":"media","field_deltas":{"1":{"format":"media_square","field_file_image_alt_text[und][0][value]":false,"field_file_image_title_text[und][0][value]":false}},"attributes":{"class":"media-element file-media-square","data-delta":"1"}}]]

Bacteria attached to the metal caps of Janus particles3

However, natural microswimmers are not limited to being exemplary systems on the way to artificial micromotion. They certainly enable us to observe how nature overcame problems such as a lack of inertia, but natural microswimmers also offer the possibility to couple them to artificial microobjects to create biohybrid systems. Our group currently explores different coupling strategies and to create so called ‘BacteriaBots’.4

1 J. Simmchen, J. Katuri, W. E. Uspal, M. N. Popescu, M. Tasinkevych, and S. Sánchez, Nat. Commun., 2016, 7, 10598.

2 J. Katuri, W. E. Uspal, J. Simmchen, A. Miguel-López and S. Sánchez, Sci. Adv., , DOI:10.1126/sciadv.aao1755.

3 M. M. Stanton, J. Simmchen, X. Ma, A. Miguel-Lopez, S. Sánchez, Adv. Mater. Interfaces, DOI:10.1002/admi.201500505.

4 J. Bastos-Arrieta, A. Revilla-Guarinos, W. E. Uspal and J. Simmchen, Front. Robot. AI, 2018, 5, 97.

The usual finite dimensional Grassmannians are well known to be classifying spaces for vector bundles. It is maybe a less known fact that one has certain natural connections on the Stiefel bundles over them, which also have a universality property. I will show how these connections are constructed and explain how this viewpoint can be used to rediscover Chern-Weil theory. Finally, we will see how a certain stabilized version of this, called the restricted Grassmannian, admits a similar construction, which can be used to show that it is a smooth classifying space for differential K-theory.

Standard quadratic programs have numerous applications and play an important role in copositivity detection. We consider reformulating a standard quadratic program as a mixed integer linear programming (MILP) problem. We propose alternative MILP reformulations that exploit the specific structure of standard quadratic programs. We report extensive computational results on various classes of instances. Our experiments reveal that our MILP reformulations significantly outperform other global solution approaches. 
This is joint work with Jacek Gondzio.

We study a family of optimal control problems under a set of controlled-loss constraints holding at different deterministic dates. The characterization of the associated value function by a Hamilton-Jacobi-Bellman equation usually calls for additional strong assumptions on the dynamics of the processes involved and the set of constraints. To treat this problem in absence of those assumptions, we first convert it into a state-constrained stochastic target problem and then apply a level-set approach to describe the reachable set. With this approach, the state constraints can be managed through an exact penalization technique. However, a new set of state and control variables enters the definition of this stochastic target problem. In particular, those controls are unbounded. A “compactification” of the problem is then performed. (joint work with Athena Picarelli)
 

This talk will be an introduction to the use of conformal methods in asymptotic analysis in general relativity. We shall consider the explicit example of flat spacetime (Minkowski spacetime). The full conformal compactification will be constructed. For a simple example of a conformally invariant equation (we'll take the wave equation), we shall see how the compactification allows to infer precise informations on the asymptotic behaviour of the solution in all directions, for a certain class of data at any rate. Then, depending on time and questions, I will either describe how a scattering theory can be constructed using the same method or, explain how conformal methods can be used on other asymptotically flat geometries.

In 1982, Gromov introduced bounded cohomology to give estimates on the minimal volume of manifolds. Since then, bounded cohomology has become an independent and active research field. In this talk I will give an introduction to bounded cohomology, state many open problems and relate it to other fields. 

Pseudorandom functions (PRFs) are one of the fundamental building blocks in cryptography. Traditionally, there have been two main approaches for PRF design: the ``practitioner's approach'' of building concretely-efficient constructions based on known heuristics and prior experience, and the ``theoretician's approach'' of proposing constructions and reducing their security to a previously-studied hardness assumption. While both approaches have their merits, the resulting PRF candidates vary greatly in terms of concrete efficiency and design complexity. In this work, we depart from these traditional approaches by exploring a new space of plausible PRF candidates. Our guiding principle is to maximize simplicity while optimizing complexity measures that are relevant to cryptographic applications. Our primary focus is on weak PRFs computable by very simple circuits (depth-2 ACC^0 circuits). Concretely, our main weak PRF candidate is a ``piecewise-linear'' function that first applies a secret mod-2 linear mapping to the input, and then a public mod-3 linear mapping to the result. We also put forward a similar depth-3 strong PRF candidate.  
The advantage of our approach is twofold. On the theoretical side, the simplicity of our candidates enables us to draw many natural connections between their hardness and questions in complexity theory or learning theory (e.g., learnability of depth-2 ACC^0 circuits and width-3 branching programs, interpolation and property testing for sparse polynomials, and natural proof barriers for showing super-linear circuit lower bounds). On the applied side, the piecewise-linear structure of our candidates lends itself nicely to applications in secure multiparty computation (MPC). Using our PRF candidates, we construct protocols for distributed PRF evaluation that achieve better round complexity and/or communication complexity (often both) compared to protocols obtained by combining standard MPC protocols with PRFs like AES, LowMC, or Rasta (the latter two are specialized MPC-friendly PRFs).
Finally, we introduce a new primitive we call an encoded-input PRF, which can be viewed as an interpolation between weak PRFs and standard (strong) PRFs. As we demonstrate, an encoded-input PRF can often be used as a drop-in replacement for a strong PRF, combining the efficiency benefits of weak PRFs and the security benefits of strong PRFs. We conclude by showing that our main weak PRF candidate can plausibly be boosted to an encoded-input PRF by leveraging standard error-correcting codes.
Joint work with Dan Boneh, Yuval Ishai, Amit Sahai, and David J. Wu.

We will talk about set theory, and, more specifically, forcing. Forcing is powerful. It is the go-to method for proving the independence of the continuum hypothesis or for understanding the (lack of) fine structure of the real numbers. However, forcing is hard. Keen to export their theorems to more mainstream areas of mathematics, set theorists have tackled this issue by inventing forcing axioms, (relatively) simple mathematical statements which describe sophisticated forcing extensions. In my talk, I will present the basics of forcing, I will introduce some interesting forcing axioms and I will show how these might be used to obtain surprising independence results.

When approximating PDEs with the finite element method, large sparse linear systems must be solved. The ideal preconditioner yields convergence that is  algorithmically optimal and parameter robust, i.e. the number of Krylov iterations required to solve the linear system to a given accuracy does not grow substantially as the mesh or problem parameters are changed.

Achieving this for the stationary Navier-Stokes has proven challenging: LU factorisation is Reynolds-robust but scales poorly with degree of freedom count, while Schur complement approximations such as PCD and LSC degrade as the Reynolds number is increased.

Building on the work of Schöberl, Olshanskii and Benzi, in this talk we present the first preconditioner for the Newton linearisation of the stationary Navier--Stokes equations in three dimensions that achieves both optimal complexity and Reynolds-robustness. The scheme combines a novel tailored finite element discretisation, discrete augmented Lagrangian stabilisation, a custom prolongation operator involving local solves on coarse cells, and an additive patchwise relaxation on each
level. We present 3D simulations with over one billion degrees of freedom with robust performance from Reynolds number 10 to 5000.

Employing the usual multilevel Monte Carlo estimator, we introduce a framework for estimating the solutions of SDEs by an Euler-Maruyama scheme. By considering the expected value of such solutions, we produce simulations using approximately normal random variables, and recover the estimate from the exact normal distribution by use of a multilevel correction, leading to faster simulations without loss of accuracy. We will also highlight this concept in the framework of reduced precision and vectorised computations.

Wrinkling is a universal instability occurring in a wide variety of engineering and biological materials. It has been studied extensively for many different systems but a full description is still lacking. Here, we provide a systematic analysis of the wrinkling of a thin hyperelastic film over a substrate in plane strain using stream functions. For comparison, we assume that wrinkling is generated either by the isotropic growth of the film or by the lateral compression of the entire system. We perform an exhaustive linear analysis of the wrinkling problem for all stiffness ratios and under a variety of additional boundary and material effects.

Crime is a major risk to society’s well-being, particularly in cities, and yet the scientific literature lacks a comprehensive statistical characterization of crime that could uncover some of the mechanisms behind such pervasive social phenomenon. Evidence of nonlinear scaling of urban indicators in cities, such as wages and serious crime, has motivated the understanding of cities as complex systems—a perspective that offers insights into resources limits and sustainability, but usually without examining the details of indicators. Notably, since the nineteenth century, criminal activities have been known not to occur uniformly within a city. Crime concentrates in such way that most of the offenses take place in few regions of the city. However, though this concentration is confirmed by different studies, the absence of broad examinations of the characteristics of crime concentration hinders not only the comprehension of crime dynamics but also the proposal of sounding counter-measures. Here, we developed a framework to characterize crime concentration which splits cities into regions with the same population size. We used disaggregated criminal data from 25 locations in the U.S. and the U.K. which include offenses in places spanning from 2 to 15 years of data. Our results confirmed that crime concentrates regardless of city and revealed that the level of concentration does not scale with city size. We found that distribution of crime in a city can be approximated by a power-law distribution with exponent α that depends on the type of crime. In particular, our results showed that thefts tend to concentrate more than robberies, and robberies more than burglaries. Though criminal activities present regularities of concentration, we found that criminal ranks have the tendency to change continuously over time. Such features support the perspective of crime as a complex system which demands analyses and evolving urban policies covering the city as a whole. 

 I will introduce two obstructions for a rational homology 3-sphere to smoothly bound a rational homology 4-ball- one coming from Donaldson's theorem on intersection forms of definite 4-manifolds, and the other coming from correction terms in Heegaard Floer homology. If L is a nonunimodular definite lattice, then using a theorem of Elkies we will show that whether L embeds in the standard definite lattice of the same rank is completely determined by a collection of lattice correction terms, one for each metabolizing subgroup of the discriminant group. As a topological application this gives a rephrasing of the obstruction coming from Donaldson's theorem. Furthermore, from this perspective it is easy to see that if the obstruction to bounding a rational homology ball coming from Heegaard Floer correction terms vanishes, then (under some mild hypotheses) the obstruction from Donaldson's theorem vanishes too.

The Prandtl equation was derived in 1904 by Ludwig Prandtl in order to describe the behavior of fluids with small viscosity around a solid obstacle. Over the past decades, several results of ill-posedness in Sobolev spaces have been proved for this equation. As a consequence, it is natural to look for more sophisticated boundary layer models, that describe the coupling with the outer Euler flow at a higher order. Unfortunately, these models do not always display better mathematical properties, as I will explain in this talk. This is a joint work with Helge Dietert, David Gérard-Varet and Frédéric Marbach.

In this talk I will articulate and contextualize the following sequence of results.

The Bruhat decomposition of the general linear group defines a stratification of the orthogonal group.
Matrix multiplication defines an algebra structure on its exit-path category in a certain Morita category of categories.  
In this Morita category, this algebra acts on the category of n-categories -- this action is given by adjoining adjoints to n-categories. 

This result is extracted from a larger program -- entirely joint with John Francis, some parts joint with Nick Rozenblyum -- which proves the cobordism hypothesis.  

In semimartingale optimal transport problem, the functional to be minimized can be considered as a “stochastic action”, which is the expectationof a “stochastic Lagrangian” in terms of differential semimartingale characteristics. Therefore it would be natural to apply variational calculus approach to characterize the minimizers. R. Lassalle and A.B. Cruzeiro have used this approach to establish a stochastic Euler-Lagrangian condition for semimartingale optimal transport by perturbing the drift terms. Motivated by their work, we want to perform the same type of calculus for martingale optimal transport problem. In particular, instead of only considering perturbations in the drift terms, we try to find a nice variational family for volatility,and then obtain the stochastic Euler-Lagrangian condition for martingale laws. In the first part of this talk we will mention some basic results regarding the existence of minimizers in semimartingale optimal transport problem. In the second part, we will introduce Lassalle and Cruzeiro’s  work, and give a simple example related to this topic, where the variational family is induced by time-changes; and then we will introduce some potential problems that are needed to be solved.

We prove the quenched version of the central limit theorem for the displacement of a random walk in doubly stochastic random environment, under the $H_{-1}$-condition, with slightly stronger,  $L^{2+\epsilon}$ (rather than $L^2$) integrability condition on the stream tensor. On the way we extend Nash's moment bound to the non-reversible, divergence-free drift case.  

Amplituhedra are mathematical objects generalising the notion of polytopes into the Grassmannian. Proposed as a geometric construction encoding scattering amplitudes in the four-dimensional maximally supersymmetric Yang-Mills theory, they are mathematically interesting objects on their own. In my talk I strengthen the relation between scattering amplitudes and geometry by linking the amplituhedron to the Jeffrey-Kirwan residue, a powerful concept in symplectic and algebraic geometry. I focus on a particular class of amplituhedra in any dimension, namely cyclic polytopes, and their even-dimensional
conjugates. I show how the Jeffrey-Kirwan residue prescription allows to extract the correct amplituhedron canonical differential form in all these cases. Notably, this also naturally exposes the rich combinatorial structures of amplituhedra, such as their regular triangulations

This will be the final mathematrix meeting for the term and we will be discussing Implicit Bias. In short, Implicit Bias is to do with perceptions and judgements we unconsciously make about people based on preconceptions we have about certain appearances, background or other characteristics. Even if we are not aware of making these judgements, they can affect our actions and decisions none-the-less. For a slightly longer introduction about this topic and how it can relate to academia, we suggest reading the following article: http://science.sciencemag.org/content/352/6289/1067.full

In this session we hope to explain more about what implicit bias is, how it might affect us, and discuss ways to avoid implicit bias and make ourselves and others more aware of it.

Everyone is welcome! Monday, 1300-1400, Quillen Room (N3.12), with lunch provided.