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,742 papers · 148 categories

Trend · papers per month

51102152203 · May 202619922001200920172026
48 results for closed polygons

Paper finds optimal shapes for minimizing average lengths of billiard trajectories in specific polygons.

problem Finding optimal shapes to minimize the average length of billiard trajectories.
method Used techniques from Teichmüller theory.
result Optimal shapes minimize average lengths of billiard trajectories in specific polygons.

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 consider the expected value for the total curvature of a random closed polygon. Numerical experiments have suggested that as the number of edges becomes large, the difference between the expected total curvature of a random closed polygon and a random open polygon with the same number of turning angles approaches a …

2012-10-24abs ↗pdf ↗

Algorithm samples polygons of fixed edge lengths in any dimension.

problem Sampling random closed polygons with fixed edge lengths in any dimension.
method Weighted edge vectors on unit sphere, Möbius transformation, reweighting factors.
result Algorithm samples polygons according to standard probability measures efficiently.

In this paper we study 1/k geodesics, those closed geodesics that minimize on all subintervals of length L/kL/k, where LL is the length of the geodesic. We develop new techniques to study the minimizing properties of these curves on doubled polygons, and demonstrate a sequence of doubled polygons whose closed geodesics…

2019-09-20abs ↗pdf ↗

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…

2012-10-08abs ↗pdf ↗

A longstanding question of Gromov asks whether every one-ended word-hyperbolic group contains a subgroup isomorphic to the fundamental group of a closed hyperbolic surface. An infinite family of word-hyperbolic groups can be obtained by taking doubles of free groups amalgamated along words that are not proper powers. W…

2009-10-25abs ↗pdf ↗

A closed equilateral random walk in 3-space is a selection of unit length vectors giving the steps of the walk conditioned on the assumption that the sum of the vectors is zero. The sample space of such walks with nn edges is the (2n3)(2n-3)-dimensional Riemannian manifold of equilateral closed polygons in R3\mathbb{R}^3

2013-10-22abs ↗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 ↗

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 ↗

Let KK be a closed polygonal curve in $\RR^3$ consisting of nn line segments. Assume that KK is unknotted, so that it is the boundary of an embedded disk in $\RR^3$. This paper considers the question: How many triangles are needed to triangulate a Piecewise-Linear (PL) spanning disk of KK? The main result exhibits …

1999-06-28abs ↗pdf ↗

This paper classifies instantons with closed reductions and provides examples of non-closed reductions.

problem Understanding the geometry of toric Kähler instantons with and without closed reductions.
method Sharp geometric criteria and examples of instantons with different reduction types.
result Established geometric criteria for closed reductions and classified asymptotic geometries.

We build a new probability measure on closed space and plane polygons. The key construction is a map, given by Knutson and Hausmann using the Hopf map on quaternions, from the complex Stiefel manifold of 2-frames in n-space to the space of closed n-gons in 3-space of total length 2. Our probability measure on polygon s…

2012-06-14abs ↗pdf ↗

The study proves a discrete version of Segre's theorem for polygonal curves.

problem Proving a discrete analog of a four-vertex theorem for spherical curves.
method Using the concept of discrete tangent indicatrix of a polygon.
result A polygon with at least four vertices and a non-self-intersecting discrete tangent indicatrix has at least four flattenings.

It is known that a closed polygon P is a critical point of the oriented area function if and only if P is a cyclic polygon, that is, PP can be inscribed in a circle. Moreover, there is a short formula for the Morse index. Going further in this direction, we extend these results to the case of open polygonal chains, or…

2012-01-26abs ↗pdf ↗

In this paper we discuss some affine properties of convex equal-area polygons, which are convex polygons such that all triangles formed by three consecutive vertices have the same area. Besides being able to approximate closed convex smooth curves almost uniformly with respect to affine length, convex equal-area polygo…

2011-03-14abs ↗pdf ↗

Smooth curves from polygonal chains with vertex preservation and explicit curvature control.

problem Preserving vertices while smoothing polygonal chains to CC^{\infty} curves.
method Directional mollification operator for polygonal chains.
result Smooth curves that intersect original vertices and maintain explicit curvature bounds.

Dancing polygons and rolling balls linked via a special geometric distribution.

problem Understanding the geometric and mechanical relationship between dancing polygons and rolling balls.
method Mapping dancing polygons to trajectories of a rolling ball on a 3D surface, both described by a specific geometric distribution.
result Non-degenerate dancing pairs of polygons exist for all n6n \geq 6 and correspond to rolling ball trajectories.

We prove that the control polygon of a Bezier curve B becomes homeomorphic and ambient isotopic to B via subdivision, and we provide closed-form formulas to compute the number of iterations to ensure these topological characteristics. We first show that the exterior angles of control polygons converge exponentially to …

2012-11-02abs ↗pdf ↗

In this paper we study 1/k-geodesics, those closed geodesics that minimize on any subinterval of length L/kL/k, where LL is the length of the geodesic. We investigate the existence and behavior of these curves on doubled polygons and show that every doubled regular nn-gon admits a 1/2n1/2n-geodesic. For the doubled regu…

2019-09-20abs ↗pdf ↗

We prove the perhaps surprising result that given any three polygonal unknots in R3\R^3, then we may form the Borromean rings out of them through rigid motions of R3\R^3 applied to the individual components together with possible scaling of the components. We also prove that if at least two of the unknots are planar, t…

2014-06-12abs ↗pdf ↗

The image of a polygonal knot K under a spherical inversion of R^3 (union infinity) is a simple closed curve made of arcs of circles, having the same knot type as the mirror image of K. Suppose we reconnect the vertices of the inverted polygon with straight lines, making a new polygon. This may be a different knot type…

2006-02-21abs ↗pdf ↗

New examples show flip distance and polyhedron triangulation numbers differ, with ratio close to 3/2.

problem Understanding the relationship between flip distance and polyhedron triangulation numbers.
method Provided examples to demonstrate the difference between flip distance and polyhedron triangulation numbers.
result Ratio of flip distance to polyhedron triangulation numbers can be arbitrarily close to 3/2.

We study the variation of the Tait number of a closed space curve according to its different projections. The results are used to compute the writhe of a knot, leading to a closed formula in case of polygonal curves.

2004-06-08abs ↗pdf ↗

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 ↗

We study pairs of curves with Poncelet's porism properties and compute their vertex curves.

problem Understanding pairs of curves with Poncelet's porism properties.
method Developed formulas to compute vertex curves for given envelope curves and vice versa, for all sufficiently regular pairs of Poncelet curves.
result Formulas produce all possible sufficiently regular pairs of Poncelet curves, including sets of curves analogous to pencils of conic sections.

Cycloids, hipocycloids and epicycloids have an often forgotten common property: they are homothetic to their evolutes. But what if use convex symmetric polygons as unit balls, can we define evolutes and cycloids which are genuinely discrete? Indeed, we can! We define discrete cycloids as eigenvectors of a discrete doub…

2017-02-02abs ↗pdf ↗

Given a closed polygon P having n edges, embedded in R^d, we give upper and lower bounds for the minimal number of triangles t needed to form a triangulated PL surface in R^d having P as its geometric boundary. The most interesting case is dimension 3, where the polygon may be knotted. We use the Seifert suface constru…

2002-11-22abs ↗pdf ↗

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.

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 ↗

Graph manifolds' Thurston norms are sums of linear functionals, and every such norm can be realized.

problem Understanding Thurston norms of graph manifolds and their realizability.
method Analyzing the structure of Thurston norms as sums of linear functionals and showing realizability.
result Every Thurston norm of a graph manifold can be expressed as a sum of absolute values of linear functionals with rational coefficients.

We compute the volumes of the eigenform loci in the moduli space of genus two Abelian differentials. From this, we obtain asymptotic formulas for counting closed billiards paths in certain L-shaped polygons with barriers.

2007-05-23abs ↗pdf ↗

Study intersections of curves on translation surfaces, focusing on regular polygons and their Teichmüller disks.

problem Maximizing algebraic intersection between curves of given lengths.
method Investigate the quantity KVol defined for any closed orientable surface, focusing on regular n-gons for even n ≥ 8.
result Maximize algebraic intersection between curves of given lengths.

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.