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

17345168 · May 202619922001200920172026
48 results for Euclidean triangles

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 finds extremum values for mixed Laplacian eigenvalues on triangles and trapezoids.

problem Finding extremum values for mixed eigenvalues of the Laplacian on triangles and trapezoids.
method Characterizations obtained under suitable geometric constraints.
result Characterizations of extremum values for mixed eigenvalues of the Laplacian on triangles and trapezoids.

Study on Laplacian determinant in isosceles triangles, finding equilateral triangle minimizes determinant.

problem Finding the minimum of the spectral determinant on isosceles triangles.
method Analyzing the determinant of the Laplacian on Euclidean isosceles triangle envelopes of fixed area.
result Equilateral triangle envelope minimizes the determinant of the Laplacian.

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.

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 ↗

The paper extends Menelaus' and Ceva's theorems to translation triangles in various Thurston geometries.

problem Extending classical theorems to non-Euclidean geometries.
method Using projective models of Thurston geometries and defining a ``surface of a translation-like triangle".
result Generalization of Menelaus' and Ceva's theorems to non-constant curvature Thurston geometries.

The study examines hypersurfaces in pseudo-Euclidean space with specific curvature properties.

problem Characterizing hypersurfaces with specific curvature conditions in pseudo-Euclidean space.
method Analyzing hypersurfaces satisfying riangleH=λH riangle \vec{H}=λ\vec{H} in Es5\mathbb{E}_{s}^{5}.
result Hypersurfaces with diagonal shape operator have constant mean curvature, norm of second fundamental form, and scalar curvature.

Introduces a new geometry based on difference angles, showing unique properties.

problem Defining angles independently of circles or rotations.
method Axiomatic system for difference angles, defining new geometric constructs.
result Explicit confirmation of the concurrency of the parabolic Miquel configuration.

We discuss the art and science of producing conformally correct euclidean and hyperbolic tilings of compact surfaces. As an example, we present a tiling of the Chmutov surface by hyperbolic (2, 4, 6) triangles.

2016-12-25abs ↗pdf ↗

Let MM be either the 2-sphere $\SS^2 \subset\RR^3$ or the hyperbolic plane $\HH^2 \subset \RR^3$. If Δ(abc)Δ(abc) is a geodesic triangle on MM with corners at a,b,cMa,b,c\in M, we denote by α,β,γMα, β, γ\in M the midpoints of their sides. If ΩΩ denotes the oriented area of this triangle on MM, it satisfies the relations: $$ \s…

2013-07-09abs ↗pdf ↗

The proper Euclidean geometry is considered to be metric space and described in terms of only metric and finite metric subspaces (sigma-immanent description). Constructing the geometry, one does not use topology and topological properties. For instance, the straight, passing through points A and B, is defined as a set …

2000-02-20abs ↗pdf ↗

We develop a transitional geometry, that is, a family of geometries of constant curvatures which makes a continuous connec-tion between the hyperbolic, Euclidean and spherical geometries. In this transitional setting, several geometric entities like points, lines, dis-tances, triangles, angles, area, curvature, etc. as…

2014-11-21abs ↗pdf ↗

We construct the hyperbolic plane with its geodesic flow as the scale plus symmetry reduction of a three-body problem in the Euclidean plane. The potential is I/Δ2-I/Δ^2 where II is the triangle's moment of inertia and ΔΔ its area. The reduction method uses the Jacobi-Maupertuis metric, following the author's earlier p…

2016-09-16abs ↗pdf ↗

The Apollonius theorem is generalized for m-simplices, with applications in geometry and optimization.

problem Generalizing the Apollonius theorem for m-simplices.
method Direct generalization of the theorem to m-simplices in n-dimensional space.
result Applications in geometry and optimization, including minimal surface enclosures, simplex thickness, and root-finding methods.

New bounds on inscribed triangles in arbitrary planar domains.

problem Finding inscribed triangles in arbitrary planar domains with specific angle constraints.
method Proving the existence of uniformly fat triangles and not-too-fat triangles in bounded open sets.
result Existence of a maximal number Θ (between 0 and 60) for inscribed triangles with angles ≥ Θ degrees.

Paper calculates eigenvalues of a specific triangle on a sphere.

problem Computing eigenvalues of a specific triangle on a sphere.
method Computed first two Dirichlet eigenvalues and eigenfunctions of the equilateral Schwarz triangle (3/2 3/2 3/2) on the sphere.
result Computed the first two Dirichlet eigenvalues and eigenfunctions of the equilateral Schwarz triangle (3/2 3/2 3/2).

This paper shows that the Grassmann Manifolds GF(n,N)G_{\bf F}(n,N) can all be imbedded in an Euclidean space MF(N)M_{\bf F}(N) naturally and the imbedding can be realized by the eigenfunctions of Laplacian \triangle on GF(n,N)G_{\bf F}(n,N). They are all minimal submanifolds in some spheres of MF(N)M_{\bf F}(N) respectively. Using …

2006-08-03abs ↗pdf ↗

Complex hyperbolic triangle groups were first considered by Mostow in building the first nonarithmetic lattices in PU(2, 1). They are a natural generalization of the classical triangle groups acting on the hyperbolic plane. A well-known theorem of Takeuchi is that there are only finitely many Fuchsian triangle groups t…

2011-09-12abs ↗pdf ↗

New surgery exact triangles in Heegaard Floer homology for rational slopes.

problem Constructing new surgery exact triangles in Heegaard Floer homology.
method Combining combinatorial triangle and quadrilateral counting in genus 1 Heegaard diagrams.
result Solving the combinatorial problem for rational slopes, including tricky cases.

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 ↗

Study calculates eigenvalues and eigenfunctions for spherical triangles and finds fundamental gap behavior.

problem Understanding eigenvalues and gaps in spherical triangles.
method Explicit computation of Dirichlet eigenvalues and eigenfunctions for spherical lunes and triangles.
result Fundamental gap of spherical triangles increases as the angle of the lune decreases.

We show that the triangle with angles Pi/12, Pi/3 and 7*Pi/12 has the lattice property and compute this triangle's Veech group.

2011-07-25abs ↗pdf ↗

New research shows graph embeddings fail to capture key network properties.

problem Graph embeddings fail to capture salient properties of complex networks.
method Mathematical proof and empirical study of various embedding techniques.
result Any successful graph embedding must have a rank nearly linear in the number of vertices.

Two triples of triangles having pairwise disjoint outlines in 3-space are called combinatorially isotopic if one triple can be obtained from the other by a continuous motion during which the outlines of the triangles remain pairwise disjoint. We conjecture that it can be algorithmically checked if an (ordered or unorde…

2019-08-11abs ↗pdf ↗

New method proves mateability of triangle groups with Blaschke products.

problem Proving mateability of triangle groups with Blaschke products.
method Associating two piecewise analytic circle maps to the triangle group, mating these with Blaschke products, and constructing a common lift.
result Proves mateability of all cusped triangle groups with suitable Blaschke products.

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 ↗

In Lorentzian geometry, limited definition of angles restricts the use of angle bisectors in study of triangles. This paper redefines angle bisectors so that they can be used to study attributes of triangles. Using the new definition, this paper investigates the existence of the incenter and the isogonal conjugate of a…

2014-04-24abs ↗pdf ↗

Study stabilizers of complex hyperbolic triangle groups, finding generators and signatures.

problem Understanding the stabilizers of complex hyperbolic triangle groups.
method Explicit generators and signatures of stabilizers computed for each group orbit of mirrors.
result Explicit generators and signatures of stabilizers for some triangle groups.

Criterion for stopping conjugacy class enumeration in triangle groups.

problem Enumerating all conjugacy classes in cocompact triangle groups.
method Encoding by P. Dehornoy and T. Pinsky; stopping criterion based on geometric length.
result Stopping criterion for the generation of conjugacy classes in cocompact triangle groups.