A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Paper proves Simon's third gap conjecture for minimal surfaces in spheres.
problem Investigating the third gap problem in Simon's conjecture for minimal surfaces in unit spheres.
method Developed refined third-order Simons-type integral identities and established new lower bounds for curvature terms.
result Obtained positive gap results for the squared norm of the second fundamental form throughout the interval \(\left[\frac{5}{3},\frac{9}{5}
ight]\).
Computing unlinking number is usually very difficult and complex problem, therefore we define BJ-unlinking number and recall Bernhard-Jablan conjecture stating that the classical unknotting/unlinking number is equal to the BJ-unlinking number. We compute BJ-unlinking number for various families of knots and links for w…
In our previous work "Characterization of certain homorphic geodesic cycles on Hermitian locally symmetric manifolds of the noncompact type" in "Modern methods in Complex Analysis" Annals of Math. Studies 138 (1995) 85-118, we formulated a conjecture: the so called "gap phenomenon". The purpose of the article is two-fo…
This paper studies eigenvalues of the clamped plate problem on a bounded domain in an n-dimensional Euclidean space. We give an estimate for the gap between Γk+1−Γ1 and Γk−Γ1, for any positive integer k. According to the asymptotic formula of Agmon and Pleijel, we know, the gap betwe…
Adapting the method of Andrews-Clutterbuck we prove an eigenvalue gap theorem for a class of non symmetric second order linear elliptic operators on a convex domain in euclidean space. The class of operators includes the Bakry-Emery laplacian with potential and any operator with second order term the laplacian whose fi…
This paper studies dynamic stochastic optimization problems parametrized by a random variable. Such problems arise in many applications in operations research and mathematical finance. We give sufficient conditions for the existence of solutions and the absence of a duality gap. Our proof uses extended dynamic programm…
This paper develops several average-case reduction techniques to show new hardness results for three central high-dimensional statistics problems, implying a statistical-computational gap induced by robustness, a detection-recovery gap and a universality principle for these gaps. A main feature of our approach is to ma…
We consider the problem of estimating from sample paths the absolute spectral gap γ∗ of a reversible, irreducible and aperiodic Markov chain (Xt)t∈N over a finite state space Ω. We propose the UCPI (Upper Confidence Power Iteration) algorithm for this problem, a low-complexity algorithm …
Study concavity of solutions to elliptic equations under conformal deformations.
problem Establish concavity estimates for the principle eigenfunction of weighted Schrödinger operators.
method Analyzing the Dirichlet problem for the weighted Schrödinger operator \[-Δu + Vu = λρu\] with conformal connections.
result Partial resolution of Nguyen's conjecture on fundamental gap of horoconvex domains and power convexity estimate for solutions in spherical geometry.
We propose two methods for exact Gaussian process (GP) inference and learning on massive image, video, spatial-temporal, or multi-output datasets with missing values (or "gaps") in the observed responses. The first method ignores the gaps using sparse selection matrices and a highly effective low-rank preconditioner is…
This paper studies the problem of adaptively sampling from K distributions (arms) in order to identify the largest gap between any two adjacent means. We call this the MaxGap-bandit problem. This problem arises naturally in approximate ranking, noisy sorting, outlier detection, and top-arm identification in bandits. Th…
In these notes we describe heuristics to predict computational-to-statistical gaps in certain statistical problems. These are regimes in which the underlying statistical problem is information-theoretically possible although no efficient algorithm exists, rendering the problem essentially unsolvable for large instances…
Several recently proposed architectures of neural networks such as ResNeXt, Inception, Xception, SqueezeNet and Wide ResNet are based on the designing idea of having multiple branches and have demonstrated improved performance in many applications. We show that one cause for such success is due to the fact that the mul…
In this paper, we investigate the Dirichlet problem of Laplacian on complete Riemannian manifolds. By constructing new trial functions, we obtain a sharp upper bound of the gap of the consecutive eigenvalues in the sense of the order, which affirmatively answers to a conjecture proposed by Chen-Zheng-Yang. In addition,…