Related papers: Vertex distortion of lattice knots
Consider a point process in Euclidean space obtained by perturbing the integer lattice with independent and identically distributed random vectors. Under mild assumptions on the law of the perturbations, we construct a translation-invariant…
We show that the L^2-torsion and the von Neumann rho-invariant give rise to commensurability invariants of knots.
The Lorentz symmetry and the space and time translational symmetry are fundamental symmetries of nature. Crystals are the manifestation of the continuous space translational symmetry being spontaneously broken into a discrete one. We argue…
Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…
The stick number and the edge length of a knot type in the simple hexagonal lattice (sh-lattice) are the minimal numbers of sticks and edges required, respectively, to construct a knot of the given type in sh-lattice. By introducing a…
The stick index of a knot is the least number of line segments required to build the knot in space. We define two analogous 2-dimensional invariants, the planar stick index, which is the least number of line segments in the plane to build a…
The main aim of the present note is to consider bounded orthomorphisms between locally solid vector lattices. We establish a version of the remarkable Zannen theorem regarding equivalence between orthomomorphisms and the underlying vector…
The warping sum $e(K)$ of a knot $K$ is the minimal value of the sum of the warping degrees of a minimal diagram of $K$ with both orientations. In this paper, knots $K$ with $e(K) \le 3$ are characterized, and some knots $K$ with $e(K)=4$…
Topological defects in crystalline lattices are considered. In relation to physical realizability of such defects, criteria for geometric compatibility of the lattice distortions are formulated. For 2D lattices it is shown that the answer…
The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…
Squeezed knots are those knots that appear as slices of genus-minimizing oriented smooth cobordisms between positive and negative torus knots. We show that this class of knots is large and discuss how to obstruct squeezedness. The most…
We show that the flat chaotic analytic zero points (i.e. zeroes of a random entire function whose Taylor coefficients are independent complex-valued Gaussian random variables, and the variance of the k-th coefficient is 1/k!) can be…
Every classical or virtual knot is equivalent to the unknot via a sequence of extended Reidemeister moves and the so-called forbidden moves. The minimum number of forbidden moves necessary to unknot a given knot is an invariant we call the…
Given a connected cobordism between two knots in the 3-sphere, our main result is an inequality involving torsion orders of the knot Floer homology of the knots, and the number of local maxima and the genus of the cobordism. This has…
We derive a sharp scaling law for deviations of edge-isoperimetric sets in the lattice $\mathbb Z^d$ from the limiting Wulff shape in arbitrary dimensions. As the number $n$ of elements diverges, we prove that the symmetric difference to…
The warping degree of an oriented knot diagram is the minimal number of crossings which we meet as an under-crossing first when we travel along the diagram from a fixed point. The warping degree of a knot projection is the minimal value of…
We show that the degree of a graded lattice ideal of dimension 1 is the order of the torsion subgroup of the quotient group of the lattice. This gives an efficient method to compute the degree of this type of lattice ideals.
The main purpose of this paper is to study the lattice structure of variable precision rough sets. The notion of variation in precision of rough sets have been further extended to variable precision rough set with variable classification…
A digraph $D$ is an oriented graph if $D$ does not have a pair of opposite arcs. The degree of a vertex $v$ of $D$ is the sum of the in-degree and out-degree of $v.$ Let $fvs(D)$ be the minimum number of vertices whose deletion from $D$…
The dynamics of dislocations in a two-dimensional vortex lattice is studied in the presence of a pinning potential and a transport current. In a vortex lattice drifting with velocity $v$ a glide velocity $V_d$ of the dislocation with…