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.

168,742 papers · 148 categories

Trend · papers per month

58117175233 · Jun 202019922001200920172026
48 results for euclidean convexity

Maximal distortion between geodesic and Euclidean diameters in polygonal domains is studied.

problem Maximal ratio of geodesic to Euclidean diameters in polygonal domains with holes.
method Analyzes convex polygons with holes, using geometric triangulations as a comparison.
result The supremum of the ratio is between Ω(h1/3)Ω(h^{1/3}) and O(h1/2)O(h^{1/2}) for convex polygons.

Solves Christoffel-Minkowski problem for capillary convex bodies in Euclidean half-space.

problem Finding capillary convex bodies with prescribed kk-th capillary area measure.
method Solving a Hessian-type equation with Robin boundary condition.
result Existence and uniqueness of a smooth solution under natural conditions.

Study optimizes perimeter in convex domains with anisotropic constraints.

problem Optimizing perimeter in convex domains with anisotropic constraints.
method Analytical properties, topological features, and geometric measure theory results.
result Sharp isoperimetric inequalities and existence of minimizers.

Paper proves rigidity of convex hypersurfaces in various spaces.

problem Proving the uniqueness of convex hypersurfaces in multidimensional spaces.
method Generalizing Senkin's theorem to higher dimensions and constant curvature spaces.
result Rigidity of convex hypersurfaces in En+1E^{n+1}, n3n \ge 3.

This paper extends a 3D result to higher dimensions for manifolds with positive curvature.

problem Proving higher-dimensional manifolds with positive curvature operator and strictly convex boundary are diffeomorphic to the Euclidean disk.
method Using the positive curvature operator and strictly convex boundary conditions to deduce the manifold's diffeomorphism to the Euclidean disk.
result Compact n-manifolds with positive curvature operator and strictly convex boundary are diffeomorphic to the standard n-dimensional Euclidean disk.

New methods optimize functions on hyperbolic and spherical spaces, matching Euclidean rates up to logarithmic factors.

problem Optimizing functions on non-Euclidean spaces like hyperbolic and spherical geometries.
method Introduced accelerated global first-order methods for LL-smooth and geodesically convex functions on hyperbolic and spherical spaces.
result Achieved the same rates as accelerated gradient descent in Euclidean space, up to logarithmic factors.

The paper explores centroids and static equilibrium points in non-Euclidean geometries.

problem Investigating centroids and static equilibrium points in spherical, hyperbolic, and normed spaces.
method Extending Gal'perin's work, the paper examines convex bodies in these spaces and analyzes the minimum number of equilibrium points.
result Every plane convex body in any of these spaces has at least four equilibrium points, and there are mono-monostatic convex bodies in 3D spherical, hyperbolic, and certain normed spaces.

Paper revisits DP-SCO in Euclidean and pd\ell_p^d spaces, focusing on constrained and bounded sets.

problem Differentially private stochastic convex optimization in constrained and bounded sets in Euclidean and pd\ell_p^d spaces.
method Proposes methods achieving excess population risks dependent on Gaussian width of the constraint set, and novel algorithms for unconstrained and heavy-tailed data.
result Theoretical results for DP-SCO in pd\ell_p^d spaces, including optimal bounds for strongly convex functions.

New method turns optimization algorithms into uniformly stable learning algorithms for non-Euclidean norms.

problem Non-Euclidean norms in binary classification problems.
method Black-box reduction method using uniformly convex regularizers.
result Achieves optimal statistical risk bounds on excess risk for non-Euclidean norms.

The paper studies convexity of products of squared Euclidean distances.

problem Convexity of products of squared Euclidean distances.
method Proved a convexity principle and applied it to products of squared distances, computed Hessian-positive regions and exact convexity levels.
result Computed exact convexity and quasiconvexity truncation levels for the two-centre model.

New algorithms optimize convex functions with high-order derivatives.

problem Optimizing convex functions with high-order derivatives under various norms.
method Developed a non-Euclidean inexact accelerated proximal point method using an inexact uniformly convex regularizer.
result Showed nearly optimal algorithms for high dimensions in the black-box oracle model for p\ell_p-settings and all q1q \geq 1.

For a Euclidean building XX of type A2A_{2}, we classify the 0-dimensional subbuildings AA of TX\partial_{T}X that occur as the asymptotic boundary of closed convex subsets. In particular, we show that triviality of the holonomy of a triple (of points of AA) is (essentially) sufficient. To prove this, we construct n…

2006-10-30abs ↗pdf ↗

The Gauss curvature measure of a pointed Euclidean convex body is a measure on the unit sphere which extends the notion of Gauss curvature to non-smooth bodies. Alexandrov's problem consists in finding a convex body with given curvature measure. In Euclidean space, A.D. Alexandrov gave a necessary and sufficient condit…

2019-03-15abs ↗pdf ↗

New inequalities for convex hypersurfaces in various spaces.

problem Deriving inequalities for hypersurfaces under convex weight.
method Sharp weighted Alexandrov-Fenchel and Minkowski inequalities for smooth, closed hypersurfaces in Euclidean, spherical, and hyperbolic spaces.
result Incorporates convex, non-decreasing positive functions as weights, yielding a broad family of geometric inequalities.

On a convex body in a Euclidean space, we introduce a new variational formulation for its Funk metric, a Finsler metric compatible with the tautological Finsler structure of the convex body. We generalize the metric on Teichmuller spaces with the Weil-Petersson distance function. A set of similarities the resulting met…

2011-10-23abs ↗pdf ↗

Investigates differences in solving mean curvature problems in Euclidean and Lorentz-Minkowski spaces.

problem Solving the Dirichlet problem for mean curvature equations in different spacetimes.
method Compares techniques and conditions for solvability in Euclidean and Lorentz-Minkowski spaces.
result Lorentz-Minkowski spacelike condition allows dropping mean convexity hypothesis.

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 proves a theorem about mean curvature in Euclidean and hyperbolic spaces.

problem Proving a theorem about mean curvature in Euclidean and hyperbolic spaces.
method Analyzing connected mean convex regions with at least two components in Rn+1\mathbb{R}^{n+1} and hyperbolic space.
result Connected mean convex regions in Rn+1\mathbb{R}^{n+1} with at least two components cannot have strictly positive mean curvature.

Study spherical convex bodies using LpL_p-floating areas and curvature entropy.

problem Analogous isoperimetric inequalities for spherical convex bodies.
method Introduced LpL_p-floating areas and curvature entropy for spherical convex bodies.
result Established isoperimetric inequalities and dual isoperimetric inequalities.

3-manifold groups can only have convex co-compact representations if they are geometric or hyperbolic.

problem Understanding which 3-manifold groups can have convex co-compact representations.
method Analyzing representations of 3-manifold groups into projective general linear group, focusing on convex co-compactness.
result Fundamental groups of closed irreducible orientable 3-manifolds can only admit convex co-compact representations if they are geometric or hyperbolic.

The paper studies a flow of convex hypersurfaces using anisotropic curvature functions.

problem Deforming convex hypersurfaces in Euclidean space.
method Fully nonlinear curvature flow involving k-th elementary symmetric function and support function.
result Long-time existence and convergence of the flow under certain assumptions.

Various results based on some convexity assumptions (involving the exponential map along with affine maps, geodesics and convex hulls) have been recently established on Hadamard manifolds. In this paper we prove that these conditions are mutually equivalent and they hold if and only if the Hadamard manifold is isometri…

2014-08-04abs ↗pdf ↗

The paper proves new inequalities in hyperbolic space using Euclidean methods.

problem Proving weighted isoperimetric inequalities in hyperbolic space.
method Using isoperimetric inequality with log-convex density in Euclidean space.
result Removed horo-convex assumption and proved new inequalities for star-shaped domains.

The paper studies a flow for convex capillary hypersurfaces in a ball, proving smooth convergence to a spherical cap.

problem Analyzing the behavior of convex capillary hypersurfaces under mean curvature flow.
method Introduced mean curvature flow for hypersurfaces in the unit Euclidean ball with capillary boundary. Proved smooth convergence to a spherical cap for strictly convex initial hypersurfaces.
result The flow preserves strict convexity and converges smoothly to a spherical cap for all positive time.

The paper proves conditions for zero Gaussian curvature convex hypersurfaces to be hyperplanes.

problem Conditions for zero Gaussian curvature convex hypersurfaces to be hyperplanes.
method Proving Bernstein type theorems for entire convex graphical hypersurfaces with zero Gaussian curvature in Euclidean and Minkowski contexts.
result Zero Gaussian curvature convex hypersurfaces must be hyperplanes if the mean curvature goes to zero at infinity.

The paper proves the exact number of singular points in the intersection of convex shapes.

problem Determining the exact number of singular points in the intersection of convex shapes.
method Analyzing the intersections of n translates of a strictly convex, smooth, convex body in the Euclidean plane.
result The intersection of n translates of a convex body has exactly n points of singularity along its boundary.

The usual notion of set-convexity, valid in the classical Euclidean context, metamorphoses into several distinct convexity types in the more general Riemannian setting. By studying this phenomenon in reverse, we characterize complete manifolds for which certain convexity types are assumed a priori to coincide.

2016-11-26abs ↗pdf ↗

We review the theory of intrinsic geometry of convex surfaces in the Euclidean space and prove the following theorem: if the surface of a convex body K contains arbitrary long closed simple geodesics, then K is an isosceles tetrahedron.

2017-02-16abs ↗pdf ↗