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

12253749 · Feb 202019922001200920172026
48 results for polygonal lines

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.

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 ↗

Let KK be a polygonal knot in general position with vertex set VV. A \emph{generic quadrisecant} of KK is a line that is disjoint from the set VV and intersects KK in exactly four distinct points. We give an upper bound for the number of generic quadrisecants of a polygonal knot KK in general position. This upper…

2015-02-10abs ↗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 ↗

Based on the model of the space Pol3(n)Pol_3(n) of polygons in R3R^3 with limited number of vertex, which was proposed by Jean-Claude Hausmann and Allen Knutson, and developed by several authors: Jason Cantarella, Alexander Y. Grosberg, Robert Kusner, and Clayton Shonkwiler, we prove that there exists an isometric isotopy o…

2013-08-09abs ↗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 ↗

Study of straight-line flows on a unique infinite surface.

problem Understanding straight-line flows on a specific infinite surface.
method Geometric description and characterization of periodic and drift orbits; use of rigid symmetries and Veech group.
result Complete characterization of periodic directions and proof of density of periodic and ergodic directions.

This note presents a formula for the enumerative invariants of arbitrary genus in toric surfaces. The formula computes the number of curves of a given genus through a collection of generic points in the surface. The answer is given in terms of certain lattice paths in the relevant Newton polygon. If the toric surface i…

2002-09-19abs ↗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.

Study of polygon degeneration to segments in complex space.

problem Understanding the space of polygons degenerated to segments.
method Proved L(n)\mathbb{L}(n) is a smooth submanifold, described its topology, computed geodesics, and quotiented the space.
result Found that L(n)\mathbb{L}(n) and M(n)\mathbb{M}(n) contain straight lines forming a basis of directions in their tangent spaces.

Minimal surfaces in 3-sphere created by reflections from polygons, with new examples based on pentagons.

problem Constructing minimal surfaces in 3-sphere using reflections.
method Minimal nn-gon solves free boundary problem; curvature lines combinatorics investigated.
result New examples of minimal reflection surfaces based on pentagons.

A single-vertex origami is a piece of paper with straight-line rays called creases emanating from a fold vertex placed in its interior or on its boundary. The Single-Vertex Origami Flattening problem asks whether it is always possible to reconfigure the creased paper from any configuration compatible with the metric, t…

2010-03-17abs ↗pdf ↗

Discrete analogues of ellipsoids with preserved circular cross sections.

problem Constructing discrete analogues of ellipsoids with preserved geometric properties.
method A novel discretization procedure to create discrete analogues of ellipsoids composed of planar quadrilaterals.
result Discrete analogues of ellipsoids have preserved circular cross sections and can be deformed.

The lattice stick number of a knot type is defined to be the minimal number of straight line segments required to construct a polygon presentation of the knot type in the cubic lattice. In this paper, we mathematically prove that the trefoil knot 313_1 and the figure-8 knot 414_1 are the only knot types of lattice stic…

2015-12-11abs ↗pdf ↗

A new probabilistic polygonal curve representation using Gaussian Mixture Models.

problem Capturing curves with uncertainty in both tangent and normal directions.
method Probabilistic polygonal approximation with Gaussian Mixture Model (GMM).
result The GMM accurately captures the local geometry and uncertainty of curves.

Let M^{2n} be a symplectic toric manifold with a fixed T^n-action and with a toric Kähler metric g. Abreu asked whether the spectrum of the Laplace operator ΔgΔ_g on C(M)\mathcal{C}^\infty(M) determines the moment polytope of M, and hence by Delzant's theorem determines M up to symplectomorphism. We report on some progre…

2009-08-05abs ↗pdf ↗

This work reveals a new scaling law for optimal design of multirotor aerial vehicles.

problem Designing optimal configurations for fully-actuated multirotor aerial vehicles.
method Formulated on the product manifold of Projective Lines \RP^2^N, minimizing a coordinate-invariant Log-Volume isotropy metric.
result The topology of the global optima is governed by the symmetry of the chassis, leading to a N-5 Scaling Law.

It is known that every nontrivial knot has at least two quadrisecants. Given a knot, we mark each intersection point of each of its quadrisecants. Replacing each subarc between two nearby marked points with a straight line segment joining them, we obtain a polygonal closed curve which we will call the quadrisecant appr…

2010-10-14abs ↗pdf ↗

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 show that the driving force behind the regularizing effect of Laplacian smoothing on surface elements is the popular mean ratio quality measure. We use these insights to provide natural generalizations to polygons and polyhedra. The corresponding functions measuring the quality of meshes are easily seen to be convex…

2014-06-17abs ↗pdf ↗

We consider the moduli space M_r of polygons with fixed side lengths in five-dimensional eucledian space. We analyze the local structure of its singularities and exhibit a real-analytic equivalence between M_r and a weighted quotient of the n-fold product of the quaternionic projective line HP^1 by the diagonal PSL(2,H…

2002-02-17abs ↗pdf ↗

Let KK be a knot type for which the quadratic term of the Conway polynomial is nontrivial, and let γ:RR3γ: \mathbb{R}\to \mathbb{R}^3 be an analytic Z\mathbb{Z}-periodic function with non-vanishing derivative which parameterizes a knot of type KK in space. We prove that there exists a sequence of numbers $0\leq t_1 < t…

2018-04-25abs ↗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.

The paper classifies vertices in planar polygons formed by convex domains.

problem Classifying vertices in planar polygons formed by convex domains.
method Analyzing polygons formed by homothets and translates of a convex domain.
result The number of singular boundary points in a CC-polygon is between nn and 2(n1)+m2(n-1)+m for a strictly convex domain with mm singular boundary points.

In this paper, we discuss centroaffine geometry of polygons in 33-space. For a polygon XX that is locally convex with respect to an origin together with a transversal vector field UU, we define the centroaffine dual pair (Y,V)(Y,V) similarly to [6]. We prove that vertices of (X,U)(X,U) correspond to flattening points for …

2018-12-03abs ↗pdf ↗

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…

2003-05-29abs ↗pdf ↗

The pentagram map takes a planar polygon PP to a polygon PP' whose vertices are the intersection points of consecutive shortest diagonals of PP. 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…

2019-06-25abs ↗pdf ↗

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 l1l_1-metric is thus inherited from the product of the two finite dendrons via an isometric embedding. The rectangular cell complexe…

2010-05-11abs ↗pdf ↗

Study on Poncelet polygons' centers and circumcenters in various geometries.

problem Understanding Poncelet polygons' geometric centers in different geometries.
method Analyzing the Circumcenter of Mass and Center of Mass of Poncelet polygons, proving Dan Reznik's invariants, and exploring spherical geometry.
result Proof of Dan Reznik's invariants for billiard trajectories and insights into Poncelet polygons' centers in spherical geometry.

The study proves analogues of the discrete isoperimetric inequality in hyperbolic geometry.

problem Finding the minimum perimeter for polygons with a fixed area in hyperbolic geometry.
method Proving analogues of the discrete isoperimetric inequality for cyclic and tangential polygons in hyperbolic geometry, considering both single and multiple polygons.
result Established two versions of the isoperimetric inequality for multiple polygons in hyperbolic geometry with certain area or perimeter restrictions.

The map S transforms polygon sides, and almost no convex polygons remain convex.

problem Investigating whether convex polygons remain convex under the map S.
method Analyzing the dynamics of the map S and proving properties of the set of polygons that remain convex.
result The set of polygons that remain convex under iterations of S has measure zero and is an algebraic subvariety of codimension two.

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 …

2016-10-12abs ↗pdf ↗

The study proves a discrete Blaschke theorem for convex polygons in 2-dimensional space forms.

problem Investigating curvature and circumradius constraints for convex polygons in 2-space forms.
method Defining curvature at each vertex and proving a Blaschke-type theorem.
result The circumradius of a convex polygon satisfies a specific inequality related to its vertex curvatures.

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…

2020-01-08abs ↗pdf ↗