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

Trend · papers per month

101202302403 · Jun 202019922001200920172026
48 results for Convex domains

Symplectic homology matches dual capacities for convex domains.

problem Understanding symplectic capacities and Reeb flows on convex domains.
method Isomorphic filtered symplectic homology to dual singular homology.
result Gutt-Hutchings capacities match spectral invariants for convex domains.

Solves equality case in isoperimetric inequality for non-convex domains.

problem Equality case in relative isoperimetric inequality outside convex sets.
method Analyzes non-convex domains to settle the equality case.
result Solves the equality case for relative isoperimetric inequality outside arbitrary convex sets.

Optimal inequality for free boundary hypersurfaces in convex domains.

problem Proving an optimal Heintze-Karcher inequality for free boundary hypersurfaces.
method Analyzing anisotropic free boundary hypersurfaces in convex domains.
result Optimal Heintze-Karcher-type inequality achieved for anisotropic free boundary Wulff shapes.

We give a necessary complex geometric condition for a bounded smooth convex domain in Cn, endowed with the Kobayashi distance, to be Gromov hyperbolic. More precisely, we prove that if a smooth bounded convex domain contains an analytic disk in its boundary, then the domain is not Gromov hyperbolic for the Kobayashi di…

2013-12-02abs ↗pdf ↗

In contrast to the many examples of convex divisible domains in real projective space, we prove that up to projective isomorphism there is only one convex divisible domain in the Grassmannian of pp-planes in R2p\mathbb{R}^{2p} when p>1p > 1. Moreover, this convex divisible domain is a model of the symmetric space associ…

2015-10-14abs ↗pdf ↗

Optimal inequalities found between Riemannian and Hilbert metrics in convex projective domains.

problem Finding optimal bounds between Riemannian and Hilbert metrics in convex projective domains.
method Optimal control techniques applied to Riemannian metrics induced by centro-affine hypersurface immersions.
result Optimal inequalities between Riemannian and Hilbert metrics for a class of convex projective domains.

Study finds finitely many non-congruent polygonal domains with same Steklov spectrum.

problem Inverse Steklov problem on convex polygons.
method Analysis of Steklov eigenvalues and isoperimetric bounds.
result For almost all convex polygonal domains, there exist at most finitely many non-congruent domains with the same Steklov spectrum.

Geometric inequalities for static convex domains in hyperbolic space proved.

problem Proving geometric inequalities for static convex domains in hyperbolic space.
method Using static convexity of flow hypersurfaces, new inequalities are derived.
result New family of geometric inequalities for static convex domains in hyperbolic space.

Paper finds inequalities for convex domains in hyperbolic space.

problem Finding inequalities for convex domains in hyperbolic space.
method Introducing hyperbolic ellipsoids and using orthogonal projection to establish inequalities.
result Affine isoperimetric inequalities for static convex domains in hyperbolic space characterized by hyperbolic ellipsoids.

We develop a theory of planar, origin-symmetric, convex domains that are inextensible with respect to lattice covering, that is, domains such that augmenting them in any way allows fewer domains to cover the same area. We show that origin-symmetric inextensible domains are exactly the origin-symmetric convex domains wi…

2013-01-24abs ↗pdf ↗

Research shows how certain flat structures behave in specific convex domains.

problem Understanding the behavior of codimension-1 simplices in divisible convex domains.
method Analyzes the set of codimension-1 flats and their images in quotient manifolds.
result The set of codimension-1 flats forms a finite collection of disjoint virtual tori, leading to cusped convex projective manifolds.

In this article, we study convex affine domains which can cover a compact affine manifold. For this purpose, we first show that every strictly convex quasi-homogeneous projective domain has at least C1C^1 boundary and it is an ellipsoid if its boundary is twice differentiable. And then we show that an n-dimensional par…

2003-05-01abs ↗pdf ↗

New convex domains in hyperbolic space can have lower fundamental gap than constant potentials.

problem Finding convex domains with lower fundamental gap than constant potentials.
method Constructing specific convex domains and potentials with controlled eigenfunctions.
result Fundamental gap of Δ+V-Δ+V can be strictly smaller than Δ for convex domains.

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.

Convex domains have a unique boundary property related to normal vectors.

problem Characterizing convex domains using boundary properties and inequalities.
method Proving an inequality involving boundary normal vectors and distances.
result A constant cnc_n exists such that the inequality holds for convex domains, with equality if and only if the domain is convex.

In a Riemannian manifold a regular convex domain is said to be λλ-convex if its normal curvature at each point is greater than or equal to λλ. In a Hadamard manifold, the asymptotic behaviour of the quotient $\vol(Ω(t))/\vol(\partialΩ(t))$ for a family of λλ-convex domains Ω(t)Ω(t) expanding over the whole space has b…

2010-03-24abs ↗pdf ↗

For any sequence of properly convex domains in the real projective plane such that the zeros of Pick differentials have bounded multiplicity and get further and further apart, we determined all Hausdorff limit domains that one can obtain after normalizing each member of the sequence by a projective transformation. We t…

2019-12-04abs ↗pdf ↗

Negative curvature restricts the gap between the first and second eigenvalues of convex domains.

problem The fundamental gap of convex domains is limited by negative curvature.
method Adapted from Bourni et. al. (2022) for Riemannian manifolds with negative sectional curvature.
result The product of the fundamental gap and the square of the diameter can be arbitrarily small in domains with negative curvature.

Paper proves convex domains have one maximum for semi-stable solutions.

problem Analyzing critical points of semi-stable solutions on convex domains.
method Relating critical points to an auxiliary function and using topological degree.
result Positive, semi-stable solutions have exactly one non-degenerate critical point.

Almost all local minima in neural networks are strongly convex.

problem The prevalence of strongly convex neighborhoods around local minima in neural network optimization landscapes.
method Rigorous analysis of shallow neural networks with analytic activation functions, dividing parameter space into efficient and redundant domains.
result For shallow neural networks on the efficient domain, almost all local minima are strongly convex.

The paper classifies vertices in planar polygons formed by convex domains.

problem Classifying vertices in planar polygons formed by convex domains.
method Analyzing polygons formed by homothets and translates of a convex domain.
result The number of singular boundary points in a CC-polygon is between nn and 2(n1)+m2(n-1)+m for a strictly convex domain with mm singular boundary points.

Study equi-affine invariants for convex domains with asymptotes.

problem Understanding geometric properties of convex domains with specific asymptotes.
method Introducing equi-affine invariants by averaging tropical structures.
result Proving a limiting description of level sets for unbounded domains with two non-parallel asymptotes.