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.

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

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

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

Tropical geometry and weighted lattices improve curve and surface fitting.

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…

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

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

Paper constructs motifs from planar tilings for DP weaves and polycatenanes.

Transformed geometry into algebra to prove Pick's theorem efficiently.

The paper defines and studies discrete p-density and compression-radius profiles of lattice knots.

The paper establishes a formula for enumeration of curves of arbitrary genus in toric surfaces. It turns out that such curves can be counted by means of certain lattice paths in the Newton polygon. The formula was announced earlier in http://arxiv.org/abs/math.AG/0209253. The result is established with the help of the …

Study on entanglement complexity of confined ring polymers in lattice tubes.

Motivated by the study of billiards in polygons, we prove fine results for the distribution of gaps of directions of saddle connections on translation surfaces. As an application we prove that for almost every holomorphic differential $ω$ on a Riemann surface of genus $g \geq 2$ the smallest gap between saddle connecti…

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…

The number of closed billiard trajectories in a rational-angled polygon grows quadratically in the length. This paper gives an analogue on K3 surfaces, by considering special Lagrangian tori. The analogue of the angle of a billiard trajectory is a point on a twistor sphere, and the number of directions admitting a spec…

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

General area-preserving motion of polygonal curves is formulated as a system of ODEs. Solution polygonal curves belong to a prescribed polygonal class, which is similar to the admissible class used in the crystalline curvature flow. The ODEs are discretized implicitly in time keeping a given constant area speed while s…

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

Study of polygon spaces, characterizing critical points of area function.

New property: polygons have a fixed dimension regardless of ambient space dimensions.

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

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 $l_1$-metric is thus inherited from the product of the two finite dendrons via an isometric embedding. The rectangular cell complexe…

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…

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

Optimal Reeb graphs identified for polygon decomposition.

Study on Poncelet polygons' centers and circumcenters in various geometries.

The study proves analogues of the discrete isoperimetric inequality in hyperbolic geometry.

New formula for spherical polygon area via prequantization.

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

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 …

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

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…

Investigates dual foliations of polygon spaces based on area and perimeter.

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

Characterizes polygonal surfaces in pseudo-hyperbolic spaces.

Solitons are special polygon midpoints under affine transformations.

Short proof for ideal polygons with near optimal orthogeodesic decomposition.

We study polygonal analogues of several moving boundary problems and their time discretization which preserves the constant area speed property. We establish various polygonal analogues of geometric formulas for moving boundaries and make use of the geometric formulas for our numerical scheme and its analysis of genera…