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

19385675 · May 202619922001200920172026
48 results for Euclidean polygons

Maximal distortion between geodesic and Euclidean diameters in polygonal domains is studied.

problem Maximal ratio of geodesic to Euclidean diameters in polygonal domains with holes.
method Analyzes convex polygons with holes, using geometric triangulations as a comparison.
result The supremum of the ratio is between Ω(h1/3)Ω(h^{1/3}) and O(h1/2)O(h^{1/2}) for convex polygons.

The paper connects polygon spaces with quotient spaces using spin actions and normed division algebras.

problem Understanding correspondences between polygon spaces and quotient spaces.
method Introducing Hopf maps and spin actions on normed division algebras to construct correspondences.
result Extension of polygon space correspondences to higher dimensions and normed division algebras.

We describe all families of star-shaped n-polygons in the Euclidean plane with prescribed perimeter and area ; they are leaves of a foliation F on the space of star-shaped n-polygons. By the way, we study some geometric properties of convex polygons, for instance their inscriptibility in a circle and their regularity i…

2019-02-12abs ↗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 ↗

We introduce an approach based on moving frames for polygon recognition and symmetry detection. We present detailed algorithms for recognition of polygons modulo the special Euclidean, Euclidean, equi-affine, skewed-affine and similarity Lie groups, and explain the procedure for a generic Lie group. The time complexity…

2000-11-17abs ↗pdf ↗

For a polygon in Euclidean space we consider a transformation T which is obtained by applying the midpoints polygon construction twice and using an index shift. For a closed polygon this is a curve shortening process. A polygon is called (affine) soliton of the transformation T if its image under T is an affine image o…

2015-08-28abs ↗pdf ↗

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 ↗

The evolute of a smooth curve in an m-dimensional Euclidean space is the locus of centers of its osculating spheres, and the evolute of a spatial polygon is the polygon whose consecutive vertices are the centers of the spheres through the consecutive (m+1)-tuples of vertices of the original polygon. We study the iterat…

2016-11-27abs ↗pdf ↗

The paper proves rigidity of bordered polyhedral surfaces using variational principles.

problem Determining the rigidity of bordered polyhedral surfaces.
method Using the variational principle, the paper shows that bordered polyhedral surfaces are determined by boundary values and discrete curvatures on interior edges.
result The paper re-proves the classical result that two Euclidean or hyperbolic cyclic polygons are congruent if their side lengths are equal.

It is known that the space of convex polygons in the Euclidean plane with fixed normals, up to homotheties and translations, endowed with the area form, is isometric to a hyperbolic polyhedron. In this note we show a class of convex polygons in the Lorentzian plane such that their moduli space, if the normals are fixed…

2011-11-15abs ↗pdf ↗

We give a short proof of the contractibility of the space of geodesic triangulations with fixed combinatorial type of a convex polygon in the Euclidean plane. Moreover, for any n>0n>0, we show that there exists a space of geodesic triangulations of a polygon with a triangulation, whose nn-th homotopy group is not trivi…

2019-10-07abs ↗pdf ↗

Study reveals a universal formula for knotting in random equilateral polygons.

problem Probability of knotting in equilateral random polygons.
method Extensive Monte Carlo simulations with improved algorithms and knot invariants.
result A universal scaling formula for knotting probability with number of edges, involving exponential and power law factors.

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.

In this thesis we deal with spectral invariants for polygons and closed orbisurfaces of constant Gaussian curvature. In each case our method is to study the heat kernel and the asymptotic expansion of the heat trace. First, we investigate hyperbolic polygons, i.e. relatively compact domains in the hyperbolic plane with…

2017-11-09abs ↗pdf ↗

Paper constructs motifs from planar tilings for DP weaves and polycatenanes.

problem Creating complex entangled structures from periodic tilings.
method Combinatorial methodology using polygonal link transformations.
result Predicting the type of motif from a given tiling and polygonal link method.

The functional determinant of an elliptic operator with positive, discrete spectrum may be defined as eZ(0)e^{-Z'(0)}, where Z(s)Z(s), the zeta function, is the sum nλns\sum_n^{\infty} λ_n^{-s} analytically continued to ss around the origin. In this paper Z(0)Z'(0) is calculated for the Laplace operator with Dirichlet boundary…

1993-04-08abs ↗pdf ↗

Defines weak normals for irregular curves in high-dimensional spaces.

problem Dealing with irregular curves in high-dimensional Euclidean spaces.
method Using sequences of inscribed polygonals and Gram-Schmidt procedure, introduces a relaxed notion of weak normals.
result Weak normals for irregular curves are the strong limit of approximating polygonals and agree with relaxed energy.

We study the dynamics of the discrete bicycle (Darboux, Backlund) transformation of polygons in n-dimensional Euclidean space. This transformation is a discretization of the continuous bicycle transformation, recently studied by Foote, Levi, and Tabachnikov. We prove that the respective monodromy is a Moebius transform…

2012-11-10abs ↗pdf ↗

Let CC be a smooth, convex curve on either the sphere S2\mathbb{S}^{2}, the hyperbolic plane H2\mathbb{H}^{2} or the Euclidean plane E2\mathbb{E}^{2}, with the following property: there exists αα, and parameterizations x(t),y(t)x(t), y(t) of CC such that for each tt, the angle between the chord connecting x(t)x(t) to y(t)y(t)

2013-11-04abs ↗pdf ↗

We apply Garnier's method to solve the Plateau problem for maximal surfaces in Minkowski 3-space. Our study relies on the improved version we gave of R. Garnier's resolution of the Plateau problem for polygonal boundary curves in Euclidean 3-space. Since in Minkowski space the method does not allow us to avoid the exis…

2010-12-16abs ↗pdf ↗

Given a flag in each of the vertex-transitive tessellations of the Euclidean plane by regular polygons, we determine the flag stabilizer under the action of the automorphism group of a regular cover. In so doing we give a presentation of these tilings as quotients of regular (infinite) polyhedra.

2009-10-22abs ↗pdf ↗

New method constructs tilings of the plane using directed edges and alignments.

problem Modeling tilings of the Euclidean or hyperbolic plane as presheaves over categories.
method Introducing finite categories for polygons with labeled directed edges, constructing reflective alignments.
result Characterizing alignments of tilings by comparing edge directions and generating families with elegant symmetry.

We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, {\sc unknotting problem} is in {\bf NP}. We also consider the problem, {\sc unknotting probl…

1998-07-03abs ↗pdf ↗

A hex sphere is a singular Euclidean sphere with four cone points whose cone angles are (integer) multiples of 2π3\frac{2π}{3} but less than 2π. We prove that the Moduli space of hex spheres of unit area is homeomorphic to the the space of similarity classes of Voronoi polygons in the Euclidean plane. This result give…

2010-10-25abs ↗pdf ↗

We show that the problem of tiling the Euclidean plane with a finite set of polygons (up to translation) boils down to prove the existence of zeros of a non-negative convex function defined on a finite-dimensional simplex. This function is a generalisation, in the framework of branched surfaces, of the Thurston semi-no…

2012-05-23abs ↗pdf ↗

I show that every rectifiable simple closed curve in the plane can be continuously deformed into a convex curve in a motion which preserves arc length and does not decrease the Euclidean distance between any pair of points on the curve. This result is obtained by approximating the curve with polygons and invoking the r…

2008-09-08abs ↗pdf ↗

We prove that every finite-volume hyperbolic 3-manifold M with p > 0 cusps admits a canonical, complete, piecewise Euclidean CAT(0) metric, with a canonical projection to a CAT(0) spine K. Moreover, (a) the universal cover of M endowed with the CAT(0) metric is a union of Euclidean half-spaces, glued together by identi…

2010-08-09abs ↗pdf ↗

The paper studies self-Bäcklund curves in centroaffine geometry using elliptic functions.

problem Understanding self-Bäcklund curves in centroaffine geometry.
method Description of general properties and detailed analysis using elliptic functions.
result Provides a detailed description of self-Bäcklund centroaffine curves in terms of elliptic functions.

New methods classify convex lattice polygons for affine dimers.

problem Not all convex lattice polygons are characteristic polygons of affine dimers.
method General constructions and algorithm for finding affine dimers with prescribed polygons.
result All lattice triangles, generalised parallelograms, and polygons of genus at most two admit an affine dimer.

The pentagram map's limit point is related to infinitesimal perturbations of polygons.

problem Understanding the limit point of the pentagram map and its relation to polygon perturbations.
method Interpreting Glick's operator as the infinitesimal monodromy of a polygon.
result Glick's operator measures the extent to which a perturbed polygon does not close up.

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 study the space $\nua{m}{d}$ of clouds in $\bbr^d$ (ordered sets of mm points modulo the action of the group of affine isometries). We show that $\nua{m}{d}$ is a smooth space, stratified over a certain hyperplane arrangement in $\bbr^m$. We give an algorithm to list all the chambers and other strata (this is indep…

2002-07-12abs ↗pdf ↗

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.