相关论文: BFACF-style algorithms for polygons in the body-ce…

Enumerating polygons on regular lattices is a classic problem in rigorous statistical mechanics. The goal of enumerating polygons on the square lattice via fermionic path integration was achieved using a free-fermion quadratic action in the…

We propose a new embedding method which is particularly well-suited for settings where the sample size greatly exceeds the ambient dimension. Our technique consists of partitioning the space into simplices and then embedding the data points…

This work proposes an alternative approach to the so-called lattice of embedded subsets, which is included in the product of the subset and partition lattices of a finite set, and whose elements are pairs consisting of a subset and a…

Realistic 3D-conformations of protein structures can be embedded in a cubic lattice using exclusively integer numbers, additions, subtractions and boolean operations.

In this paper, we study a class of graph drawings that arise from bobbin lace patterns. The drawings are periodic and require a combinatorial embedding with specific properties which we outline and demonstrate can be verified in linear…

This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called \textit{(fully) lattice linear algorithms}. A property of these algorithms is that they…

We propose a method to non-perturbatively calculate the forward-scattering matrix elements relevant to inclusive semi-leptonic B meson decays. Corresponding hadronic structure functions at unphysical kinematics are accessible through…

We propose a first-order augmented Lagrangian algorithm (FALC) to solve the composite norm minimization problem min |sigma(F(X)-G)|_alpha + |C(X)- d|_beta subject to A(X)-b in Q; where sigma(X) denotes the vector of singular values of X,…

In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…

A general class of Newton algorithms on Gra{\ss}mann and Lagrange-Gra{\ss}mann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local quadratic convergence of the algorithm is shown under a suitable condition…

Recent works have sought to realize certain families of orthogonal, symmetric polynomials as partition functions of well-chosen classes of solvable lattice models. Many of these use Boltzmann weights arising from the trigonometric…

Lattice Boltzmann method models offer a novel framework for the simulation of high Reynolds number dilute gravity currents. The numerical algorithm is well suited to acceleration via implementation on massively parallel computer…

Convergence acceleration of flow simulations to their steady states at lower Mach numbers can be achieved via preconditioning the lattice Boltzmann (LB) schemes that alleviate the associated numerical stiffness, which have so far been…

In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…

Lattice gas algorithms (LGA) are a class of algorithms including, in chronological order, binary lattice gas cellular automata (LGCA), integer lattice gas algorithms (ILGA) and lattice Boltzmann method (LBM). They are largely used for…

Since variational symplectic integrators for the guiding center was proposed [1,2], structure-preserving geometric algorithms have become an active research field in plasma physics. We found that the slow manifolds of the classical Pauli…

We perform extensive classifications of $\mathbb{Z}_2$ quantum spin liquids on the simple cubic, body centered cubic, and face centered cubic lattices using a spin-rotation invariant fermionic projective symmetry group approach. Taking into…

In this paper, we consider polynomials associated with faces and internal quadrilaterals of a cuboctahedron and classify them under the requirement that they are consistent. These polynomials give rise to a system of partial difference…

Quantum computing holds great promise to accelerate scientific computations in fluid dynamics and other classical physical systems. While various quantum algorithms have been proposed for linear flows, developing quantum algorithms for…

Three-dimensional lattices are fundamental to solid-state physics. The description of a lattice with an atomic basis constitutes the necessary information to predict solid phase properties and evolution. Here, we present a new algorithm for…