Past

There are many interesting problems surrounding the unit group U(RG) of the ring RG, where R is a commutative ring and G is a finite group. Of particular interest are the finite subgroups of U(RG). In the seventies, Zassenhaus conjectured that any u in U(ZG) is conjugate, in the group U(QG), to an element of the form +/-g, where g is an element of the group G. This came to be known as the "(first) Zassenhaus conjecture". I will talk about the recent construction of a counterexample to this conjecture (this is joint work with L. Margolis), and recent work on related questions in the modular representation theory of finite groups.

A granular material forms a distinct and fascinating phase in physics -- sand acts as a fluid as grains flow through your fingers, the fallen grains form a solid heap on the floor or may suspend in the wind like a gas.

The main challenge of studying granular materials is the development of constitutive models valid across scales, from the micro-scale (collisions between individual particles), via the meso-scale (flow structures inside avalanches) to the macro-scale (dunes, heaps, chute flows).

In this talk, I am highlighting three recent projects from my laboratory, each highlighting physical behavior at a different scale. First, using the property of birefringence, we are quantifying both kinetic and dynamic properties in an avalanche of macroscopic particles and measure rheological properties. Secondly, we explore avalanches on an erodible bed that display an intriguing dynamic intermittency between regimes. Lastly, we take a closer look at aqueous (water-driven) dunes in a novel rotating experiment and resolve an outstanding scaling controversy between migration velocity and dune dimension.

Ultrasound (US) imaging is one of the first steps in a continuum of pregnancy care. During the fetal period, the brain undergoes dramatic structural changes, many of which are informative of healthy maturation. The resolution of modern US machines enables us to observe and measure brain structures, as well as detect cerebral abnormalities in fetuses from as early as 18 weeks. Recent breakthroughs in machine learning techniques for image analysis introduce opportunities to  develop bespoke methods to track spatial and temporal patterns of fetal brain development. My work focuses on the design of appropriate data-driven techniques to extract developmental information from standard clinical US images of the brain.

We would like to introduce a few different setups of martingale optimal transport problem in dimension greater than one. Optimal correlations of martingales become an interesting issue, and each problem has its own unique feature in this regard

Abstract: In 2016 Ayyer, Prasad and Spallone proved that the restriction to 
S_{n-1} of any odd degree irreducible character of S_n has a unique irreducible 
constituent of odd degree.
This result was later generalized by Isaacs, Navarro Olsson and Tiep.
In this talk I will survey some recent developments on this topic.

Manin’s conjecture predicts the asymptotic behavior of the number of rational points of bounded height on Fano varieties over number fields. We prove this conjecture for a family of nonsplit singular quartic del Pezzo surfaces over arbitrary number fields. For the proof, we parameterize the rational points on such a del Pezzo surface by integral points on a nonuniversal torsor (which is determined explicitly using a Cox ring of a certain type), and we count them using a result of Barroero-Widmer on lattice points in o-minimal structures. This is joint work in progress with Marta Pieropan.

This talk will be a general introduction to perverse sheaves and their applications to the study of algebraic varieties, with a view towards enumerative geometry. It is aimed at non-experts.

We will start by considering constructible sheaves and local systems, and how they relate to the notion of stratification: this offers some insight in the relationship with intersection cohomology, which perverse sheaves generalise in a precise sense.

We will then introduce some technical notions, like t-structures, perversities, and intermediate extensions, in order to define perverse sheaves and explore their properties.

Time permitting, we will consider the relevant example of nearby and vanishing cycle functors associated with a critical locus, their relationship with the (hyper)-cohomology of the Milnor fibre and how this is exploited to define refined enumerative invariants in Donaldson-Thomas theory.

We present several instances of applications of machine
learning technologies in mathematical Finance including pricing,
hedging, calibration and filtering problems. We try to show that
regularity theory of the involved equations plays a crucial role
in designing such algorithms.

(based on joint works with Hans Buehler, Christa Cuchiero, Lukas
Gonon, Wahid Khosrawi-Sardroudi, Ben Wood)

Locomotion strategies employed by unicellular organism are a rich source of inspiration for studying mechanisms for shape control. They are particularly interesting because they are invisible to the naked eye, and offer surprising new solutions to the question of how shape can be controlled.

In recent years, we have studied locomotion and shape control in Euglena gracilis. This unicellular protist is particularly intriguing because it can adopt different motility strategies: swimming by flagellar propulsion, or crawling thanks to large amplitude shape changes of the whole body (a behavior known as metaboly). We will survey our most recent findings within this stream of research.

Random matrices now play a role in many areas of theoretical, applied, and computational mathematics. Therefore, it is desirable to have tools for studying random matrices that are flexible, easy to use, and powerful. Over the last fifteen years, researchers have developed a remarkable family of results, called matrix concentration inequalities, that balance these criteria. This talk offers an invitation to the field of matrix concentration inequalities and their applications.

We will study the l1-homology of the 2-class in one relator groups. We will see that there are many qualitative and quantitive similarities between the l1-norm of the top dimensional class and the stable commutator length of the defining relation. As an application we construct manifolds with small simplicial volume.

This work in progress is joint with Clara Loeh.

Every topological space is metrisable once the symmetry axiom is abandoned and the codomain of the metric is allowed to take values in a suitable structure tailored to fit the topology (and every completely regular space is similarly metrisable while retaining symmetry). This result was popularised in 1988 by Kopperman, who used value semigroups as the codomain for the metric, and restated in 1997 by Flagg, using value quantales. In categorical terms, each of these constructions extends to an equivalence of categories between the category Top and a category of all L-valued metric spaces (where L ranges over either value semigroups or value quantales) and the classical \epsilon-\delta notion of continuous mappings. Thus, there are (at least) two metric formalisms for topology, raising the questions: 1) is any of the two actually useful for doing topology? and 2) are the two formalisms equally powerful for the purposes of topology? After reviewing Flagg's machinery I will attempt to answer the former affirmatively and the latter negatively. In more detail, the two approaches are equipotent when it comes to point-to-point topological consideration, but only Flagg's formalism captures 'higher order' topological aspects correctly, however at a price; there is no notion of product of value quantales. En route to establishing Flagg's formalism as convenient, it will be shown that both fine and coarse variants of homology and homotopy arise as left and right Kan extensions of genuinely metrically constructed functors, and a topologically relevant notion of tensor product of value quantales, a surrogate for the non-existent products, will be described. 


 

The Czech lands were the most industrial part of the Austrian-Hungarian monarchy, broken up at the end of the WW1. As such, Czechoslovakia inherited developed industry supported by developed system of tertiary education, and Czech and German universities and technical universities, where the first chairs for applied mathematics were set up. The close cooperation with the Skoda company led to the establishment of joint research institutes in applied mathematics and spectroscopy in 1929 (1934 resp.).

The development of industry was followed by a gradual introduction of social insurance, which should have helped to settle social contracts, fight with pauperism and prevent strikes. Social insurance institutions set up mathematical departments responsible for mathematical and statistical modelling of the financial system in order to ensure its sustainability. During the 1920s and 1930s Czechoslovakia brought its system of social insurance up to date. This is connected with Emil Schoenbaum, internationally renowned expert on insurance (actuarial) mathematics, Professor of the Charles University and one of the directors of the General Institute of Pensions in Prague.

After the Nazi occupation in 1939, Czech industry was transformed to serve armament of the Wehrmacht and the social system helped the Nazis to introduce the carrot and stick policy to keep weapons production running up to early 1945. There was also strong personal discontinuity, as the Jews and political opponents either fled to exile or were brutally persecuted.

Both in the real and in the p-adic case, I will talk about recent results about C^r-parameterizations and their diophantine applications.  In both cases, the dependence on r of the number of parameterizing C^r maps plays a role. In the non-archimedean case, we get as an application new bounds for rational points of bounded height lying on algebraic varieties defined over finite fields, sharpening the bounds by Sedunova, and making them uniform in the finite field. In the real case, some results from joint work with Pila and Wilkie, and also beyond this work, will be presented, 
in relation to several questions raised by Yomdin. The non-archimedean case is joint work with Forey and Loeser. The real case is joint work with Pila and Wilkie, continued by my PhD student S. Van Hille.  Some work with Binyamini and Novikov in the non-archimedean context will also be mentioned. The relations with questions by Yomdin is joint work with Friedland and Yomdin. 

We present the linearized metrizability problem in the context of parabolic geometries and subriemannian geometry, generalizing the metrizability problem in projective geometry studied by R. Liouville in 1889. We give a general method for linearizability and a classification of all cases with irreducible defining distribution where this method applies. These tools lead to natural subriemannian metrics on generic distributions of interest in geometric control theory.

(Joint work with Coralia Cartis) The problem of finding the most extreme value of a function, also known as global optimization, is a challenging task. The difficulty is associated with the exponential increase in the computational time for a linear increase in the dimension. This is known as the ``curse of dimensionality''. In this talk, we demonstrate that such challenges can be overcome for functions with low effective dimensionality --- functions which are constant along certain linear subspaces. Such functions can often be found in applications, for example, in hyper-parameter optimization for neural networks, heuristic algorithms for combinatorial optimization problems and complex engineering simulations.
We propose the use of random subspace embeddings within a(ny) global minimisation algorithm, extending the approach in Wang et al. (2013). We introduce a new framework, called REGO (Random Embeddings for GO), which transforms the high-dimensional optimization problem into a low-dimensional one. In REGO, a new low-dimensional problem is formulated with bound constraints in the reduced space and solved with any GO solver. Using random matrix theory, we provide probabilistic bounds for the success of REGO, which indicate that this is dependent upon the dimension of the embedded subspace and the intrinsic dimension of the function, but independent of the ambient dimension. Numerical results demonstrate that high success rates can be achieved with only one embedding and that rates are for the most part invariant with respect to the ambient dimension of the problem.
 

The last remaining open problem from Erdős and Rényi's original paper on random graphs is the following: for q at least 3, what is the largest d so that the random graph G(n,d/n) is q-colorable with high probability?  A lot of interesting work in probabilistic combinatorics has gone into proving better and better bounds on this q-coloring threshold, but the full answer remains elusive.  However, a non-rigorous method from the statistical physics of glasses - the cavity method - gives a precise prediction for the threshold.  I will give an introduction to the cavity method, with random graph coloring as the running example, and describe recent progress in making parts of the method rigorous, emphasizing the role played by tools from extremal combinatorics.  Based on joint work with Amin Coja-Oghlan, Florent Krzakala, and Lenka Zdeborová.

Decomposition (aka unital 2-Segal) spaces are simplicial ∞-groupoids with a certain exactness property: they take pushouts of active (end-point preserving) along inert (distance preserving) maps in the simplicial category Δ to pullbacks. They encode the information needed for an 'objective' generalisation of the notion of incidence (co)algebra of a poset, and motivating examples include the decomposition spaces for (derived) Hall algebras, the Connes-Kreimer algebra of trees and Schmitt's algebra of graphs. In this talk I will survey recent activity in this area, including some work in progress on a categorification of (Hopf) bialgebroids.
This is joint work with Imma Gálvez and Joachim Kock.
 

Structure from Motion (SfM) is a problem which asks: given photos of an object from different angles, can we reconstruct the object in 3D? This problem is important in computer vision, with applications including urban planning and autonomous navigation. A key part of SfM is bundle adjustment, where initial estimates of 3D points and camera locations are refined to match the images. This results in a high-dimensional nonlinear least-squares problem. In this talk, I will discuss how dimensionality reduction methods such as block coordinates and sketching can be used to improve solver scalability for bundle adjustment problems.

For a nonlinear elliptic system coming from a nonlinear Schroedinger system, the interaction between components is represented by a symmetric matrix. The construction of possibly lower energy nontrivial solutions and the complete description of dependence of the solutions on the matrix are quite challenging tasks. Especially, we are interested in the case that intra-species interaction forces are fixed and inter-species forces are very large, that is, the diagonal part of the symmetric matric is fixed and the non-diagonal entries are very large. In this case, depending on the network between components by repulsive or attractive forces, several different types of patterns may appear. I would like to explain our recent studies on the problem with three components and touch a possible exploration on the general n-components problem.

Topological field theories give rise to a wealth of algebraic structures, extending
the E_n algebra expressing the "topological OPE of local operators". We may interpret these algebraic structures as defining (slightly noncommutative) algebraic varieties and stacks, called moduli stacks of vacua, and relations among them. I will discuss some examples of these structures coming from the geometric Langlands program and their applications. Based on joint work with Andy Neitzke and Sam Gunningham. 

We will discuss the percolation model on the hexagonal grid. In 2001 S. Smirnov proved conformal invariance of its scaling limit through the use of a tricky auxiliary combinatorial construction.

We present a more conceptual approach, implying that the construction in question can be thought of as geometrically natural one.

The main goal of the talk is to make it believable that not all nice and useful objects in the field have been already found.

No background is required.