Simon Drewitz (Université de Fribourg)
Sims\' Low Index Subgroup Algorithm abstract
Abstract:
Selberg\'s Lemma tells us that every group T € Isom (Hn) defininga hyperbolic orbifold T/Hn contains a torsion free subgroup G < T offinite index. This gives the existence of a covering manifold M = G\\Hn. However, the proof is not constructive.I will explain a well known algorithm by Sims listing all subgroupsof a finitely presented group up to a given index. Using work by Carteron torsion elements of Coxeter groups, this algorithm can help finding specifically torsion free subgroups of Coxeter groups. This will enable us to search for covering manifolds of Coxeter orbifolds.
10:20 • Université de Fribourg, Chemin du Musée 23, Lonza (Math II) seminar room
Dr. Tomasz Kacprzak (ETH Zürich)
Deep learning for cosmology: parameter measurement and generation of simulations abstract
Abstract:
Deep learning-based analysis methods are gaining interest in cosmology due to their unique ability to create very rich and complex models.
These models are particularly well suited for analysis of large scale structure data, as the matter density fields are comprised of highly nonlinear, complicated features, such as halos, filaments, sheets and voids.
But can this information be utilised by the deep learning algorithm to gain a better understanding of the cosmological model?
In this talk I will present the application of Convolutional Neural Networks (CNNs) for constraining cosmological parameters.
I will compare the constraining power against the commonly used statistic, the power spectrum, and explore different regimes in quality of data and simulations.
Finally, I will introduce the Generative Adversarial Networks (GANs): a CNN-based technique, which can learn from a training set and then generate new, statistically similar data.
I will present a study of applying GANs to generating samples of the cosmic web and discuss the prospects of applying them to render 2D and 3D N-body simulation - like data.
11:00 • Idiap Research Institute Martigny, Location of the talk: Centre du Parc, Rue Marconi 19, CH-1920 Martigny
Younghan Bae (ETH Zürich)
Tautological relations on the moduli space of stable maps abstract
Abstract:
We will discuss tautological relations for the moduli space of stable maps to arbitrary smooth projective variety. Using the double ramification cycle formula for target varieties of Janda-Pandharipande-Pixton-Zvonkine, we construct non-trivial tautological relations parallel to Pixton’s double ramification cycle relations for the moduli of curves.
13:30 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Simone Melchiorre Chiarello (Université de Genève)
The umbral calculus abstract
Abstract:
Umbral calculus is a simple and elegant device to handle diverse polynomial sequences in a unified way. It allows, among the other things, to easily obtain classical identities otherwise found by complicated ad hoc arguments, and to generalize them. In this talk I will introduce the most basic techniques of umbral calculus and will apply them to study classical examples like finite difference calculus, Bernoulli and Hermite polynomials.
14:00 • Université de Genève, Villa Battelle, 7 route de Drize, 1227 Carouge
Dr. Alexios Balatsoukas-Stimming (EPFL)
Practical approximate channel decoders abstract
Abstract:
During the so-called happy scaling era of integrated circuits, the increasing transistor count per unit area and the increasing energy-efficiency were able to offset the ever-increasing complexity of communications and digital signal processing algorithms. Unfortunately, the gains from circuit technology scaling have slowed down significantly in the last few years. One of the promising techniques that have been proposed to overcome this hurdle is approximate computing, where the reliability constraints of integrated circuits are relaxed significantly. In this presentation, we will first explain how well-known methods, such as density evolution, can be adapted in order to analyze LDPC and polar decoders that operate with approximate memory. For polar codes in particular, we will also describe efficient techniques that can be used to mitigate the effect of memory faults. Finally, we will explain why most approximate channel decoders that have been proposed in the literature so far (including our own) are impractical, and we will present some low-complexity hardware methods that can be used to partially overcome this obstacle.
15:00 • Uni Neuchatel, B217
Laszlo Marton Toth (EPF Lausanne)
Invariant Schreier Structures on Unimodular Random Graphs abstract
Abstract:
It is a nice exercise in combinatorics to show that all finite 2d-regular graphs are Schreier graphs of the free group on d generators. We will consider the analogous question in the world of Benjamini-Schramm convergence of sparse graphs. We show that any 2d-regular unimodular random network can be given an invariant random Schreier structure. Connections to Borel combinatorics, measured group theory and Invariant Random Subgroups will also be explored. The talk aims to be self-contained, all important notions will be properly introduced.
15:45 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Prof. Dr. Elisa Gorla (Université de Neuchâtel)
Measures of complexity for polynomial system solving over finite field abstract
Abstract:
Multivariate cryptography is one of a handful of proposal of post-quantum cryptosystems, i.e. cryptosystems that remain secure even in the presence of a quantum computer. In multivariate cryptography, the hard computational problem that one has to solve in order to retrieve the original message from the cyphertext is solving a system of multivariate polynomial equations over a finite field. In this talk, I introduce the current approaches to bounding this complexity. I compare them to each other and discuss some difficulties that arise when one tries to eliminate the heuristics from the complexity estimates. I also present some of my results on specific systems coming from multivariate cryptography.
16:00 • Uni Neuchatel, B217
Prof. Dr. Paul Ledger (College of Engineering, Swansea University)
Characterisation of multiple inhomogeneous conducting objects in metal detection using magnetic polarizability tensors abstract
Abstract:
Locating and identifying hidden conducting objects has a range of important applications in metal detection including searching for buried treasure, identifying land mines and in the early detection of concealed terrorist threats. There is a need to distinguish between multiple objects, for example, in benign situations, such as coins and keys accidentally left in a pocket during a security search or a treasure hunter becoming lucky and discovering a hoard of Roman coins, as well as in threat situations, where the risks need to be clearly identified from the background clutter. Furthermore, objects are also often inhomogeneous and made up of several different metals. For instance, the barrel of a gun is invariably steel while the frame could be a lighter alloy, jacketed bullets have a lead shot and a brass jacket and modern coins often consist of a cheaper metal encased in nickel or brass alloy. Thus, in practical metal detection applications, it is important to be able to characterise both multiple objects and inhomogeneous objects. Traditional approaches to the metal detection involve determining the conductivity and permeability distributions in the eddy current approximation of Maxwell\'s equations and lead to an ill-posed inverse problem. On the other hand, practical engineering solutions in hand held metal detectors use simple thresholding and are not able to discriminate between small objects close to the surface and larger objects buried deeper underground. In this talk, an alternative approach in which prior information about the form of the conducting permeable object has been introduced will be discussed.
Ammari, Chen, Chen, Garnier and Volkov [1] have obtained the leading order term in an asymptotic expansion of the perturbed magnetic field, due to the presence of a homogeneous conducting permeable object, as the object size tends to zero. This expansion separates the object\'s position from its shape and material description, offering considerable advantages in case of isolated objects. We have shown that this leading order term simplifies for orthonormal coordinates and results in a characterisation of a conducting permeable object by a complex symmetric rank 2 magnetic polarizability tensor (MPT) for the eddy current case [2]. Interestingly, the MPT is different to the symmetric rank 2 Poyla-Szegö polarizability tensor (also known as the Poyla-Szegö polarisation tensor) that is known to characterise small permeable objects in magnetostatics and small conducting objects in electrical impedance tomography [3]. For instance, computing the coefficients of the MPT rely on the solution of vectorial curl-curl transmission problems while the latter on simpler scalar transmission problems. The topology ofan object plays an interesting role in the MPT coefficients. Including more terms in the asymptotic expansion increases the accuracy of the representation of the perturbed field. The higher order terms contain higher order tensors, which provide more information about the shape and material parameters of an object, and can help to improve object identification. Complete asymptotic expansions of the perturbed field for the electrical impedance tomography problem have been obtained by Ammari and Kang [3] and provide acomplete characterisation of an object by generalised polarisation tensors. For the eddy current case, we have extended the leading order term obtained in [1] to a complete expansion of the perturbed magnetic field. The higher order terms in our expansion characterise a conducting permeable object in terms of a new class of generalised magnetic polarizability tensors [4], of which the rank 2 MPT is the simplest case. Practical metal detection problems contain multiple and inhomogeneous objects. We have also provided an extension of [1, 2] to characterise multiple inhomogeneous objects, including objectsthat are closely spaced, in terms of MPTs [5].
The talk will review recent work on MPTs and explore the interesting properties exhibited by these tensors for shapes and topologies of objects. The role that a dictionary of MPTs for different shaped objects can play in object classification will also be described.
References:
[1] H. Ammari, J. Chen, Z. Chen, J. Garnier and D. Volkov, Target detection and characterizationfrom electromagnetic induction data, J. Math. Pure Appl. 2014: 101: 54-75.
[2] P.D. Ledger and W.R.B. Lionheart, Characterising the shape and material properties of hidden targets from magnetic induction data, IMA J. Appl. Math. 2015: 80: 1776-1798.
[3] H. Ammari and H. Kang, Polarization and Moment Tensors: With Applications to Inverse Problems and Effective Medium Theory, New-York, Springer, 2007.
[4] P.D. Ledger and W.R.B. Lionheart, Generalised magnetic polarizability tensors, Math. Meth. Appl. Sci., 2018: 41: 3175-3196.
[5] P.D. Ledger, W.R.B. Lionheart and A.A.S. Amad, Characterisation of multiple conducting permeable objects in metal detection by polarizability tensors, Math. Meth. Appl. Sci., 2019:42: 830-860.
16:15 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H 25
Special session on some of Harry Kesten\'s mathematics, II
17:15 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H 12