Pierre Bieliavsky (Université Louvain-la-Neuve)
Rankin-Cohen and Moyal twists
10:00 • Université de Genève, Villa Battelle, 7 route de Drize, 1227 Carouge
Loreno Heer (Universität Zürich)
Möbius maps and the boundary at infinity of metric spaces abstract
Abstract:
Quasi-Möbius maps appear naturally when studying the boundary atinfinity of Gromov hyperbolic spaces. In the first part we investigateproperties that remain invariant under such maps and give some applications.In the second part we develop a method to change the metricin such a way that we can study the boundary at infinity as a subset ofthe euclidean space.
10:20 • Université de Fribourg, Chemin du Musée 23, Lonza (Math II) seminar room
Bill Duke (University of California, Los Angeles)
Topics in modern analytic number theory abstract
Abstract:
This series of lectures will treat a number of special topics all of which involve some aspect of the modular group SL(2,Z).
Many have as their natural starting point the class number formulas of Dirichlet for binary quadratic form or, equivalently, ideal classes of quadratic number fields. Most involve L-functions of various kinds and modular forms and their generalizations. These topics include:
New class number formulas, both for quadratic forms and higher degree forms, for example binary cubic form Properties of geometric objects associated to the modular group, including cm points, closed geodesics and infinite volume surfaces having closed geodesics as boundaries. The interaction between flat metrics and the hyperbolic metric, for instance the curvature of closed geodesics with respect to a flat metric. Quasimorphisms of the modular group and modular cocycles. Linking numbers of modular knots. Markov forms and modular billiards Connections with Diophantine approximation and the geometry of numbers.
I will attempt to provide enough background and historical context for each topic to make them accessible to non-experts, but hope to give enough "new" material to stimulate the interest of the experts as well. I will also give suggestions about areas for further research.
13:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Dr. Maria Yakerson (Universität Osnabrück)
Infinite loop spaces in classical and motivic homotopy theory abstract
Abstract:
Classically in homotopy theory, infinite loop spaces are recognized as spaces with an additional structure: grouplike E_{infty}-spaces. The category of such spaces is equivalent to the category of connective spectra. Replacing topological spaces with smooth schemes, we end up in the realm of motivic homotopy theory, where an analogous statement was sought for since the theory has appeared. In this talk, we will recall the modern formulation of the classical recognition principle and discuss the motivic recognition principle. This is joint work with Elden Elmanto, Marc Hoyois, Adeel Khan and Vladimir Sosnilo.
13:30 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 19.2
Prof. Dr. Kenneth G. Paterson (ETH Zurich)
Primality Testing in the Wild abstract
Abstract:
Primality testing is a basic operation in cryptographic software, essential to the security of cryptographic primitives and protocols in many different scenarios. In this talk, I\'ll report on our recent work analysing how primality testing is implemented in widely-used crypto libraries. I will distinguish between testing random numbers that are generated locally and testing of parameters supplied by potentially adversarial parties. Surprisingly, given the simplicity and basic nature of the problem, I will show that the majority libraries get it wrong with their default settings for the adversarial setting. I will discuss what this reveals about the disjunction between cryptographic theory and software development practice, focussing on the need for a better transfer of knowledge and for the use of robust APIs in cryptographic software.
15:00 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H 28
Matthieu Dussaule (Université de Nantes)
The Guivarc\'h inequality in relatively hyperbolic groups abstract
Abstract:
Consider a random walk on a finitely generated group. The Guivarc\'h inequality states that $h<lv$, where $h$ is the asymptotic entropy, $l$ is the asymptotic drift and $v$ is the volume growth of the group. We will be interested in the Guivarc\'h inequality for finitely supported random walks on relatively hyperbolic groups. We will prove in particular that this is always a strict inequality when the maximal parabolic subgroups are virtually abelian
15:45 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Raffael Schüürmann (University of Zurich)
Gröbner Basis algorithms and applications in Multivariate Cryptography abstract
Abstract:
Since the introduction of Buchberger\'s algorithm in 1965, Gröbner basis algorithms have attracted a lot of attention in computational algebra. During the years there were made several improvements on the the efficiency of such algorithms that compute a Gröbner basis for an ideal spanned by a set of multivariate polynomials. We will introduce and compare four of the most successful Gröbner basis algorithms including Buchberger\'s algorithm, Faugère\'s F4 algorithm, F5-like signature based algorithms and the most recent M4GB algorithm. Gröbner basis algorithms are fundamental, when solving multivariate polynomial systems. Therefore, the direct Gröbner basis attack is important for practical security analysis of Multivariate Cryptosystems. We will compare the performance of introduced Gröbner basis algorithms on instances of Multivariate Cryptosystems.
16:15 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H 28
Amir Shpilka (Tel-Aviv University)
Sylvester-Gallai Type Theorems for Quadratic Polynomials abstract
Abstract:
We prove Sylvester-Gallai type theorems for quadratic polynomials. Our results resolve affirmatively two conjectures of Gupta that arose in the context of devising deterministic algorithms for checking zeroness of depth 4 circuits. Specifically, we prove that if a finite collection Q, of irreducible polynomials of degree at most 2, satisfy that for every two polynomials Q1,Q2 \\in Q there is a third polynomial Q3 \\in Q so that whenever Q1 and Q2 vanish then also Q3 vanishes, then the linear span of the polynomials in Q has dimension O(1). We also prove a colored version of the theorem: If three finite sets of quadratic polynomials satisfy that for every two polynomials from distinct sets there is a polynomial in the third set satisfying the same vanishing condition then all polynomials are contained in an O(1)-dimensional space. To obtain our main theorems we prove a new result classifying the possible ways that a quadratic polynomial Q can vanish when two other quadratic polynomials vanish.
16:15 • EPF Lausanne, Salle BC229
Ran Levi (University of Aberdeen)
Complexes of Tournaments in Directed Networks abstract
Abstract:
Clique graphs whose edges are oriented are referred to in the combinatorics literature as tournaments. We consider a family of semi-simplicial sets, that we refer to as "tournaplexes", whose simplices are tournaments. In particular, given a directed graph G, we associate with it a "flag tournaplex" which is a tournaplex containing the directed flag complex of G, but also the geometric realisation of cliques that are not directed. We define several types of filtration on tournaplexes, and exploting persistent homology, we observe that filtered flag tournaplexes provide finer means of distinguishing graph dynamics than the directed flag complex. We then demonstrate the power of those ideas by applying them to graph data arising from the Blue Brain Project’s digital reconstruction of a rat’s neorcortex. Time permitting we explore connection to another graph invariant.
16:15 • EPF Lausanne, Campus Biotech
Thomas Lehéricy (Universität Zürich)
Uniform mixing time and bottlenecks in random quadrangulations abstract
Abstract:
We prove a lower bound on the size of bottlenecks in uniform quadrangulations, valid at all scales simultaneously. We use it to establish upper bounds on the uniform mixing time of the lazy random walk on uniform quadrangulations, as well as on their dual. The proofs involve an explicit computation of the Laplace transform of the number of faces in truncated hulls of the uniform infinite plane quadrangulation.
17:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Shafi Goldwasser (Simons Institute, UC Berkeley, USA)
Abstract:
Cryptography and Computational Learning have shared a curious history: a scientific success for one often provided an example of an impossible task for the other. Today, the goals of the two fields are aligned. Cryptographic models and tools can and should play a role in ensuring the safe use of machine learning. I will discuss this development with its challenges and opportunities.
19:30 • Universität Bern, Hochschulstrasse 4, 3012 Bern, Aula (Main Building)