Related papers: A Subconvex Metaplectic Prime Geodesic Theorem and…

Consider a Riemannian manifold in dimension $n\geq 3$ with strictly convex boundary. We prove the local invertibility, up to potential fields, of the geodesic ray transform on tensor fields of rank four near a boundary point. This problem…

This paper studies finite volume schemes for scalar hyperbolic conservation laws on evolving hypersurfaces of $\mathbb{R}^3$. We compare theoretical schemes assuming knowledge of all geometric quantities to (practical) schemes defined on…

In this note we show that for any hyperbolic surface S, the number of geodesics of length bounded above by L in the mapping class group orbit of a fixed closed geodesic with a single double point is asymptotic to L raised to the dimension…

We prove that in a strongly pseudoconvex domain with smooth boundary, then the length of a geodesic for the Kobayashi-Royden infinitesimal metric between two points is bounded by a constant multiple of the Euclidean distance between the…

The aim of this paper is to shed more light on some recent ideas about Lyapunov exponents and clarify the formal structures behind these ideas. In particular, we show that the vector of (averaged) Lyapunov exponents of a smooth…

The proliferation of saddle points, rather than poor local minima, is increasingly understood to be a primary obstacle in large-scale non-convex optimization for machine learning. Variable elimination algorithms, like Variable Projection…

The conformal bootstrap in physics has recently been adapted to prove remarkably sharp estimates on Laplace eigenvalues and triple correlations of automorphic forms on compact hyperbolic surfaces. These estimates derive from an infinite…

We show that the Laplace approximation of a supremum by Lp-norms has interesting consequences in optimization. For instance, the logarithmic barrier functions (LBF) of a primal convex problem P and its dual appear naturally when using this…

We study adaptive network models in which coupling weights evolve on a fast time scale relative to the phase dynamics of the nodes. Using Geometric Singular Perturbation Theory (GSPT), we prove that, although the microscopic system is…

Soundararajan and Young (2013) proposed a new approach to improve the error term of the prime geodesic theorem for the modular group and actually obtained the exponent 25/36 of the error term. In the present paper, we sharpen it to 9/13.

The convergence of GMRES for solving linear systems can be influenced heavily by the structure of the right hand side. Within the solution of eigenvalue problems via inverse iteration or subspace iteration, the right hand side is generally…

This paper gives a complete parametrization of the commensurability classes of totally geodesic subspaces of irreducible arithmetic quotients of $X_{a, b} = (\mathbf{H}^2)^a \times (\mathbf{H}^3)^b$. A special case describes all Shimura…

We propose a globally-accelerated, first-order method for the optimization of smooth and (strongly or not) geodesically-convex functions in a wide class of Hadamard manifolds. We achieve the same convergence rates as Nesterov's accelerated…

From optimal transport to robust dimensionality reduction, a plethora of machine learning applications can be cast into the min-max optimization problems over Riemannian manifolds. Though many min-max algorithms have been analyzed in the…

In this work, we analyze two of the most fundamental algorithms in geodesically convex optimization: Riemannian gradient descent and (possibly inexact) Riemannian proximal point. We quantify their rates of convergence and produce different…

In this paper, we introduce a decomposition lemma that allows error terms to be expressed using fewer rank-one symmetric matrices than $\frac{n(n+1)}{2}$ within the convex integration scheme of constructing flexible $C^{1,\alpha}$ solutions…

We consider the problem of translating between irreducible closed sets and implicational bases in closure systems. To date, the complexity status of this problem is widely open, and it is further known to generalize the notorious hypergraph…

This note presents a new, self-contained proof of Shahgholian's geometric theorem on quadrature surfaces using the thickness function and level set methods. By relying on a radial parametrisation and fundamental maximum principles, the…

We study the class of (locally) anti-blocking bodies as well as some associated classes of convex bodies. For these bodies, we prove geometric inequalities regarding volumes and mixed volumes, including Godberson's conjecture, near-optimal…

We consider convex sets and functions over idempotent semifields, like the max-plus semifield. We show that if $K$ is a conditionally complete idempotent semifield, with completion $\bar{K}$, a convex function $K^n\to\bar{K}$ which is lower…