Christoforos Neofytidis (Ohio State University)
Realising sets of integers as mapping degree sets abstract
Abstract:
A long-standing topic in the study of manifolds is the computation of all possible degrees of maps between two given closed manifolds. To this end, significant tools have been developed, including coarse geometric methods (negative curvature and harmonic mappings), global analytic concepts (Gromov\'s simplicial volume), as well as algebraic techniques (fundamental group and cohomology structures). In this talk, we initiate the opposite direction, relating number theoretic notions to topological data: Which subsets of the integers are realisable as mapping degree sets? On the one hand, we explain that arbitrary infinite sets are quite often not realisable, and, on the other hand, we show how to realise large classes of finite sets, including all arithmetic and positive geometric progressions. Joint work with S. Wang (Peking University) and Z. Wang (Tsinghua University).
10:30 • Université de Genève, Conseil Général 7-9, Room 1-15
Ding Lu (University of Kentucky)
Eigenvector-dependent nonlinear eigenvalue problems with affine-linear structures abstract
Abstract:
Eigenvector-dependent Nonlinear Eigenvalue Problems (NEPv) have long played critical roles in computational physics and chemistry and more recently become increasingly important in data science application. Practical NEPv usually has particular structures. In this talk, we consider a class of NEPv where the coefficient matrices pose a special affine-linear form. One important origin of such NEPv is the Rayleigh-quotient related optimization, including the trace-ratio optimization for dimension reduction and robust Rayleigh-quotient optimization for handling data uncertainties. We will establish variational characterizations of particular affine-linear NEPv, and then provide a geometric interpretation of a Self-Consistent Fields (SCF) iteration for solving the NEPv. The geometric interpretation reveals global convergence of SCF in many cases and explains its potential non-convergence issues in others. New improvements of SCF, including local acceleration schemes and global verification techniques are also discussed. Numerical experiments are provided to demonstrate the effectiveness of our approach.
14:00 • Université de Genève, Conseil Général 7-9, Room 1-05
Prof. Dr. Bryna Kra (Northeastern University)
The Erdos sumset conjecture and its generalizations abstract
Abstract:
A striking example of the interactions between additive combinatorics and ergodic theory is Szemeredi’s Theorem that a set of integers with positive upper density contains arbitrarily long arithmetic progressions. Soon thereafter, Furstenberg used Ergodic Theory to gave a new proof of this result, leading to the development of combinatorial ergodic theory. These tools have led to uncovering new patterns that must occur in sufficiently large sets of integers and an understanding of what types of structures control these behaviors. Only recently have we been able to extend these methods to infinite patterns, and in recent work we show that any set of integers with positive upper density contains a k-fold sumset. This is joint work with Joel Moreira, Florian Richter, and Donald Robertson.
17:15 • EPF Lausanne, Salle CM 1 4