Related papers: Lattice based integration algorithms: Kronecker se…
In numerical analysis it is often necessary to estimate the condition number $CN(T)=||T||_{} \cdot||T^{-1}||_{}$ and the norm of the resolvent $||(\zeta-T)^{-1}||_{}$ of a given $n\times n$ matrix $T$. We derive new spectral estimates for…
We present exact mixed-integer linear programming formulations for verifying the performance of first-order methods for parametric quadratic optimization. We formulate the verification problem as a mixed-integer linear program where the…
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…
In this paper we are concerned with three lattice problems: the lattice packing problem, the lattice covering problem and the lattice packing-covering problem. One way to find optimal lattices for these problems is to enumerate all finitely…
Lattice systems with certain Lie algebraic or quantum Lie algebraic symmetries are constructed. These symmetric models give rise to series of integrable systems. As examples the $A_n$-symmetric chain models and the SU(2)-invariant ladder…
Quantum lattice models with large local Hilbert spaces emerge across various fields in quantum many-body physics. Problems such as the interplay between fermions and phonons, the BCS-BEC crossover of interacting bosons, or decoherence in…
We present a natural reverse Minkowski-type inequality for lattices, which gives upper bounds on the number of lattice points in a Euclidean ball in terms of sublattice determinants, and conjecture its optimal form. The conjecture exhibits…
We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming…
An extension of the synchronous parallel kinetic Monte Carlo (pkMC) algorithm developed by Martinez {\it et al} [{\it J.\ Comp.\ Phys.} {\bf 227} (2008) 3804] to discrete lattices is presented. The method solves the master equation…
Problems related to projections on closed convex cones are frequently encountered in optimization theory and related fields. To study these problems, various unifying ideas have been introduced, including asymmetric vector-valued norms and…
Nonconvex optimization problems with an L1-constraint are ubiquitous, and are found in many application domains including: optimal control of hybrid systems, machine learning and statistics, and operations research. This paper shows that…
Cocompactness is a useful weaker counterpart of compactness in the study of imbeddings between function spaces. In this paper we show that subcritical continuous imbeddings of fractional Sobolev spaces and Besov spaces over \mathbb{R}^{N}…
In this article, we study the convergence of algorithms for solving monotone inclusions in the presence of adjoint mismatch. The adjoint mismatch arises when the adjoint of a linear operator is replaced by an approximation, due to…
In this article, via certain lower bound conditions on the measures under consideration, the authors fully characterize the Sobolev embeddings for the scales of Haj{\l}asz-Triebel-Lizorkin and Haj{\l}asz-Besov spaces in the general context…
It is natural to expect the following loosely stated approximation principle to hold: a numerical approximation solution should be in some sense as smooth as its target exact solution in order to have optimal convergence. For piecewise…
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…
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…
In this article we revisit smoothing bounds in parallel between lattices $and$ codes. Initially introduced by Micciancio and Regev, these bounds were instantiated with Gaussian distributions and were crucial for arguing the security of many…
We study a class of rearrangement problems under a novel pick-n-swap prehensile manipulation model, in which a robotic manipulator, capable of carrying an item and making item swaps, is tasked to sort items stored in lattices of variable…
We introduce the concept of strong high-order approximate minimizers for nonconvex optimization problems. These apply in both standard smooth and composite non-smooth settings, and additionally allow convex or inexpensive constraints. An…