Peter K. Friz (Technische Universität Berlin)
Rough Analysis and Applications (ONLINE) abstract
Abstract:
We plan to discuss: the algebra of iterated integrals, signatures and expected signatures, rough paths and models; Kolmogorov type criteria; Schauder estimates; p-variation, abstract Riemann-Stieltjes integration (Sewing); rough integration and reconstruction; a paracontrolled view; rough differential equations and flows; rough transport equations; second order rough partial differential equations; rough volatility; a regularity structure view; large deviations and precise asymptotics for rough volatility.A good part of the lecture will follow F-Hairer (2014,2020).
10:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room
Ruth Kellerhals (Uni Fribourg)
CANCELLED: Title T.B.A.
10:20 • Université de Fribourg, Chemin du Musée 23, Lonza (Math II) seminar room
Nikolay Gusev (SISSA, Trieste)
CANCELLED: Title T.B.A.
14:15 • Universität Basel, Fachbereich Mathematik, Spiegelgasse 1, Seminar Room 00.003
Cedric Lecouvey (Université de Tours)
Title T.B.A.
15:15 • EPF Lausanne, Salle CM 1 113
Dr. Maria Dostert (EPFL)
Kissing number in non-Euclidean spaces abstract
Abstract:
The kissing number is the maximal number of unit spheres which can toucha central unit sphere in Euclidean space without pairwise intersecting in their interior. In this talkwe consider an analogous problem in hyperbolic H^n and spherical S^n spaces, for n ≥ 2.We provide upper and lower bounds for the kissing number of congruent radius r > 0 spheres in H^n and S^n.For that purpose, the kissing number is replaced by the kissing function κ_H (n, r), resp. κ_S (n, r), which depends on the dimension n and the radius r.After we obtain some theoretical upper and lower bounds for κ_H (n, r), we study their asymptoticbehavior and apply a suitable semidefinite program to obtain upper bounds.Furthermore, we locate the values of κ_S (n, r) over subintervals in [0, π] with relatively high accuracy.This is a joint work with Alexander Kolpakov.
15:45 • Location T.B.A.
Onlline Seminar
Prof. Dr. Delaram Kahrobaei (University of York)
eSeminar: Interactions between Group Theory, Cyber Security, Artificial Intelligence, and Quantum Computation abstract
Abstract:
(**This eSeminar will take place on Zoom. Please contact karan.khathuria@math.uzh.ch to get meeting details**)<BR> In this talk, I explore how group theory playing a crucial role in cyber security and quantum computation. At the same time, how computer science for example machine learning algorithms and computational complexity could help group theorists so tackle their open problems, as such this could help with cryptanalysis of the proposed primitives.
Symmetry is present in all forms in the natural and biological structures as well as man-made environments. Computational symmetry applies group-theory to create algorithms that model and analyze symmetry in real data set. The use of symmetry groups in optimizing the formulation of signal processing and machine learning algorithms can greatly enhance the impact of these algorithms in many fields of science and engineering where highly complex symmetries exist.
At the same time, Machine Learning techniques could help with solving long standing group theoretic problems. For example, in the paper [J. Gryak (University of Michigan, Data Science Institute), R. Haralick (The City University of New York, the prize recipient of International Association for Pattern Recognition), D. Kahrobaei, Solving the Conjugacy Decision Problem via Machine Learning, Experimental Mathematics, Taylor & Francis (2019)] the authors use machine learning techniques to solve the conjugacy decision problem in a variety of groups. Beyond their utilitarian worth, the developed methods provide the computational group theorist a new digital "sketchpad" with which one can explore the structure of groups and other algebraic objects, and perhaps yielding heretofore unknown mathematical relationships.
Graph theoretic problems have been of interest of theoretical computer scientists for many years, especially the computational complexity problems for such algorithmic problems. Such studies have been fruitful for one of the millennium problems (P vs NP) of the Clay Math Institute. Since graph groups are uniquely defined by a finite simplicial graph and vice versa, it is clear that there is a natural connection between algorithmic graph theoretic problems and group theoretic problems for graph groups. Since the graph theoretic problems have been of central importance in complexity theory, it is natural to consider some of these graph theoretic problems via their equivalent formulation as group theoretic problems about graph groups. The theme of the paper [Algorithmic problems in right-angled Artin groups: Complexity and applications, R. Flores, D. Kahrobaei, T. Koberda, J. of Algebra, Elsevier 2019.] is to convert graph theoretic problems for finite graphs into group theoretic ones for graph groups (a.k.a. right-angled Artin) groups, and to investigate the graph theory algebraically. In doing so, new approaches to resolving problems in complexity theory become apparent. The authors are primarily motivated by the fact that some of these group theoretic problems can be used for cryptographic purposes, such as authentication schemes, secret sharing schemes, and key exchange problems.
In the past couple of decades many groups have been proposed for cryptography, for instance: polycyclic groups for public-key exchanges, digital signatures, secret sharing schemes (Eick, Kahrobaei), hyperbolic groups for private key encryption (Chatterji-Kahrobaei), p-groups for multilinear maps (Kahrobaei, Tortora, Tota) among others.
[J. Gryak, D. Kahrobaei, The Status of the Polycyclic Group-Based Cryptography: A Survey and Open Problems, Groups Complexity Cryptology, De Gruyter (2016).]
Most of the current cryptosystems are based on number theoretic problems such discrete logarithm problem (DLP) for example Diffie-Hellman key-exchange. Recently there has been some natural connections between algorithmic number theoretic and algorithmic group theoretic problems. For example, it has been shown that for a different subfamily of metabelian groups the conjugacy search problem reduces to the DLP. [J. Gryak, D. Kahrobaei, C. Martinez-Perez, On the conjugacy problem in certain metabelian groups, Glasgow Math. J., Cambridge Univ. Press (2019).]
In August 2015 the National Security Agency (NSA) announced plans to upgrade security standards; the goal is to replace all deployed cryptographic protocols with quantum secure protocols. This transition requires a new security standard to be accepted by the National Institute of Standards and Technology (NIST).
One goal of cryptography, as it relates to complexity theory, is to analyze the complexity assumptions used as the basis for various cryptographic protocols and schemes. A central question is determining how to generate intractible instances of these problems upon which to implement an actual cryptographic scheme. The candidates for these instances must be platforms in which the hardness assumption is still reasonable. Determining if the group-based cryptographic schemes are quantum-safe begins with determining the groups in which these hardness assumptions are invalid in the quantum setting.
In what follows we address the quantum complexity of the Hidden Subgroup Problem (HSP) to determine the groups in which the hardness assumption still stands. The Hidden Subgroup Problem (HSP) asks the following: given a description of a group G and a function f from G to X for some finite set X is guaranteed to be strictly H-periodic, i.e. constant and distinct on left (resp. right) cosets of a subgroup H < G, find a generating set for H.
Group-based cryptography could be shown to be post-quantum if the underlying security problem is NP-complete or unsolvable; firstly, we need to analyze the problem\'s equivalence to HSP, then analyze the applicability of Grover\'s search problem. [K. Horan, D. Kahrobaei, Hidden Subgroup Problem and Post-quantum Group-based Cryptography, Springer Lecture Notes in Computer Science 10931, 2018].
16:00 • Onlline Seminar
Prof. Dr. David Gamarnik (MIT)
Overlap Gap Property: a Provable Barrier to Fast Optimization in Probabilistic Combinatorial Structures abstract
Abstract:
Many combinatorial optimization problems defined on random instances exhibit an apparent gap between the optimal values, which can be computed by non-constructive means, and the best values achievable by fast (polynomial time) algorithms. Through a combined effort of mathematicians, computer scientists and statistical physicists, it became apparent that a potential barrier for designing fast algorithms bridging this gap is an intricate topology of nearly optimal solutions, in particular the presence of the Overlap Gap Property (OGP), which we will introduce in this talk. We will discuss how for many such problems the onset of the OGP phase transition introduces indeed a provable barrier to a broad class of polynomial time algorithms. Examples of such problems include the problem of finding a largest independent set of a random graph, finding a largest cut in a random hypergrah, the problem of finding a ground state of a p-spin model, and also many problems in high-dimensional statistics field. In this talk we will demonstrate in particular why OGP is a barrier for three classes of algorithms designed to find a near ground state in p-spin models arising in the field of spin glass theory: Approximate Message Passing algorithms, algorithms based on low-degree polynomial and Langevin dynamics. Joint work with Aukosh Jagannath and Alex Wein
Georgios Dimitroglou Rizell (University of Uppsala)
Lagrangian tori from a quantitative viewpoint (Zoom Meeting: https://unige.zoom.us/j/5928729514) abstract
Abstract:
Certain quantitative conditions on a Lagrangian torus in the ball or the projective plane ensure that it is Hamiltonian isotopic to the standard Clifford torus. (Roughly speaking, we need the existence of a big symplectic ball in its complement.) We explain the mechanisms behind this and give examples and applications.
17:00 • Université de Genève, Villa Battelle, 7 route de Drize, 1227 Carouge
Yakov Eliashberg (Stanford University)
Symplectic cobordisms revisited (Zoom Meeting: https://unige.zoom.us/j/5928729514) abstract
Abstract:
I will explain in the talk a simplified proof of our joined theorem with Emmy Murphy about construction of symplectic cobordisms between contact manifolds.
20:00 • Université de Genève, Villa Battelle, 7 route de Drize, 1227 Carouge