Research
On-device research index

arXiv research

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.

169,291 papers · 148 categories

Trend · papers per month

233466699932 · Jun 202019922001200920182026
48 results for geodesic φ-convex sets

The paper generalizes λλ-radial contraction and introduces pλp^λ-convex sets in Riemannian manifolds.

problem Generalizing λλ-radial contraction and defining pλp^λ-convex sets in Riemannian manifolds.
method Developed the concept of pλp^λ-convex function and provided counterexamples and relations between geodesic convex sets and pλp^λ-convex sets.
result Under certain conditions, geodesic convex sets and pλp^λ-convex sets are equivalent.

Totally geodesic submanifolds in convex cores are properly immersed and have finite volume.

problem Characterizing totally geodesic submanifolds in geometrically finite manifolds.
method Analysis of totally geodesic submanifolds in the convex core of geometrically finite rank-one locally symmetric manifolds.
result Every maximal totally geodesic submanifold of dimension at least two in the convex core is properly immersed and has finite volume, and only finitely many such submanifolds can occur.

Extends DCP framework to Hadamard manifolds for geodesically convex functions.

problem Verifying convexity in nonlinear programs on Hadamard manifolds.
method Introduces Disciplined Geodesically Convex Programming (DGCP) framework, defining compositions and transformations for geodesically convex functions.
result Allows verification of geodesic convexity for a broader range of functions, including statistical estimators and matrix-valued optimization.

This paper explores the relation between convex functions and the geometry of space-times and semi-Riemannian manifolds (an investigation initiated by Gibbons-Ishibashi). Specifically, we study geodesic connectedness. We give geometric-topological proofs of geodesic connectedness for classes of space-times to which kno…

2015-10-14abs ↗pdf ↗

Geodesically convex functions are continuous on Riemannian manifolds.

problem Continuity of geodesically convex functions on Riemannian manifolds.
method Proof of continuity using geodesic convexity and addressing a gap in existing proof.
result All geodesically convex functions are continuous in the interior of their domain on Riemannian manifolds.

Study contractibility of boundaries in convex sets and limit sets of subgroups.

problem Understanding contractibility of boundaries and wildness of limit sets in geometric structures.
method Use sufficient conditions for contractibility, study coarse upper curvature bounds, and analyze interpolation in geodesic metric spaces.
result Conditions for contractibility of boundaries and properties of limit sets are established.

The paper derives explicit geodesic equations for a specific type of group structure.

problem Finding geodesics in left-invariant sub-Finsler problems on Heisenberg groups.
method Using convex trigonometry and generalizations of spherical coordinates.
result Explicit formulae for geodesics in Heisenberg groups are derived.

We find a different approach to define convex functions in the sub-Riemannian setting. A function on a sub-Riemannian manifold is nonholonomically geodesic convex if its restriction to any nonholonomic (straightest) geodesic is convex. In the case of Carnot groups, this definition coincides with that by Danniell-Garofa…

2007-01-10abs ↗pdf ↗

Geodesic balls are isoperimetric in hyperbolic spaces with certain densities.

problem Proving isoperimetric properties in hyperbolic spaces with specific densities.
method Using geodesic balls and radial, strictly log-convex densities.
result Geodesic balls are isoperimetric in real hyperbolic space HRnH_{\mathbb R}^n.

Lower bounds for geodesically convex optimization show curvature negatively impacts complexity.

problem Understanding the impact of curvature on the query complexity of geodesically convex optimization.
method Building on recent lower bounds, the study proposes and proves new lower bounds for various settings of geodesically convex optimization.
result Negative curvature is detrimental to the complexity of geodesically convex optimization.

Study weak geodesics in deformed Hermitian-Yang-Mills equation space.

problem Geodesics in the space of potentials for deformed Hermitian-Yang-Mills equation.
method Formulated as degenerate elliptic equation, used nonlinear Dirichlet duality theory, constructed continuous solutions.
result Continuous solutions constructed for Dirichlet problem.

Let Wn\mathcal{W}^{n} be the class of CC^{\infty } complete simply connected nn-dimensional manifolds without conjugate points. The hyperbolic space as well as Euclidean space are good examples of such manifolds. Let % W\in \mathcal{W}^{n} and let AA be a subset of WW. This article aims at characterization and bu…

2013-11-03abs ↗pdf ↗

In this paper, we show a local energy convexity of W1,2W^{1,2} maps into CAT(K)CAT(K) spaces. This energy convexity allows us to extend Colding and Minicozzi's width-sweepout construction to produce closed geodesics in any closed Alexandrov space of curvature bounded from above, which also provides a generalized version of t…

2009-09-28abs ↗pdf ↗

A spherical set is called convex if for every pair of its points there is at least one minimal geodesic segment that joins these points and lies in the set. We prove that for n >= 3 a complete locally-convex (topological) immersion of a connected (n-1)-manifold into the n-sphere is a surjection onto the boundary of a c…

2007-08-23abs ↗pdf ↗

Riemannian algorithms converge at Euclidean rates for geodesically convex-concave problems.

problem Min-max optimization on Riemannian manifolds.
method RCEG method and RGDA for geodesically strongly-convex-concave problems.
result RCEG achieves linear convergence rate in geodesically strongly-convex-concave cases.

The paper extends geometric inequalities for nearly spherical sets in various space forms.

problem Investigating weighted inequalities for nearly spherical sets in space forms.
method Generalizing and extending inequalities for nearly spherical sets in C1C^1 and W2,W^{2,\infty} settings, with convex weight functions.
result Quantitative stability estimates for weighted inequalities in Rn+1\mathbb{R}^{n+1} and Hn+1\mathbb{H}^{n+1}.

Established strong geodesic convex functions and their properties.

problem Geodesic convex functions and monotone vector fields on Riemannian manifolds.
method Characterization and relation establishment for strong geodesic convex functions.
result Relation between variational inequality solutions and strict minimizers for multiobjective programming.

We characterize convex isoperimetric sets in the Heisenberg group endowed with horizontal perimeter. We first prove Sobolev regularity for a certain class of vector fields in the plane with bounded variation, related to the curvature equations. Then, by an approximation-reparameterization argument, we show that the bou…

2006-07-26abs ↗pdf ↗

For a Riemannian manifold (M,g)(M,g) with strictly convex boundary M\partial M, the lens data consists in the set of lengths of geodesics γγ with endpoints on M\partial M, together with their endpoints (x,x+)M×M(x_-,x_+)\in \partial M\times \partial M and tangent exit vectors (v,v+)TxM×Tx+M(v_-,v_+)\in T_{x_-} M\times T_{x_+} M. We show …

2014-12-04abs ↗pdf ↗

The paper proves strict convexity of the Mabuchi functional for geodesics connecting energy minimizers.

problem Proving strict convexity of the Mabuchi functional for geodesics.
method Explicit formula for the complex Hessian of the weighted log-Bergman kernel, and proof by showing geodesics must be non-degenerate and smooth.
result Strict convexity of the Mabuchi functional along geodesics connecting energy minimizers.

New method for optimization on Hadamard manifolds with curvature-independent guarantees.

problem Curvature-dependent complexity in geodesic convex optimization.
method Introducing horospherical convexity and developing algorithms for optimization.
result Curvature-independent convergence of subgradient descent and Nesterov's method.

The study finds at least two short, simple geodesic chords on a disk with convex boundary.

problem Existence of short, simple geodesic chords on a 2-disk with convex boundary.
method Proof of existence using Riemannian geometry and bounds on lengths.
result Existence of at least two short, simple orthogonal geodesic chords on a 2-disk with convex boundary.