Related papers: Minimal knotted polygons in cubic lattices
By performing Monte Carlo sampling of $N$-steps self-avoiding polygons embedded on different Bravais lattices we explore the robustness of universality in the entropic, metric and geometrical properties of knotted polymer rings. In…
Let C be the set of all possible quantum states. We study the convex subsets of C with attention focused on the lattice theoretical structure of these convex subsets and, as a result, find a framework capable of unifying several aspects of…
We present an improved orderly algorithm for constructing all unlabelled lattices up to a given size, that is, an algorithm that constructs the minimal element of each isomorphism class relative to some total order. Our algorithm employs a…
We consider some aspects of a standard model employed in studies of many-body localization: interacting spinless fermions with quenched disorder, for non-zero filling fraction, here on $d$-dimensional lattices. The model may be recast as an…
We review various combinatorial applications of field theoretical and matrix model approaches to equilibrium statistical physics involving the enumeration of fixed and random lattice model configurations. We show how the structures of the…
We give polynomial-time randomized algorithms for computing the girth and the cogirth of binary matroids that are low-rank perturbations of graphic matroids.
The implementation of the finite element method for linear elliptic equations requires to assemble the stiffness matrix and the load vector. In general, the entries of this matrix-vector system are not known explicitly but need to be…
Recently in joint work with E. Sert, we proved sharp boundedness results on discrete fractional integral operators along binary quadratic forms. Present work vastly enhances the scope of those results by extending boundedness to bivariate…
Lattice reduction is a NP-hard problem well known in computer science and cryptography. The Lenstra-Lenstra-Lovasz (LLL) algorithm based on the calculation of orthogonal Gram-Schmidt (GS) bases is efficient and gives a good solution in…
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…
Lattice simulations of hadronic structure are now reaching a level where they are able to not only complement, but also provide guidance to current and forthcoming experimental programmes at, e.g. Jefferson Lab, COMPASS/CERN and FAIR/GSI.…
We study the problem of decomposing (i.e. partitioning and covering) polygons into components that are $\alpha$-fat, which means that the aspect ratio of each subpolygon is at most $\alpha$. We consider decompositions without Steiner…
We perform randomized benchmarking on neutral atomic quantum bits (qubits) confined in an optical lattice. Single qubit gates are implemented using microwaves, resulting in a measured error per randomized computational gate of 1.4(1) x…
The study of the CKM matrix elements with increasing precision requires a reliable evaluation of hadronic matrix elements of axial and vector currents which can be done with Lattice QCD. The tiniest entry, |V_{ub}|, can be estimated…
An efficient scheme to compute the geometric entanglement per lattice site for quantum many-body systems on a periodic finite-size chain is proposed in the context of a tensor network algorithm based on the matrix product state…
We present a detailed study of a two-dimensional minimal lattice model for the description of mud cracking in the limit of extremely thin layers. In this model each bond of the lattice is assigned to a (quenched) breaking threshold.…
A quantum state's entanglement across a bipartite cut can be quantified with entanglement entropy or, more generally, Schmidt norms. Using only Schmidt decompositions, we present a simple iterative algorithm to maximize Schmidt norms.…
Shortest paths play an important role in mathematical modeling and image processing. Usually, shortest path problems are formulated on planar graphs that consist of vertices and weighted arcs. In this context, one is interested in finding a…
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…
The lattice Boltzmann model is a simplified kinetic method based on the particle distribution function. We use this method to simulate problems in MEMS, in which the velocity slip near the wall plays an important role. It is demonstrated…