Related papers: Winding number on 3D lattice
We introduce and study a novel tensor approach for fast and accurate assembled summation of a large number of lattice-allocated potentials represented on 3D $N\times N \times N$ grid with the computational requirements only \emph{weakly…
We develop an efficient algorithmic approach for approximate counting and sampling in the low-temperature regime of a broad class of statistical physics models on finite subsets of the lattice $\mathbb Z^d$ and on the torus $(\mathbb Z/n…
The spontaneous magnetization relations for the 2D triangular and the 3D cubic lattices of the Ising model are derived by a new tractable easily calculable mathematical method. The result obtained for the triangular lattice is compared with…
A numerical method is presented which allows to compute the spectrum of the Schroedinger operator for a particle constrained on a two dimensional flat torus under the combined action of a transverse magnetic field and any conservative…
Let $G$ be a semisimple algebraic group. We develop a machinery for manipulation and manufacture of well-rounded families $\left\{ \mathcal{B}_{T}\right\} _{T>0}\subset G$ as they were defined in a work by A. Gorodnik and A. Nevo. The…
Recombining trinomial trees are a workhorse for modeling discrete-event systems in option pricing, logistics, and feedback control. Because each node stores a state-dependent quantity, a depth-$D$ tree naively yields $\mathcal{O}(3^{D})$…
We present a complex matrix gauge model defined on an arbitrary two-dimensional orientable lattice. We rewrite the model's partition function in terms of a sum over representations of the group U(N). The model solves the general…
We present a simple, accurate method for computing singular or nearly singular integrals on a smooth, closed surface, such as layer potentials for harmonic functions evaluated at points on or near the surface. The integral is computed with…
In this paper, we present and analyze a new finite difference method for computing three dimensional wave maps into spheres. By introducing the angular momentum as an auxiliary variable, we recast the governing equation as a first order…
In this paper, we propose the differentiable voxelization of 3D meshes via the winding number and solid angles. The proposed approach achieves fast, flexible, and accurate voxelization of 3D meshes, admitting the computation of gradients…
To avoid instabilities in the continuum semi-classical limit of loop quantum cosmology models, refinement of the underlying lattice is necessary. The lattice refinement leads to new dynamical difference equations which, in general, do not…
We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of Schnorr's "Factoring integers and computing discrete logarithms via diophantine…
The reduced density matrix is variationally optimized for the two-dimensional Hubbard model. Exploiting all symmetries present in the system, we have been able to study $6\times6$ lattices at various fillings and different values for the…
We discuss a number of old and new methods for computing $K\to\pi\pi$ amplitudes on the lattice. They all involve a non-perturbative determination of matching coefficients. We show how problems related to operator mixing can be greatly…
The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…
We use linear programming bounds to analyze point sets in the torus with respect to their optimality for problems in discrepancy theory and quasi-Monte Carlo methods. These concepts will be unified by introducing tensor product energies. We…
We consider a variational problem for three-dimensional (3D) classical lattice models. We construct the trial state as a two-dimensional product of local variational weights that contain auxiliary variables. We propose a stable numerical…
The standard approach for computing the trace of the inverse of a very large, sparse matrix $A$ is to view the trace as the mean value of matrix quadratures, and use the Monte Carlo algorithm to estimate it. This approach is heavily used in…
Toroidally compactified Yang-Mills theory on the lattice is studied by using the Hybrid Monte Carlo algorithm. When the compact dimensions are small, the theory naturally reduces to Yang-Mills with scalars. We confirm previous analytical…
We exhibit a simple uniruledness criterion for general orthogonal modular varieties in terms of invariants of the corresponding lattice. As an application, we obtain the uniruledness of almost all Nikulin--Vinberg moduli spaces…