相关论文: On refinements of rank one Gallagherian prime geod…

We give a new proof of the best presently known error term in the prime geodesic theorem for compact Riemann surfaces, without the assumption of excluding a set of finite logarithmic measure. Stronger implications of the Gallagher-Koyama…

We reduce the exponent in the error term of the prime geodesic theorem for compact Riemann surfaces from $\frac{3}{4}$ to $\frac{7}{10}$ outside a set of finite logarithmic measure.

We consider a basic computational task of finding $s$ planted rank-1 $m \times n$ matrices in a linear subspace $\mathcal{U} \subseteq \mathbb{R}^{m \times n}$ where $\dim(\mathcal{U}) = R \ge s$. The work of Johnston-Lovitz-Vijayaraghavan…

We use Toponogov's triangle comparison theorem from Riemannian geometry along with quantitative scale oriented variants of classical propagation of singularities arguments to obtain logarithmic improvements of the Kakeya-Nikodym norms…

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…

In this paper, we study Riemannian zeroth-order optimization in settings where the underlying Riemannian metric $g$ is geodesically incomplete, and the goal is to approximate stationary points with respect to this incomplete metric. To…

Let $G$ be the interior domain of a piecewise analytic Jordan curve without cusps. Let $\{p_n\}_{n=0}^\infty$ be the sequence of polynomials that are orthonormal over $G$ with respect to the area measure, with each $p_n$ having leading…

Let $(M,g)$ be an $n$-dimensional compact boudaryless Riemannian manifold with nonpositive sectional curvature, then our conclusion is that we can give improved estimates for the $L^p$ norms of the restrictions of eigenfunctions to smooth…

We develop a new Riemannian descent algorithm that relies on momentum to improve over existing first-order methods for geodesically convex optimization. In contrast, accelerated convergence rates proved in prior work have only been shown to…

For $\Gamma$ a cofinite Kleinian group acting on $\mathbb{H}^3$, we study the Prime Geodesic Theorem on $M=\Gamma \backslash \mathbb{H}^3$, which asks about the asymptotic behaviour of lengths of primitive closed geodesics (prime geodesics)…

We apply the converse of Noether's second theorem to the first-order $n$-dimensional Lovelock action, considering the frame rotation group as both $SO\left(1,n-1\right)$ or as $SO(n)$. As a result, we get the well-known invariance under…

It is common in pose graph optimization (PGO) algorithms to assume that noise in the translations and rotations of relative pose measurements is uncorrelated. However, existing work shows that in practice these measurements can be highly…

We study the problem of $2$-dimensional orthogonal range counting with additive error. Given a set $P$ of $n$ points drawn from an $n\times n$ grid and an error parameter $\eps$, the goal is to build a data structure, such that for any…

Selecting appropriate regularization coefficients is critical to performance with respect to regularized empirical risk minimization problems. Existing theoretical approaches attempt to determine the coefficients in order for regularized…

We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…

We study the standard quadratic optimization problem over the simplex when the objective matrix is drawn from the Gaussian Orthogonal Ensemble (GOE). Let \(\kappa_n\) denote the support size of the almost surely unique global optimizer. We…

By combining and improving recent techniques and results, we provide explicit estimates for the error terms $|\pi(x)-\text{li}(x)|$, $|\theta(x)-x|$ and $|\psi(x)-x|$ appearing in the prime number theorem. For example, we show for all…

We generalize Koyama's $7/10$ bound of the error term in the prime geodesic theorems to the principal congruence subgroups for quaternion algebras. Our method avoids the spectral side of the Jacquet--Langlands correspondences, and relates…

Taking the Iwaniec explicit formula as a starting point, we give a short proof of a more precise $\frac{2}{3}$ bound for the exponent in the error term of the Gallagher-type prime geodesic theorem for the modular surface.

An adaptive regularization algorithm using inexact function and derivatives evaluations is proposed for the solution of composite nonsmooth nonconvex optimization. It is shown that this algorithm needs at most…