Related papers: Winding number on 3D lattice
We present a freely downloadable software package for modelling the dynamics of galaxies, which we call the Torus Mapper (TM). The package is based around `torus mapping', which is a non-perturbative technique for creating orbital tori for…
We construct a singular minimizing map ${\bf u}$ from $\mathbb{R}^3$ to $\mathbb{R}^2$ of a smooth uniformly convex functional of the form $\int_{B_1} F(D{\bf u})\,dx$.
This study presents a novel algorithm based on graph theory for the precise segmentation and measurement of detonation cells from 3D pressure traces, termed detonation lattices, addressing the limitations of manual and primitive 2D edge…
Interfacial Stokes flow can be efficiently computed using the Boundary Integral Equation method. In 3D, the fluid velocity at a target point is given by a 2D surface integral over all interfaces, thus reducing the dimension of the problem.…
We document Fortran MPI checkerboard code for Markov Chain Monte Carlo simulations of pure SU(3) lattice gauge theory with the Wilson action on a D-dimensional double-layered torus. This includes the usual torus with periodic boundary…
A lattice gauge theory is described by a redundantly large vector space that is subject to local constraints, and can be regarded as the low energy limit of an extended lattice model with a local symmetry. We propose a numerical…
The Witten index for certain supersymmetric lattice models treated by de Boer, van Eerten, Fendley, and Schoutens, can be formulated as a topological invariant of simplicial complexes arising as independence complexes of graphs. We prove a…
Tensor network states provide an efficient class of states that faithfully capture strongly correlated quantum models and systems in classical statistical mechanics. While tensor networks can now be seen as becoming standard tools in the…
This paper presents an algorithm for computing the contraction of two-dimensional tensor networks on a square lattice; and we combine it with solving congruence equations to compute the exact enumeration (including weighted enumeration) of…
We show that there is a polynomial-time algorithm with approximation guarantee $\frac{3}{2}+\epsilon$ for the $s$-$t$-path TSP, for any fixed $\epsilon>0$. It is well known that Wolsey's analysis of Christofides' algorithm also works for…
We study the entropy of a set of identical hard objects, of general shape, with each object pivoted on the vertices of a d-dimensional regular lattice of lattice spacing a, but can have arbitrary orientations. When the pivoting point is…
We present a simple new algorithm for finding a Tarski fixed point of a monotone function $F : [N]^3 \rightarrow [N]^3$. Our algorithm runs in $O(\log^2 N)$ time and makes $O(\log^2 N)$ queries to $F$, matching the $\Omega(\log^2 N)$ query…
We propose a modified form of a tensor renormalization group algorithm for evaluating partition functions of classical statistical mechanical models on 2D lattices. This algorithm coarse-grains only the rows and columns of the lattice…
After briefly reviewing the potential for the $N$-flavor Thirring model, formulated with reducible fermions in 2+1$d$, to exhibit a strongly-coupled UV-stable fixed point where U($2N$) symmetry is spontaneously broken by a fermion bilinear…
We study numerical integration of smooth functions defined over the $s$-dimensional unit cube. A recent work by Dick et al. (2019) has introduced so-called extrapolated polynomial lattice rules, which achieve the almost optimal rate of…
In this work, we propose a novel method for robust single rotation averaging that can efficiently handle an extremely large fraction of outliers. Our approach is to minimize the total truncated least unsquared deviations (TLUD) cost of…
High dimensional integrals are abundant in many fields of research including quantum physics. The aim of this paper is to develop efficient recursive strategies to tackle a class of high dimensional integrals having a special product…
We investigate a tree-level O(a^3)-accurate action, D234c, on coarse lattices. For the improvement terms we use tadpole-improved coefficients, with the tadpole contribution measured by the mean link in Landau gauge. We measure the hadron…
Counting integer solutions of linear constraints has found interesting applications in various fields. It is equivalent to the problem of counting lattice points inside a polytope. However, state-of-the-art algorithms for this problem…
Echeverria recently introduced an invariant for a smoothly embedded torus in a homology $S^1\times S^3$, using gauge theory for singular connections. We define a new topological invariant of such an embedded torus, analogous to the…