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.

169,341 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Sep 199319922001200920182026
48 results for plane polygons

Maps complex plane polynomials to light-like polygons in Einstein Universe.

problem Mapping between complex plane polynomials and light-like polygons.
method Constructs geometric homeomorphism between moduli spaces.
result Found minimal Lagrangian maps between ideal polygons.

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 ↗

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 ↗

Paper extends Enami-Ozeki-Yamaguchi's work on planar quadrangulations.

problem Finding the maximum number of colors for proper anti-rainbow colorings on planar quadrangulations.
method Introducing half-monochromatic colorings for plane graphs with even polygonal faces and providing an upper bound in terms of the independence number.
result An upper bound on the maximum number of colors for half-monochromatic colorings is given in terms of the independence number.

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.

Napoleon's theorem in elementary geometry describes how certain linear operations on plane polygons of arbitrary shape always produce regular polygons. More generally, certain triangulations of a polygon that tiles R^2 admit deformations which keep fixed the symmetry group of the tiling. This gives rise to isolation ph…

1999-09-18abs ↗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 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 ↗

Study examines Hilbert area of inscribed polygons in projective geometry.

problem Understanding Hilbert area of inscribed polygons in projective geometry.
method Examined correspondence between Fock-Goncharov and Cartesian coordinates, analyzed degeneration and Hilbert area of inscribed quadrilaterals, developed microlocal condition.
result Sequence of strictly convex domains with bounded Hilbert area and divergent Goldman parameters.

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.

Efficient algorithms learn geometric shapes privately with limited data.

problem Learning geometric shapes privately with minimal data.
method Differentially private algorithms for learning unions of polygons.
result Achieves (α,β)(α,β)-PAC learning and (ε,δ)(ε,δ)-differential privacy with a sample size of $ ilde{O}\left(\frac{1}{αε}k\log d ight)$.

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 constructs harmonic maps from punctured surfaces to the hyperbolic plane.

problem Harmonic maps from punctured surfaces to hyperbolic planes.
method Constructing polynomial growth harmonic maps from punctured Riemann surfaces to regular polygons in hyperbolic plane.
result Established uniqueness of harmonic maps within a class of maps differing by exponentially decaying variations.

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 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 ↗

The space of polygons up to similarity is studied using the Schwarz-Christoffel formula.

problem Understanding the space of polygons up to similarity.
method Using the Schwarz-Christoffel formula to show homeomorphism and proving embeddings for specific polygons.
result The space of labelled simple polygons up to similarity is homeomorphic to R^(2n-4) for n=3,4,5.

Harmonic maps from the plane to SO(3) are studied via integral iterations.

problem Minimal harmonic maps from the plane to SO(3) with polynomial cubic differentials.
method Fixed-point problem for integral operator, spectral networks, BPS state counts.
result Determining the asymptotic structure of gg by a convex polygon Y(P)Y(P) in RP2{\mathbb{RP}^2}.

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 ↗

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.

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 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.

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 study closed smooth convex plane curves ΓΓ enjoying the following property: a pair of points x,yx,y can traverse ΓΓ so that the distances between xx and yy along the curve and in the ambient plane do not change; such curves are called {\it bicycle curves}. Motivation for this study comes from the problem how to d…

2004-05-24abs ↗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 ↗

The geometric, topological, and symplectic properties of moduli spaces (spaces of configurations modulo rotations and translations) of polygonal linkages have been studied by Kapovich, Millson, and Kamiyama, et. al. One can form a polygonal linkage by taking two free linkages and identifying initial and terminal vertic…

2003-06-30abs ↗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 ↗