Related papers: Winding number on 3D lattice
We present a procedure to improve the lattice definition of $\mathcal N = 4$ supersymmetric Yang--Mills theory. The lattice construction necessarily involves U(1) flat directions, and we show how these can be lifted without violating the…
A new algorithm for simulating compact U(1) lattice gauge theory in three dimensions is presented which is based on global changes in the configuration space. We show that this algorithm provides an effective way to extract partition…
In this paper, we propose three approaches for the estimation of the Tucker decomposition of multi-way arrays (tensors) from partial observations. All approaches are formulated as convex minimization problems. Therefore, the minimum is…
A $d$-dimensional Ising model on a lattice torus is considered. As the size $n$ of the lattice tends to infinity, a Poisson approximation is given for the distribution of the number of copies in the lattice of any given local configuration,…
We consider SU(N) lattice gauge theory at infinite N defined on a torus with a CP invariant twist. Massless fermions are incorporated in an elegant way, while keeping them quenched. We present some numerical results which suggest that…
We use our semi-analytic solution of the nonlinear force-free field equation to construct three-dimensional magnetic fields that are applicable to the solar corona and study their statistical properties for estimating the degree of braiding…
We discuss the problem to count, or, more modestly, to estimate the number f(m,n) of unimodular triangulations of the planar grid of size $m\times n$. Among other tools, we employ recursions that allow one to compute the (huge) number of…
The TMD soft function can be obtained by formulating the Wilson line in terms of auxiliary 1-dimensional fermion fields on the lattice. In this formulation, the directional vector of the auxiliary field in Euclidean space has the form…
This paper describes a numerical formulation for calculating wave propagation with high precision in a three-dimensional system. Yee's discretization scheme is used to formulate a frequency domain method that is compatible with the…
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…
Using toric geometry, lattice theory, and elliptic surface techniques, we compute the Picard Lattice of certain K3 surfaces. In particular, we examine the generic member of each of M. Reid's list of 95 families of Gorenstein K3 surfaces…
Consider the subgraph of the discrete $d$-dimensional torus of size length $N$, $d\ge3$, induced by the range of the simple random walk on the torus run until the time $uN^d$. We prove that for all $d\ge 3$ and $u>0$, the mixing time for…
The tree code for the approximate evaluation of gravitational forces is extended and substantially accelerated by including mutual cell-cell interactions. These are computed by a Taylor series in Cartesian coordinates and in a completely…
We consider a continuous-time simple symmetric random walk on the integer lattice $\mathbb{Z}^d$ in dimension $d \geq 3$, subject to a random potential given by a field of two-sided Wiener processes. In the high-temperature regime, we prove…
Model sets are projections of certain lattice subsets. It was realised by Moody that dynamical properties of such sets are induced from the torus associated with the lattice. We follow and extend this approach by studying dynamics on the…
We study the 2D Ising model on three different types of lattices that are topologically equivalent to spheres. The geometrical shapes are reminiscent of the surface of a pillow, a 3D cube and a sphere, respectively. Systems of volumes…
Based on high precision computation of periods and lattice reduction techniques, we compute the Picard group of smooth surfaces. We also study the lattice reduction technique that is employed in order to quantify the possibility of…
We introduce Feynman-like rules to compute quivers for two loops and higher for the coloured planar $\phi^3$ theory for winding number zero. We demonstrate this for a few cases.
We exhibit algorithms for calculating Tits' buildings and orbits of vectors in a lattice $L$ for certain subgroups of $\operatorname{O}(L)$. We discuss how these algorithms can be applied to understand the configuration of boundary…
We extend the planar Pfaffian formalism for the evaluation of the Ising partition function to lattices of high topological genus g. The 3D Ising model on a cubic lattice, where g is proportional to the number of sites, is discussed in…