arXiv research

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

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…

Study symmetries in smoothed polygonal links.

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…

For a polygon in Euclidean space we consider a transformation T which is obtained by applying the midpoints polygon construction twice and using an index shift. For a closed polygon this is a curve shortening process. A polygon is called (affine) soliton of the transformation T if its image under T is an affine image o…

The paper provides a converse to linking theorems for graphs in 3-space and higher dimensions.

NT probability measures knotting in 3D arc systems.

Non-trivialization probability of arc system in 3D space

We study the dynamics of the discrete bicycle (Darboux, Backlund) transformation of polygons in n-dimensional Euclidean space. This transformation is a discretization of the continuous bicycle transformation, recently studied by Foote, Levi, and Tabachnikov. We prove that the respective monodromy is a Moebius transform…

Algorithm samples polygons of fixed edge lengths in any dimension.

We describe the construction of an $\mathcal{A}_\infty$ multi-module in terms of counts of holomorphic polygons in a series Heegaard multi-diagrams. We show that this is quasi-isomorphic to the type-A bordered-sutured invariant of a link complement with a view to calculating, in the sequel, these invariants in terms of…

We present new computations of approximately length-minimizing polygons with fixed thickness. These curves model the centerlines of "tight" knotted tubes with minimal length and fixed circular cross-section. Our curves approximately minimize the ropelength (or quotient of length and thickness) for polygons in their kno…

The paper studies right-angled links on higher genus surfaces.

The study establishes conditions for groups acting on polygonal complexes to contain virtually free subgroups.

Proof of Knot Entropy Conjecture for tube lattice polygons.

The image of a polygonal knot K under a spherical inversion of R^3 (union infinity) is a simple closed curve made of arcs of circles, having the same knot type as the mirror image of K. Suppose we reconnect the vertices of the inverted polygon with straight lines, making a new polygon. This may be a different knot type…

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

The evolute of a smooth curve in an m-dimensional Euclidean space is the locus of centers of its osculating spheres, and the evolute of a spatial polygon is the polygon whose consecutive vertices are the centers of the spheres through the consecutive (m+1)-tuples of vertices of the original polygon. We study the iterat…

Solitons are special polygon midpoints under affine transformations.

Dancing polygons and rolling balls linked via a special geometric distribution.

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…

Based on the model of the space $Pol_3(n)$ of polygons in $R^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…

Nielsen reduction is an algorithm which decomposes any automorphism of a free group into a product of elementary Nielsen transformations. While this may be applied to a mapping class of a surface $S_{g,1}$ with one boundary component, the resulting decomposition in general will not have a topological interpretation. In…

Given a link in the three-sphere, Ozsváth and Szabó showed that there is a spectral sequence starting at the Khovanov homology of the link and converging to the Heegaard Floer homology of its branched double cover. The aim of this paper is to explicitly calculate this spectral sequence in terms of bordered Floer homolo…

Utilizing both twisting and writhing, we construct integral tangles with few sticks, leading to an efficient method for constructing polygonal 2-bridge links. Let L be a two bridge link with crossing number c, stick number s, and n tangles. It is shown that s is less than or equal to 2/3 c + 2n+3 . We also show that if…

The paper studies self-Bäcklund curves in centroaffine geometry using elliptic functions.

Lecture notes introduce Abelian differentials and their flat surfaces, focusing on families and Teichmüller dynamics.

Steinhaus conjectured that every closed oriented $C^1$-curve has a pair of anti-parallel tangents. Porter disproved the conjecture by showing that there exist curves with no anti-parallel tangents. Colin Adams rised the question of whether there exists a nontrivial knot in $\R^3$ which has no parallel or antiparallel t…

Rectangular mosaics extend virtual knot studies to larger polygons.

Study optimizes submatrices in 2D spaces, linking to polygon geometry.

Defines Vassiliev complexity measures for open and closed curves in 3D space.

A single-vertex origami is a piece of paper with straight-line rays called creases emanating from a fold vertex placed in its interior or on its boundary. The Single-Vertex Origami Flattening problem asks whether it is always possible to reconfigure the creased paper from any configuration compatible with the metric, t…

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

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…

We study iterations of two classical constructions, the evolutes and involutes of plane curves, and we describe the limiting behavior of both constructions on a class of smooth curves with singularities given by their support functions. Next we study two kinds of discretizations of these constructions: the curves are r…

We show that Khovanov homology and Hochschild homology theories share common structure. In fact they overlap: Khovanov homology of a $(2,n)$-torus link can be interpreted as a Hochschild homology of the algebra underlining the Khovanov homology. In the classical case of Khovanov homology we prove the concrete connectio…

New methods classify convex lattice polygons for affine dimers.

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

Paper computes link determinants using Fourier-Hadamard transforms.

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…

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.

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

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

Ethereum transition to PoS reduces energy consumption and decentralizes the network.

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…