相关论文: Recovering the lattice from its random perturbatio…
A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…
We present a simple, accurate method for solving consistent, rank-deficient linear systems, with or without addi- tional rank-completing constraints. Such problems arise in a variety of applications, such as the computation of the…
Considering deterministic classical lattice systems with continuous variables, we show that, if the initial conditions are sampled according to a probability distribution in which the dynamical variables are statistically independent, the…
The matching between Schrodinger Functional renormalization schemes and conventional perturbative schemes is usually done using an intermediate lattice scheme. We propose to do the matching directly. This requires the perturbative…
In this article we extend the test of Hamiltonian Renormalisation proposed in this series of articles to the D-dimensional case using a massive free scalar field. The concepts we introduce are explicitly computed for the D=2 case but…
A polymer folding model on the square lattice is constructed with attractive contact interactions of strength 1/c^2, 0<c<1. The corresponding model on a dynamical random lattice, with freely fluctuating co-ordination number at each vertex,…
We consider the problem of recovering a low-multilinear-rank tensor from a small amount of linear measurements. We show that the Riemannian gradient algorithm initialized by one step of iterative hard thresholding can reconstruct an…
Consider an arbitrary $n$-dimensional lattice $\Lambda$ such that $\mathbb{Z}^n \subset \Lambda \subset \mathbb{Q}^n$. Such lattices are called {\it rational} and can always be obtained by adding $m \le n$ rational vectors to…
We propose a recursive lattice reduction framework for finding short non-zero vectors or dense sublattices of a lattice. The framework works by recursively searching for dense sublattices of dense sublattices (or their duals) with…
We produce a hierarchiy of integrable equations by systematically adding terms to the Lax pair for the lattice modified KdV equation. The equations in the hierarchy are related to one aonother by recursion relations. These recursion…
In this paper we consider the following real-valued and finite dimensional specific instance of the 1-D classical phase retrieval problem. Let ${\bf F}\in\mathbb{R}^N$ be an $N$-dimensional vector, whose discrete Fourier transform has a…
In this article the linear Boltzmann equation is derived for a particle interacting with a Gaussian random field, in the weak coupling limit, with renewal in time of the random field. The initial data can be chosen arbitrarily. The proof is…
Contact interactions can be used to describe a system of particles at unitarity, contribute to the leading part of nuclear interactions and are numerically non-trivial because they require a proper regularization and renormalization scheme.…
Variational minimization of tensor network states enables the exploration of low energy states of lattice gauge theories. However, the exact numerical evaluation of high-dimensional tensor network states remains challenging in general. In…
The burning number of a graph is the minimal number of steps that are needed to burn all of its vertices, with the following burning procedure: at each step, one can choose a point to set on fire, and the fire propagates constantly at unit…
We consider a phase retrieval problem, where we want to reconstruct a $n$-dimensional vector from its phaseless scalar products with $m$ sensing vectors, independently sampled from complex normal distributions. We show that, with a suitable…
We study the problem of recovering a globally consistent Euclidean embedding of data, given only a local distance graph and propose a method that optimally represents these distances. The method operates solely on a neighborhood graph…
For a periodically driven quantum system an effective time-independent Hamiltonian is derived with an eigen-energy spectrum, which in the regime of large driving frequencies approximates the quasi-energies of the corresponding Floquet…
A model for quantum gravity in one (time) dimension is discussed, based on Regge's discrete formulation of gravity. The nature of exact continuous lattice diffeomorphisms and the implications for a regularized gravitational measure are…
The advantage of simulating lattice field theory with quantum computers is hamstrung by the limited resources that induce large errors from finite volume and sizable lattice spacings. Previous work has shown how classical simulations near…