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

326495127 · May 202619922001200920172026
48 results for Euclidean length

As in a symmetric space of noncompact type, one can associate to an oriented geodesic segment in a Euclidean building a vector valued length in the Euclidean Weyl chamber; in addition to the metric length it contains information on the direction of the segment. We study in this paper restrictions on the vector valued s…

2004-06-15abs ↗pdf ↗

Characterizes metrics on triangulated surfaces using glued Euclidean triangles.

problem Describing metrics on triangulated surfaces constructed from glued Euclidean triangles.
method Carefully constructing polyhedral metrics and proving their uniqueness.
result Polyhedral metrics are the only intrinsic metrics preserving Euclidean triangle lengths.

The paper analyzes discrete approximations to minimize curve length in Euclidean space.

problem Minimizing the length of curves between two sets in Euclidean space.
method Finite differences and numerical integration for discrete approximations.
result The squared length of the reconstructed curve converges to the squared minimal length with rate O(N1/2)O(N^{-1/2}).

In this article, we prove that every arithmetic locally symmetric orbifold of classical type without Euclidean or compact factors has arbitrarily long arithmetic progressions in its primitive length spectrum. Moreover, we show the stronger property that every primitive length occurs in arbitrarily long arithmetic progr…

2016-02-04abs ↗pdf ↗

In this paper we prove that the space of flat metrics (nonpositively curved Euclidean cone metrics) on a closed, oriented surface is marked length spectrally rigid. In other words, two flat metrics assigning the same lengths to all closed curves differ by an isometry isotopic to the identity. The novel proof suggests a…

2015-04-05abs ↗pdf ↗

When geometric structures on surfaces are determined by the lengths of curves, it is natural to ask: which curves' lengths do we really need to know? It is a result of Duchin--Leininger--Rafi that any flat metric induced by a unit-norm quadratic differential is determined by its marked simple length spectrum. We genera…

2018-10-03abs ↗pdf ↗

Polyhedra's structure is uniquely defined by edge lengths and dihedral angles, even nonconvex.

problem Determining the structure of polyhedra based on edge lengths and dihedral angles.
method Proved rigidity under specific conditions in Euclidean, hyperbolic, and spherical geometries.
result Polyhedra's structure is uniquely defined by edge lengths and dihedral angles, even nonconvex.

Sharp upper bounds found for Steklov eigenvalues of a specific hypersurface.

problem Finding upper bounds for Steklov eigenvalues of a specific type of hypersurface.
method Analytical approach to compute upper bounds and prove stability properties.
result Sharp upper bounds Bn(L)B_n(L) and BnB_n for Steklov eigenvalues are derived.

We study the symplectic geometry of the moduli space of closed n-gons with fixed side-lengths in hyperbolic 3-space. We prove that these moduli spaces have a symplectic structure coming from Poisson Lie theory. We construct completely integrable systems on these moduli spaces by bending n-gons along their diagonals. Th…

1999-07-22abs ↗pdf ↗

We prove positive mass theorems on ALF manifolds, i.e. complete noncompact manifolds that are asymptotic to a circle fibration over a Euclidean base, with fibers of asymptotically constant length.

2008-03-19abs ↗pdf ↗

We show that any two geometric triangulations of a closed hyperbolic, spherical or Euclidean manifold are related by a sequence of Pachner moves and barycentric subdivisions of bounded length. This bound is in terms of the dimension of the manifold, the number of top dimensional simplexes and bound on the lengths of ed…

2019-02-06abs ↗pdf ↗

We study a problem of geometric graph theory: We determine the triply periodic graph in Euclidean 3-space which minimizes length among all graphs spanning a fundamental domain of 3-space with the same volume. The minimizer is the so-called srs network with quotient the complete graph on four vertices K4K_4. The network…

2017-05-06abs ↗pdf ↗

Choose two points in the tangent bundle of the Euclidean plane (x,X),(y,Y)TR2(x,X),(y,Y)\in T{ \mathbb R}^2. In this work we characterise the immersed length minimising paths with a prescribed bound on the curvature starting at xx, tangent to XX; finishing at yy, tangent to YY, in each connected component of the space of paths…

2014-03-19abs ↗pdf ↗

We present Rotated Adaptive Tetra-iterated Quantizer (RATQ), a fixed-length quantizer for gradients in first order stochastic optimization. RATQ is easy to implement and involves only a Hadamard transform computation and adaptive uniform quantization with appropriately chosen dynamic ranges. For noisy gradients with al…

2019-08-22abs ↗pdf ↗

We prove that each sub-Riemannian manifold can be embedded in some Euclidean space preserving the length of all the curves in the manifold. The result is an extension of Nash C1C^1 Embedding Theorem. For more general metric spaces the same result is false, e.g., for Finsler non-Riemannian manifolds. However, we also sh…

2010-05-10abs ↗pdf ↗

We study side-lengths of triangles in path metric spaces. We prove that unless such a space X is bounded, or quasi-isometric to line or half-line, every triple of real numbers satisfying the strict triangle inequalities, is realized by the side-lengths of a triangle in X. We construct an example of a complete path metr…

2006-11-06abs ↗pdf ↗

We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a vector-valued quadratic invariant bb on the space of those isometric deformations which, for conv…

2004-10-04abs ↗pdf ↗

Our goal is to show, in two different contexts, that "random" surfaces have large pants decompositions. First we show that there are hyperbolic surfaces of genus gg for which any pants decomposition requires curves of total length at least g7/6εg^{7/6 - ε}. Moreover, we prove that this bound holds for most metrics in the…

2010-11-02abs ↗pdf ↗

We extend to higher codimension earlier characterization of the equatorial disk and the critical catenoid by a pinching condition on the length of their second fundamental form among free boundary minimal surfaces in the three dimensional Euclidean ball due to L. Ambrozio and I. Nunes.

2018-08-13abs ↗pdf ↗

We study infinitesimal conformal deformations of a triangulated surface in Euclidean space and investigate the change in its extrinsic geometry. A deformation of vertices is conformal if it preserves length cross-ratios. On one hand, conformal deformations generalize deformations preserving edge lengths. On the other h…

2017-02-13abs ↗pdf ↗

Improved phylogenetic inference with normalizing flows.

problem Limitations of current diagonal Lognormal branch length approximation in VBPI.
method Proposes VBPI-NF using normalizing flows to handle non-Euclidean branch length space.
result Significantly improves phylogenetic posterior estimation on real data.

We consider the moduli spaces Md()\mathcal{M}_d(\ell) of a closed linkage with n links and prescribed lengths in d-dimensional Euclidean space. For d>3 these spaces are no longer manifolds generically, but they have the structure of a pseudomanifold. We use intersection homology to assign a ring to these spaces that can …

2013-06-19abs ↗pdf ↗

Improved phylogenetic tree reconstruction using flexible branch length distributions.

problem Inefficient Markov chain Monte Carlo methods for large sequence datasets.
method Variational Bayesian phylogenetic inference with semi-implicit branch length distributions.
result Proposed method improves marginal likelihood estimation and branch length posterior approximation.