arXiv research

New methods classify convex lattice polygons for affine dimers.

Study finds finitely many non-congruent polygonal domains with same Steklov spectrum.

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

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

The paper finds new inequalities for convex polygons.

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

Maximal distortion between geodesic and Euclidean diameters in polygonal domains is studied.

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

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 $b$ on the space of those isometric deformations which, for conv…

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…

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

We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of polygons with a marked point as embedded sub-graphs. Our main focus is on the geometr…

New findings on strong convexity in triangulations of convex polygons.

Study three discrete envelope types of polygon bisection lines.

We prove that, among all convex hyperbolic polygons with given angles, the perimeter is minimized by the unique polygon with an inscribed circle. The proof relies on work of J.-M.\ Schlenker.

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…

Study proves spectral determination of triangles and quadrilaterals, with restrictions on higher-order polygons.

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

We describe all families of star-shaped n-polygons in the Euclidean plane with prescribed perimeter and area ; they are leaves of a foliation F on the space of star-shaped n-polygons. By the way, we study some geometric properties of convex polygons, for instance their inscriptibility in a circle and their regularity i…

New method finds lattice polygons that can be dissected into triangles with integer areas.

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…

The pentagram map's limit point is related to infinitesimal perturbations of polygons.

Study strip deformations of hyperbolic polygons with decorated vertices.

Asymptotic geodesics in convex polygons are convex for large distances.

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…

Random walks and polygons are used to model polymers. In this paper we consider the extension of writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random walks and polygons over the space of configurations as a function of their length. W…

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…

Geodesics on polygons in a unit disk are studied with unique metric properties.

We construct and study a natural homeomorphism between the moduli space of polynomial cubic differentials of degree d on the complex plane and the space of projective equivalence classes of oriented convex polygons with d+3 vertices. This map arises from the construction of a complete hyperbolic affine sphere with pres…

Study examines Hilbert area of inscribed polygons in projective geometry.

Affine $λ$-equidistants of convex polygons with parallel opposite sides have applications to isoperimetric inequalities.

The equitangent locus of a convex plane curve consists of the points from which the two tangent segments to the curve have equal length. The equitangent problem concerns the relation between the curve and its equitangent locus. An equitangent n-gon of a convex curve is a circumscribed n-gon whose vertices belong to the…

The paper concerns discrete versions of the three well-known results of projective differential geometry: the four vertex theorem, the six affine vertex theorem and the Ghys theorem on four zeroes of the Schwarzian derivative. We study geometry of closed polygonal lines in $\bbRP^d$ and prove that polygons satisfying a…

New heat trace coefficients reveal curvature effects in polygonal domains.

This paper studies deformations of hyperbolic surfaces with special structures.

We give a short proof of the contractibility of the space of geodesic triangulations with fixed combinatorial type of a convex polygon in the Euclidean plane. Moreover, for any $n>0$, we show that there exists a space of geodesic triangulations of a polygon with a triangulation, whose $n$-th homotopy group is not trivi…

Fixed angles of convex polygons lead to combinatorially rich polytopes.

We obtain a sharp lower bound on the isoperimetric deficit of a general polygon in terms of the variance of its side lengths, the variance of its radii, and its deviation from being convex. Our technique involves a functional minimization problem on a suitably constructed compact manifold and is based on the spectral t…

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

A hyperbolic polygon is defined to be cyclic, horocyclic, or equidistant if its vertices lie on a metric circle, horocycle, or a component of the equidistant locus to a hyperbolic geodesic, respectively. Convex such $n$-gons are parametrized by the subspaces of $(0,\infty)^n$ that contain their side length collections,…

We present differentially private efficient algorithms for learning union of polygons in the plane (which are not necessarily convex). Our algorithms achieve $(α,β)$-PAC learning and $(ε,δ)$-differential privacy using a sample of size $\tilde{O}\left(\frac{1}{αε}k\log d\right)$, where the domain is $[d]\times[d]$ and $…

Formula connects length and correlation functions via ghost polygons and Poisson bracket.

Extends boundary estimates for Monge-Ampère equations in polygonal domains.

New algebra invariant distinguishes Legendrian knots in convex surfaces.

In a symmetric space of noncompact type X = G/K oriented geodesic segments correspond to points in the Euclidean Weyl chamber. We can hence assign vector-valued side-lengths to segments. Our main result is a system of homogeneous linear inequalities describing the restrictions on the side -lengths of closed polygons. T…

Given an iterated function system of affine dilations with fixed points the vertices of a regular polygon, we characterize which points in the limit set lie on the boundary of its convex hull.

We study closed smooth convex plane curves $Γ$ enjoying the following property: a pair of points $x,y$ can traverse $Γ$ so that the distances between $x$ and $y$ 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…

Any two equivalent discrete curves must have the same invariants at the corresponding points under an affine transformation. In this paper, we construct the moving frame and invariants for the discrete centroaffine curves, which could be used to discriminate the same discrete curves from different graphics, and estimat…