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,657 papers · 148 categories

Trend · papers per month

65130194259 · Jun 202019922001200920172026
48 results for Convex Geometry

As a natural application of the {\it theory of geometric averaging} in Finsler geometry and generalized Finsler geometry, a new approach to investigate {\it generalized Finsler geometry}, based on a convex invariance of the average structures, is introduced.

2009-05-20abs ↗pdf ↗

Convexity and convex functions play an important role in theoretical physics. To initiate a study of the possible uses of convex functions in General Relativity, we discuss the consequences of a spacetime (M,gμν)(M,g_{μν}) or an initial data set (Σ,hij,Kij)(Σ, h_{ij}, K_{ij}) admitting a suitably defined convex function. We show how…

2017-02-18abs ↗pdf ↗

Convexity and convex functions play an important role in theoretical physics. To initiate a study of the possible uses of convex functions in General Relativity, we discuss the consequences of a spacetime (M,gμν)(M,g_{μν}) or an initial data set (Σ,hij,Kij)(Σ, h_{ij}, K_{ij}) admitting a suitably defined convex function. We show how…

2000-11-15abs ↗pdf ↗

In this paper we study the area of ideals triangles in a convex domain with its Hilbert geometry. We obtain a characterization of the hyperbolic geometry among all the Hilbert geometry in terms of area of ideals triangles. We also obtain a sharp lower bound on the hilbert area of ideal triangles, independant of the con…

2003-12-08abs ↗pdf ↗

Characterizes holonomies of convex projective cusps.

problem Understanding holonomies in strictly convex projective geometry.
method Complete characterization of holonomies for strictly convex and round cusps, building families of generalized cusps.
result Produces the first example of generalized cusps with non-virtually nilpotent fundamental group.

CoNES optimizes blackbox functions using convex optimization and information geometry.

problem Optimizing high-dimensional blackbox functions efficiently.
method Formulated as a convex program that adapts evolutionary strategies gradient estimates.
result Vastly outperforms conventional blackbox optimization methods on benchmarks and MuJoCo tasks.

New saddle network architectures preserve convex-concave geometry in optimization problems.

problem Optimization models with convex x and concave y components.
method Structured separable decomposition and saddle network architectures.
result Proven one-dimensional approximation theorem and high accuracy on various test functions.

Paper constructs geometric transitions between hyperbolic and Anti-de Sitter geometries.

problem Transitioning between hyperbolic and Anti-de Sitter geometries.
method Construction via Half-pipe geometry on ΣimesS1Σ imes\mathbb{S}^1 with cone singularities.
result Deformation of convex core structure as bending laminations collapse.

The paper extends geometric results from negatively-curved spaces to strictly convex Hilbert geometry.

problem Extending geometric results from negatively-curved spaces to strictly convex Hilbert geometry.
method Demonstrates dynamical and counting results for geometrically-finite strictly convex projective structures with Hilbert metric.
result Hilbert geodesic flow is strongly mixing and orbits and primitive closed geodesics equidistribute.

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.

We study the spectrum of the Finsler--Laplace operator for regular Hilbert geometries, defined by convex sets with C2C^2 boundaries. We show that for an nn-dimensional geometry, the spectral gap is bounded above by (n1)2/4(n-1)^2/4, which we prove to be the infimum of the essential spectrum. We also construct examples of c…

2012-11-27abs ↗pdf ↗

The Weyl problem is extended to hyperbolic and anti-de Sitter spaces, connecting geometry, analysis, and group theory.

problem The classical Weyl problem for surfaces in hyperbolic and anti-de Sitter spaces.
method Generalizations of the Weyl problem to unbounded convex subsets and convex surfaces, focusing on thin and thick asymptotic boundaries.
result Connections to Kleinian groups, complex analysis, circle packings, and grafting on the hyperbolic disk.

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.

Characterizes billiard and quasigeodesic flows in polyhedral convex bodies.

problem Characterizing billiard and quasigeodesic flows in polyhedral convex bodies.
method Alexandrov geometry methods.
result Optimal regularity result for convex bodies: billiard dynamics is continuous if boundary is of class C2,1\mathcal{C}^{2,1}.

Theory developed for Hilbert geometry over valued fields, linking real and non-Archimedean geometries.

problem Understanding Hilbert geometry over general valued fields and their limits.
method Developed a theory of Hilbert geometry over general ordered valued fields, proving ultralimit results.
result Ultralimit of rescaled real Hilbert geometries is isometric to a non-Archimedean Hilbert metric space.

This note generalizes the visual angle to convex sets in 3D space.

problem Analyzing geometric properties of convex sets in 3D space.
method Generalizing the visual angle to convex sets in Euclidean space and expressing geometric quantities in terms of integrals of functions related to the solid angle.
result Invariant quantities of the original convex set can be expressed by integrals of functions related to the solid angle.

In this paper we establish a gap theorem for the complex geometry of smoothly bounded convex domains which informally says that if the complex geometry near the boundary is close to the complex geometry of the unit ball, then the domain must be strongly pseudoconvex. One consequence of our general result is the followi…

2016-09-22abs ↗pdf ↗

The paper disproves some implications in convex projective geometry.

problem Geometrical finiteness in round convex projective geometry.
method Construction of counterexamples and description of invariant domains.
result Existence of a counterexample with infinite Hilbert volume.

The paper characterizes groups acting on real projective spaces.

problem Understanding groups acting on convex domains in real projective geometry.
method Proves structure theorem for relatively hyperbolic groups in real projective spaces.
result Characterizes groups in terms of invariant convex subsets.

Weakly convex polyhedra which are star-shaped with respect to one of their vertices are infinitesimally rigid. This is a partial answer to the question whether every decomposable weakly convex polyhedron is infinitesimally rigid. The proof uses a recent result of Izmestiev on the geometry of convex caps.

2007-04-22abs ↗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 ↗

The study finds conditions for certain surfaces to have a specific type of metric.

problem Understanding the geometry of surfaces with specific metrics.
method Analyzes surfaces of revolution and derives conditions for a strongly convex slope metric.
result Necessary and sufficient conditions for surfaces of revolution to admit a strongly convex slope metric are established.