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.
Short proof for ideal polygons with near optimal orthogeodesic decomposition.
Optimal Reeb graphs identified for polygon decomposition.
The abstract proves spherical surface decompositions with conical singularities.
This paper studies deformations of hyperbolic surfaces with special structures.
A finite subset S of a closed hyperbolic surface F canonically determines a "centered dual decomposition" of F: a cell structure with vertex set S, geodesic edges, and 2-cells that are unions of the corresponding Delaunay polygons. Unlike a Delaunay polygon, a centered dual 2-cell Q is not determined by its collection …
Proof of Knot Entropy Conjecture for tube lattice polygons.
The paper solves circle packings on surfaces with boundaries.
Nielsen reduction is an algorithm which decomposes any automorphism of a free group into a product of elementary Nielsen transformations. While this may be applied to a mapping class of a surface with one boundary component, the resulting decomposition in general will not have a topological interpretation. In…
The paper studies circle packings on surfaces with boundary and their total geodesic curvatures.
New methods classify convex lattice polygons for affine dimers.
The pentagram map's limit point is related to infinitesimal perturbations of polygons.
The paper studies families of curves on surfaces that realize all types of pants decompositions.
General area-preserving motion of polygonal curves is formulated as a system of ODEs. Solution polygonal curves belong to a prescribed polygonal class, which is similar to the admissible class used in the crystalline curvature flow. The ODEs are discretized implicitly in time keeping a given constant area speed while s…
Study finds finitely many non-congruent polygonal domains with same Steklov spectrum.
New property: polygons have a fixed dimension regardless of ambient space dimensions.
The paper classifies vertices in planar polygons formed by convex domains.
The Möbius energy, defined by O'Hara, is one of the knot energies, and named after the Möbius invariant property which was shown by Freedman-He-Wang. The energy can be decomposed into three parts, each of which is Möbius invariant, proved by Ishizeki-Nagasawa. Several discrete versions of Möbius energy, that is, corres…
In this paper, we discuss centroaffine geometry of polygons in -space. For a polygon that is locally convex with respect to an origin together with a transversal vector field , we define the centroaffine dual pair similarly to [6]. We prove that vertices of correspond to flattening points for …
We establish a fundamental connection between smooth and polygonal knot energies, showing that the Minimum Distance Energy for polygons inscribed in a smooth knot converges to the Moebius Energy of the smooth knot as the polygons converge to the smooth knot. However, the polygons must converge in a ``nice'' way, and th…
The pentagram map takes a planar polygon to a polygon whose vertices are the intersection points of consecutive shortest diagonals of . This map is known to interact nicely with Poncelet polygons, i.e. polygons which are simultaneously inscribed in a conic and circumscribed about a conic. A theorem of R. Sc…
Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic -metric is thus inherited from the product of the two finite dendrons via an isometric embedding. The rectangular cell complexe…
Study on Poncelet polygons' centers and circumcenters in various geometries.
The study proves analogues of the discrete isoperimetric inequality in hyperbolic geometry.
New formula for spherical polygon area via prequantization.
The map S transforms polygon sides, and almost no convex polygons remain convex.
In this article we investigate a family of nonlinear evolutions of polygons in the plane called the -polygon flow and obtain some results analogous to results for the smooth curve shortening flow: (1) any planar polygon shrinks to a point and (2) a regular polygon with five or more vertices is asymptotically stable …
The study proves a discrete Blaschke theorem for convex polygons in 2-dimensional space forms.
We study polygon spaces arising from planar configurations of necklaces with some of the beads fixed and some of the beads sliding freely. These spaces include configuration spaces of flexible polygons and some other natural polygon spaces. We characterise critical points of the oriented area function in geometric term…
Consider a convex polygon P in the plane, and denote by U a homothetical copy of the vector sum of P and (-P). Then the polygon U, as unit ball, induces a norm such that, with respect to this norm, P has constant Minkowskian width. We define notions like Minkowskian curvature, evolutes and involutes for polygons of con…
Characterizes polygonal surfaces in pseudo-hyperbolic spaces.
Maximal distortion between geodesic and Euclidean diameters in polygonal domains is studied.
Solitons are special polygon midpoints under affine transformations.
We study polygonal analogues of several moving boundary problems and their time discretization which preserves the constant area speed property. We establish various polygonal analogues of geometric formulas for moving boundaries and make use of the geometric formulas for our numerical scheme and its analysis of genera…
In this paper, we study the symplectic volume of the moduli space of polygons by using Witten's formula. We propose to use this volume as a measure for the flexibility of a polygon with fixed side-lengths. The main result of our is that among all the Spherical and Euclidean polygons with fixed perimeter the regular one…
The study connects polygon areas and projective structures in 3D space.
Fast algorithm samples confined polygons efficiently.
Researchers prove the arc complexes of decorated hyperbolic polygons are balls.
Classifies tilings of hyperbolic plane by regular polygons.
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…
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 on the space of those isometric deformations which, for conv…
We prove that, among all convex hyperbolic polygons with given angles, the perimeter is minimized by the unique polygon with an inscribed circle. The proof relies on work of J.-M.\ Schlenker.
New method finds lattice polygons that can be dissected into triangles with integer areas.
In this paper we consider planar polygons with parallel opposite sides. This type of polygons can be regarded as discretizations of closed convex planar curves by taking tangent lines at samples with pairwise parallel tangents. For this class of polygons, we define discrete versions of the area evolute, central symmetr…
We are generalizing to higher dimensions the Bavard-Ghys construction of the hyperbolic metric on the space of polygons with fixed directions of edges. The space of convex d-dimensional polyhedra with fixed directions of facet normals has a decomposition into type cones that correspond to different combinatorial types …
Solves relative isoperimetric problem on polygonal domains, focusing on corners.
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…
Paper finds optimal shapes for minimizing average lengths of billiard trajectories in specific polygons.
We develop the basic topological properties of compact polygons, i.e. of compact topological Tits buildings of rank two. It is proved that the Coxeter diagram of such a building is always crystallographic, that is, compact connected n-gons exist only for n=3,4,6. We classify compact polygons which admit a transitive gr…