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

35810 · May 202619922001200920172026
48 results for inscribed polygons

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.

The study connects polygon areas and projective structures in 3D space.

problem Relating polygon areas and projective structures in 3D space.
method Investigates positive tuples of complete flags in R^3 and their associated polygons in RP^2.
result Establishes a relationship between Holmes-Thompson area and projective structures.

A regular nn-gon inscribing a knot is a sequence of nn points on a knot, such that the distances between adjacent points are all the same. It is shown that any smooth knot is inscribed by a regular nn-gon for any nn.

2006-10-27abs ↗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 ↗

Smooth knots with odd Conway polynomial terms have inscribed trefoils.

problem Finding inscribed trefoils for smooth knots with specific polynomial terms.
method Using a perturbation of the double-cover of the orientation class and analyzing planar configurations.
result Smooth knots with odd quadratic terms of the Conway polynomial have inscribed trefoils.

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 ↗

We prove that, among the polygons in a punctured disc with fixed angles, the perimeter is minimized by the polygon with an inscribed horocycle centered at the puncture. We generalize this to a disc with a cone point and to an annulus with a geodesic boundary component and a complete end. Then we apply this result to de…

2016-09-27abs ↗pdf ↗

New bounds on inscribed triangles in arbitrary planar domains.

problem Finding inscribed triangles in arbitrary planar domains with specific angle constraints.
method Proving the existence of uniformly fat triangles and not-too-fat triangles in bounded open sets.
result Existence of a maximal number Θ (between 0 and 60) for inscribed triangles with angles ≥ Θ degrees.

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 ↗

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 ↗

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.

Generalizing Milnor's result that an FTC (finite total curvature) knot has an isotopic inscribed polygon, we show that any two nearby knotted FTC graphs are isotopic by a small isotopy. We also show how to obtain sharper constants when the starting curve is smooth. We apply our main theorem to prove a limiting result f…

2006-06-01abs ↗pdf ↗

New elastic energy for irregular curves defined through polygonal approximations.

problem Defining elastic energy for irregular curves in any space dimension.
method Relaxation process with pp-rotation of inscribed polygonals, focusing on geometric curvature distribution.
result Energy finite if and only if curve's arc-length parameterization has second order summability.

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 ↗

Defines weak normals for irregular curves in high-dimensional spaces.

problem Dealing with irregular curves in high-dimensional Euclidean spaces.
method Using sequences of inscribed polygonals and Gram-Schmidt procedure, introduces a relaxed notion of weak normals.
result Weak normals for irregular curves are the strong limit of approximating polygonals and agree with relaxed energy.

The paper confirms conjectures about the topology of triangulated polyhedra and geodesic triangulations on spheres.

problem Topology of spaces of convex polyhedra and Delaunay triangulations on spheres.
method Variational principles on triangulated surfaces.
result Spaces of Delaunay triangulations have the same homotopy types as their smooth counterparts on the unit 2-sphere.

A planar graph is inscribable if it is combinatorial equivalent to the skeleton of a polyhedra which is inscribed in a sphere. For an inscribable graph, in its combinatorial equivalent class, if we could always find polyhedra inscribed in any given convex surface which is sufficiently close to the sphere, then we call …

2014-12-15abs ↗pdf ↗

Study introduces weak elastic energy for curves on Riemannian surfaces.

problem Detecting curvature of curves on Riemannian surfaces.
method Relaxation starting from inscribed geodesic polygonals, defined in normalized isothermal coordinates.
result Relaxed energy detects intrinsic second-order Sobolev regularity and agrees with geodesic curvature.

Duality principle for approximation of geometrical objects (also known as Eudoxus exhaustion method) was extended and perfected by Archimedes in his famous tractate "Measurement of circle". The main idea of the approximation method by Archimedes is to construct a sequence of pairs of inscribed and circumscribed polygon…

2008-11-07abs ↗pdf ↗

Study on non-orientable surfaces and inscribed rectangles in 4-manifolds.

problem Understanding non-orientable surfaces and their inscribed rectangles.
method Analyzing smooth and locally-flat non-orientable surfaces in 4-ball with specific knots, comparing results.
result Established differences between smooth and locally-flat non-orientable 4-genus of torus knots.

Study on volumes of random inscribed polytopes in projective geometries.

problem Estimating volumes of random inscribed polytopes in projective geometries.
method Central limit theorems and normal approximation for volumes and dual volumes of random inscribed polytopes.
result Established central limit theorems and normal approximation for volumes and dual volumes of random inscribed polytopes.

We study convex polyhedra in RP3\mathbb{R}\mathbb{P}^3 with all their vertices on a sphere. We do not require, in particular, that the polyhedra lie in the interior of the sphere, hence the term "weakly inscribed". Such polyhedra can be interpreted as ideal polyhedra, if we regard RP3\mathbb{R}\mathbb{P}^3 as a combinati…

2017-09-29abs ↗pdf ↗

We study convex polyhedra in three-space that are inscribed in a quadric surface. Up to projective transformations, there are three such surfaces: the sphere, the hyperboloid, and the cylinder. Our main result is that a planar graph ΓΓ is realized as the 11-skeleton of a polyhedron inscribed in the hyperboloid or cyl…

2014-10-13abs ↗pdf ↗

Sharp upper bounds on inscribed radius for metric spaces with convex boundary.

problem Bounding inscribed radius in metric measure spaces with convex boundary.
method Proves sharp upper bounds on inscribed radius for subsets with convex boundary.
result Sharp upper bounds on inscribed radius for subsets with convex boundary.

Persistent homology has emerged as a novel tool for data analysis in the past two decades. However, there are still very few shapes or even manifolds whose persistent homology barcodes (say of the Vietoris-Rips complex) are fully known. Towards this direction, let PnP_n be the boundary of a regular polygon in the plane…

2018-07-28abs ↗pdf ↗

We provide lower bounds on the number of periodic Finsler billiard trajectories inside a quadratically convex smooth closed hypersurface MM in a dd-dimensional Finsler space with possibly irreversible Finsler metric. An example of such a system is a billiard in a sufficiently weak magnetic field. The rr-periodic Fin…

2017-12-21abs ↗pdf ↗

The study proves rigidity and non-rigidity of spherical caps in mean curvature.

problem Understanding mean curvature rigidity and non-rigidity on spherical caps.
method Used a Tangency Principle to prove rigidity and constructed counterexamples for non-rigidity.
result Contrast between rigidity and non-rigidity phenomena on spherical caps.

We consider a family of embedded, mean convex hypersurfaces which evolve by the mean curvature flow. It follows from general results of White that the inscribed radius at each point on the surface is at least cH\frac{c}{H}, where cc is a constant that depends only on the initial data. Andrews recently gave a new proof…

2013-09-05abs ↗pdf ↗

The abstract shows how embeddings inscribe trapezoids or map three points to a line, proving nonexistence of certain maps.

problem Proving the nonexistence of affinely 3-regular maps in infinitely many dimensions.
method Elementary proof using embeddings and nonsingular bilinear maps.
result Recovery of nonexistence results for affinely 3-regular maps without complex algebraic techniques.