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

134267401534 · May 202619922001200920172026
48 results for Euclidean structure

Optimal Euclidean structure minimizes energy in weighted toroidal graphs.

problem Finding the optimal Euclidean structure for weighted toroidal graphs.
method Minimizing Dirichlet energy over all possible Euclidean structures and realizations within a fixed homotopy class.
result The optimal Euclidean structure induces a weighted Delaunay decomposition.

Study on median algebra structures on Euclidean spaces and manifolds with local CAT(0) cubulation.

problem Understanding median algebra structures on Euclidean spaces and manifolds.
method Showed local CAT(0) cubulation for median structures on ER homology manifolds.
result Median structures on ER homology manifolds have a local CAT(0) cubulation structure.

Given a closed orientable Euclidean cone 3-manifold C with cone angles less than or equal to pi, and which is not almost product, we describe the space of constant curvature cone structures on C with cone angles less than pi. We establish a regeneration result for such Euclidean cone manifolds into spherical or hyperbo…

2005-10-20abs ↗pdf ↗

Revisits Isomap, showing it constructs Euclidean representations of geodesic structure.

problem Nonlinear dimension reduction of manifold data.
method Revisits Isomap's rationale, clarifying its approach to constructing Euclidean representations of geodesic structure.
result Convexity is not required for shortest path distances to converge to Riemannian distances.

This paper proposes a spectral clustering algorithm for hyperbolic spaces, improving efficiency over Euclidean methods.

problem Inefficient clustering in Euclidean spaces for complex data structures.
method Developed a spectral clustering algorithm using hyperbolic similarity matrices.
result The algorithm converges at least as fast as Euclidean spectral clustering and performs better on complex datasets.

The paper defines a metric on Euclidean triangles and polygons, proving properties and completeness.

problem Defining and analyzing a metric space for Euclidean triangles and polygons.
method Introducing and proving properties of a metric on marked Euclidean triangles, extending to polygons and triangulated surfaces.
result The metric is Finsler and complete, providing formulas for its infinitesimal structure.

New product structures encode superintegrable Hamiltonian systems in Euclidean spaces.

problem Encoding superintegrable Hamiltonian systems using product structures.
method Introducing commutative and associative product structures on Euclidean spaces of dimension at least three, satisfying specific conditions.
result All abundant superintegrable Hamiltonian systems on Euclidean space of dimension at least three arise from these product structures.

Study on hyperspheres in 4-spaces as special Riemannian manifolds.

problem Characterizing hyperspheres in Euclidean and Minkowski 4-spaces as specific Riemannian manifolds.
method Constructing and studying hyperspheres in 4-dimensional spaces (Euclidean and pseudo-Euclidean) as almost paracontact almost paracomplex Riemannian manifolds.
result Characterization and geometric properties of these manifolds.

We consider timelike and spacelike reductions of 4D, N = 2 Minkowskian and Euclidean vector multiplets coupled to supergravity and the maps induced on the scalar geometry. In particular, we investigate (i) the (standard) spatial c-map, (ii) the temporal c-map, which corresponds to the reduction of the Minkowskian theor…

2015-07-16abs ↗pdf ↗

Survey on 4-manifolds with specific curvature properties.

problem Understanding the structure of 4-manifolds with nonnegative Ricci curvature and Euclidean volume growth.
method Analysis of blow-downs and cone-like structures at infinity.
result Manifolds look like cones over spherical space forms at infinity.

Many classical facts in Riemannian geometry have their pseudo-Riemannian analogs. For instance, the spaces of space-like and time-like geodesics on a pseudo-Riemannian manifold have natural symplectic structures (just like in the Riemannian case), while the space of light-like geodesics has a natural contact structure.…

2006-08-24abs ↗pdf ↗

Differential calculus on Euclidean spaces has many generalisations. In particular, on a set XX, a diffeological structure is given by maps from open subsets of Euclidean spaces to XX, a differential structure is given by maps from XX to R\mathbb{R}, and a Frölicher structure is given by maps from R\mathbb{R} to $X…

2017-12-13abs ↗pdf ↗

The paper explores Kähler structures of Taub-NUT and Kerr spaces.

problem Understanding Kähler properties of gravitational instantons and black holes.
method Analyzing Euclidean Taub-NUT and Kerr metrics using alternative coframes and conformal scaling.
result Euclidean Taub-NUT and Kerr metrics exhibit hyper-Kähler and globally conformally Kähler properties, respectively.

Paper proposes a method to recover point configurations from noisy distance data.

problem Recovering point configurations from noisy distance data.
method Robust Euclidean Distance Geometry via Dual Basis (RoDEoDB) algorithm.
result Exact recovery guarantees for point configuration and Gram matrix under mild conditions.

Improves hierarchical clustering in Euclidean space using autoencoders.

problem Lack of unsupervised methods for learning hierarchical structure in Euclidean space.
method Variational autoencoder with Gaussian mixture prior, rescaling latent space, and Ward's linkage.
result Improved dendrogram purity and Moseley-Wang cost function results.

Generating point clouds, e.g., molecular structures, in arbitrary rotations, translations, and enumerations remains a challenging task. Meanwhile, neural networks utilizing symmetry invariant layers have been shown to be able to optimize their training objective in a data-efficient way. In this spirit, we present an ar…

2019-10-07abs ↗pdf ↗

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 ↗

Study introduces combinatorial criterion for quasi-isometry groups of Euclidean spaces.

problem Determining quasi-isometries of Euclidean spaces.
method Introduces PLδPL_δ-homeomorphisms and combinatorial criterion using vertices and edges of simplicial structures.
result The center of the quasi-isometry group QI(Rn)QI(\mathbb{R}^n) is trivial.

Euclidean embeddings of data are fundamentally limited in their ability to capture latent semantic structures, which need not conform to Euclidean spatial assumptions. Here we consider an alternative, which embeds data as discrete probability distributions in a Wasserstein space, endowed with an optimal transport metri…

2019-05-08abs ↗pdf ↗

Euclidean systems and real PK arrangements linked via geometry.

problem Establishing a connection between Euclidean systems and real PK arrangements.
method Proving a correspondence between Euclidean \vee-systems and real PK arrangements, and showing homeomorphism of moduli spaces.
result Moduli space of Euclidean \vee-systems is homeomorphic to a polytope's interior, and hyperplane arrangements are simplicial.

Compactness theorem for manifolds with scalar curvature and entropy bounds.

problem Understanding the structure of manifolds with specific curvature and entropy bounds.
method Using volume upper bounds to prove Gromov-Hausdorff closeness to Euclidean balls.
result Unit balls in such manifolds are bi-Hölder and bi-W1,pW^{1,p} homeomorphic to Euclidean balls.

A new method compares unaligned datasets using log-Euclidean signatures of SPD matrices.

problem Efficiently comparing datasets with unknown alignment.
method Diffusion operators, Riemannian geometry, log-Euclidean metric.
result LES distance recovers meaningful structural differences, outperforming existing methods.

Every homeomorphism of Euclidean space is a commutator of two homeomorphisms.

problem Understanding the structure of homeomorphisms in Euclidean space.
method Proving every orientation-preserving homeomorphism can be written as a commutator of two such homeomorphisms.
result Every orientation-preserving homeomorphism of Euclidean space is a commutator of two homeomorphisms.

The paper provides examples of geometric transitions in low dimensions.

problem Exploring geometric transitions between different types of structures in low dimensions.
method Explicit examples and computations of transitions from hyperbolic to Euclidean, spherical, and Anti-de Sitter structures.
result Details of elementary computations and techniques are provided to explain geometric transitions.

Symmetric Positive Definite (SPD) matrices have been used in many fields of medical data analysis. Many Riemannian metrics have been defined on this manifold but the choice of the Riemannian structure lacks a set of principles that could lead one to choose properly the metric. This drives us to introduce the principle …

2019-09-09abs ↗pdf ↗

A non-Euclidean generalization of conditional expectation is introduced and characterized as the minimizer of expected intrinsic squared-distance from a manifold-valued target. The computational tractable formulation expresses the non-convex optimization problem as transformations of Euclidean conditional expectation. …

2017-10-16abs ↗pdf ↗

When Daan Krammer and Stephen Bigelow independently proved that braid groups are linear, they used the Lawrence-Krammer-Bigelow representation for generic values of its variables q and t. The t variable is closely connected to the traditional Garside structure of the braid group and plays a major role in Krammer's alge…

2014-11-04abs ↗pdf ↗

EF21-Muon optimizes deep learning with error feedback, improving efficiency and accuracy.

problem Lack of principled distributed frameworks for non-Euclidean LMO-based optimizers.
method Introduces EF21-Muon, a communication-efficient, non-Euclidean LMO-based optimizer with convergence guarantees.
result First efficient distributed implementation of non-Euclidean LMO-based optimizers, achieving up to 7x communication savings.

This paper tightens the generalization error bound for graph embedding in non-Euclidean spaces.

problem High generalization error in non-Euclidean graph embedding, preventing practical applications.
method Novel upper bound of graph embedding's generalization error using local Rademacher complexity.
result The new bound is tighter and faster, allowing better performance in non-Euclidean spaces.

A helical CR structure is a decomposition of a real Euclidean space into an even-dimensional horizontal subspace and its orthogonal vertical complement, together with an almost complex structure on the horizontal space and a marked vector in the vertical space. We prove an equivalence between such structures and step t…

2008-02-12abs ↗pdf ↗

The Euclidean scattering transform was introduced nearly a decade ago to improve the mathematical understanding of convolutional neural networks. Inspired by recent interest in geometric deep learning, which aims to generalize convolutional neural networks to manifold and graph-structured domains, we define a geometric…

2019-05-24abs ↗pdf ↗