arXiv research

New methods classify convex lattice polygons for affine dimers.

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

The study examines knot probabilities in confined lattice polygons.

Proof of Knot Entropy Conjecture for tube lattice polygons.

Researchers calculate complexity of billiard paths in regular polygons.

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…

A tiling of the sphere by triangles, squares, or hexagons is convex if every vertex has at most 6, 4, or 3 polygons adjacent to it, respectively. Assigning an appropriate weight to any tiling, our main result is explicit formulas for the weighted number of convex tilings with a given number of tiles. To prove these for…

Study on knotting in very long polymer chains, finding Poisson distribution for prime knot types.

Tropical Geometry and Mathematical Morphology share the same max-plus and min-plus semiring arithmetic and matrix algebra. In this chapter we summarize some of their main ideas and common (geometric and algebraic) structure, generalize and extend both of them using weighted lattices and a max-$\star$ algebra with an ar…

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.

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…

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.

The Phi- relationship also known as Phi-factor appears in a number of lattice structures, mostly considering the lines within several separate circles or polygons. The paper considers a regular hexagonal tessellation as a lattice with the highest specific mechanical stiffness.

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 $3_1$ and the figure-8 knot $4_1$ are the only knot types of lattice stic…

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…

We show that discrete $W_m$ lattices are bi-Hamiltonian, using geometric realizations of discretizations of the Adler-Gel'fand-Dikii flows as local evolutions of arc length-parametrized polygons in centro-affine space. We prove the compatibility of two known Hamiltonian structure defined on the space of geometric invar…

We show that two uniform lattices of a regular right-angled Fuchsian building are commensurable, provided the chamber is a polygon with at least six edges. We show that in an arbitrary Gromov-hyperbolic regular right-angled building associated to a graph product of finite groups, a uniform lattice is commensurable with…

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…

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…

Knots and links have been considered to be useful models for structural analysis of molecular chains such as DNA and proteins. One quantity that we are interested on molecular links is the minimum number of monomers necessary to realize them. In this paper we consider every link in the cubic lattice. Lattice stick numb…

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.

The study explores maps of 2- and 3-uniform tilings on the torus.

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…

Discrete knot theory models use lattice-filtered graphs to detect merging knot components.

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…