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

113225338450 · Jun 202019922001200920172026
48 results for Polygonal complexes

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 ↗

This paper studies deformations of hyperbolic surfaces with special structures.

problem Infinitesimal deformations of hyperbolic surfaces with boundary and ideal vertices.
method Description of the admissible cone of deformations in terms of the arc complex.
result Realization of the admissible cone and its faces as arc complexes for specific surface families.

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.

The study establishes conditions for groups acting on polygonal complexes to contain virtually free subgroups.

problem Conditions for groups acting on polygonal complexes to contain virtually free subgroups.
method Analysis of links of polygonal complexes and conditions on their structure.
result Groups acting on polygonal complexes with certain link conditions contain virtually free subgroups.

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 ↗

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.

Deroin and Tholozan's representations are mapped to complex projective space via action-angle coordinates.

problem Mapping representations of a punctured sphere into PSL(2,R)\mathrm{PSL}(2,\mathbb R) to a simpler geometric space.
method Polygonal model and chains of triangles to extract action-angle coordinates.
result Action-angle coordinates give an explicit isomorphism and almost global Darboux coordinates.

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 ↗

We prove some recent experimental observations of D. Reznik concerning periodic billiard orbits in ellipses. For example, the sum of cosines of the angles of a periodic billiard polygon remains constant in the one-parameter family of such polygons (that exist due to the Poncelet porism). In our proofs, we use geometric…

2020-01-09abs ↗pdf ↗

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 ↗

We study complete minimal graphs in HxR, which take asymptotic boundary values plus and minus infinity on alternating sides of an ideal inscribed polygon Γ in H. We give necessary and sufficient conditions on the "lenghts" of the sides of the polygon (and all inscribed polygons in Γ) that ensure the existence…

2007-01-19abs ↗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.

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.

The embedded contact homology (ECH) of a 3-manifold with a contact form is a variant of Eliashberg-Givental-Hofer's symplectic field theory, which counts certain embedded J-holomorphic curves in the symplectization. We show that the ECH of T^3 is computed by a combinatorial chain complex which is generated by labeled c…

2004-10-04abs ↗pdf ↗

We study the Hamiltonian vector field v=(f/w,f/z)v=(-\partial f/\partial w,\partial f/\partial z) on C2\mathbb C^2, where f=f(z,w)f=f(z,w) is a polynomial in two complex variables, which is non-degenerate with respect to its Newton's polygon. We introduce coordinates in four-dimensional neighbourhoods of the "points at infinity", in …

2011-07-11abs ↗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 ↗

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 ↗

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…

2014-06-12abs ↗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 ↗

Characterizes polygonal surfaces in pseudo-hyperbolic spaces.

problem Understanding polygonal surfaces in pseudo-hyperbolic spaces.
method Characterizes polygonal surfaces by total curvature finiteness and asymptotic flatness, using comparison of ideal boundaries.
result Polygonal surfaces have parabolic type and polynomial quartic differential.

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.