Related papers: Winding number on 3D lattice
For a smooth map $g: X \to U(N)$, where $X$ is a three-dimensional, oriented, and closed manifold, the winding number is defined as $W_3 = \frac{1}{24\pi^2} \int_{X} \mathrm{Tr}\left[(g^{-1}dg)^3\right]$. We present a discrete formulation…
The notion of the flow introduced by Kitaev is a manifestly topological formulation of the winding number on a real lattice. First, we show in this paper that the flow is quite useful for practical numerical computations for systems without…
In this paper we implement a numerical algorithm to compute codimension-one tori in three-dimensional, volume-preserving maps. A torus is defined by its conjugacy to rigid rotation, which is in turn given by its Fourier series. The…
We prove the exponent $4/3$ for the lattice point discrepancy of a torus in $\mathbb{R}^3$ (generated by the rotation of a circle around the $z$ axis). The exponent comes from a diagonal term and it seems a natural limit for any approach…
Higher-order topological phases feature topologically protected boundary states in lower dimensions. Specifically, the zero-dimensional corner states are protected by the $d$th-order topology of a $d$-dimension system. In this work, we…
The generalized winding number is an essential part of the geometry processing toolkit, allowing to quantify how much a given point is inside a surface, even when the surface has boundaries and noise. We propose a new universal method to…
We propose a numerical variational method for three-dimensional (3D) classical lattice models. We construct the variational state as a product of local tensors, and improve it by use of the corner transfer matrix renormalization group…
In complex analysis, the winding number measures the number of times a path (counter-clockwise) winds around a point, while the Cauchy index can approximate how the path winds. We formalise this approximation in the Isabelle theorem prover,…
Three dimensional (3D) toric codes are a class of stabilizer codes with local checks and come under the umbrella of topological codes. While decoding algorithms have been proposed for the 3D toric code on a cubic lattice, there have been…
An approximate numerical approach to spin models is proposed, in which the original lattice is transformed into a tree. This method is applied to the Edwards-Anderson spin glass model in two and three dimensions. It captures the…
We consider a prototypical two-parameter family of invertible maps of $\mathbb{Z}^2$, representing rotations with decreasing rotation number. These maps describe the dynamics inside the island chains of a piecewise affine discrete twist map…
Lattice sieving in two or more dimensions has proven to be an indispensable practical aid in integer factorization and discrete log computations involving the number field sieve. The main contribution of this article is to show that a…
In this expository note we present an elementary direct rigorous definition and the simplest properties of the winding number. This definition is simpler than the one given in some textbooks. We show how to compute the winding number…
This work is concerned with the calculation of the fundamental group of torus knots. Torus knots are special types of knots which wind around a torus a number of times in the longitudinal and meridional directions. We compute and describe…
Generalized winding numbers provide a robust measure of point insidedness for 3D surfaces - whether open, self-intersecting, or non-manifold - and are central to numerous geometry processing tasks. However, existing methods trade off…
We consider the approximate recovery of multivariate periodic functions from a discrete set of function values taken on a rank-$s$ integration lattice. The main result is the fact that any (non-)linear reconstruction algorithm taking…
We propose a new method for the numerical computation of the cut locus of a compact submanifold of $\mathbb{R}^3$ without boundary. This method is based on a convex variational problem with conic constraints, with proven convergence. We…
Twist-3 partonic distributions contain important information that characterizes nucleon's structure. In this work, we show our lattice exploration of the twist-3 PDFs $g_T(x)$, and $h_L(x)$. We also present our preliminary results on the…
We present a method for computing invariant tori of dimension greater than one. The method uses a single short trajectory of a dynamical system without any continuation or initial guesses. No preferred coordinate system is required, meaning…
We show that for those lattices of Voronoi's first kind with known obtuse superbasis, a closest lattice point can be computed in $O(n^4)$ operations where $n$ is the dimension of the lattice. To achieve this a series of relevant lattice…