An Asymptotic Analysis of Bivalent Monoclonal Antibody-Antigen Binding
Heirene, L Byrne, H Yates, J Gaffney, E (16 Jan 2025)
Myths around quantum computation before full fault tolerance: What no-go theorems rule out and what they don't
Zimborás, Z Koczor, B Holmes, Z Borrelli, E Gilyén, A Huang, H Cai, Z Acín, A Aolita, L Banchi, L Brandão, F Cavalcanti, D Cubitt, T Filippov, S García-Pérez, G Goold, J Kálmán, O Kyoseva, E Rossi, M Sokolov, B Tavernelli, I Maniscalco, S (09 Jan 2025)
Randomized Subspace Derivative-Free Optimization with Quadratic Models and Second-Order Convergence
Cartis, C Roberts, L (18 Dec 2024)
Efficient Implementation of Third-order Tensor Methods with Adaptive Regularization for Unconstrained Optimization
Cartis, C Hauser, R Liu, Y Welzel, K Zhu, W (31 Dec 2024)
Scalable Second-Order Optimization Algorithms for Minimizing Low-rank Functions
Tansley, E Cartis, C (07 Jan 2025)
Tue, 06 May 2025
15:00
L6

Sublinear bilipschitz equivalences and quasiisometries of Lie groups

Gabriel Pallier
Abstract

I will present some contributions to the quasiisometry classification of solvable Lie groups of exponential growth that we obtain using sublinear bilipschitz equivalences, which are generalized quasiisometries. This is joint work with Ido Grayevsky.

A counterexample to the coarse Menger conjecture
Nguyen, T Scott, A Seymour, P Journal of Combinatorial Theory, Series B volume 173 68-82 (13 Feb 2025)
Fri, 24 Jan 2025 14:00 -
Fri, 31 Jan 2025 16:00
L6

INTRODUCTION TO DISCRETE ENERGY ON RECTIFIABLE SETS

Ed Saff
(Vanderbilt University)
Abstract

Discrete and continuous energy problems that arise in a variety of scientific contexts are introduced, along with their fundamental existence and uniqueness results. Particular emphasis will be on Riesz and Gaussian pair potentials and their connections with best-packing and the discretization of manifolds. The latter application leads to the asymptotic theory (as N → ∞) for N-point configurations that minimize energy when the potential is hypersingular (short-range). For fixed N, the determination of such minimizing configurations on the d-dimensional unit sphere S d is especially significant in a range of contexts that include coding theory, discrete geometry, and physics. We will review linear programming methods for proving the optimality of configurations on S d , including Cohn and Kumar’s theory of universal optimality. The following reference will be made available during the short course: Discrete Energy on Rectifiable Sets, by S. Borodachov, D.P. Hardin and E.B. Saff, Springer Monographs in Mathematics, 2019.

Sessions:

Friday, 24 January 14:00-16:00

Friday, 31 January 14:00-16:00

Subscribe to