Related papers: Accurate lower bounds on two-dimensional constrain…
We use boundary weights and reflection equations to obtain families of commuting double-row transfer matrices for interaction-round-a-face models with fixed boundary conditions. In particular, we consider the fusion hierarchy of the…
We study the time reversal and space inversion symmetry properties of those transfer matrices mostly used in the calculation of energy spectra and transport-process. We study the time reversal and space inversion symmetry properties of…
We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function which are valid for any low-density generator-matrix code with a given…
Specific data compression techniques, formalized by the concept of coresets, proved to be powerful for many optimization problems. In fact, while tightly controlling the approximation error, coresets may lead to significant speed up of the…
We explore how matrix bootstrap techniques can be used to constrain matrix and tensor models at finite $N$, where $N$ is the dimension of the matrix/tensor, taking a Gaussian model with a quartic interaction as example. For matrix models,…
We examine the convexity and tractability of the two-sided linear chance constraint model under Gaussian uncertainty. We show that these constraints can be applied directly to model a larger class of nonlinear chance constraints as well as…
We present a framework for upper bounding the number of iterations required by first-order optimization algorithms implementing constrained LQR controllers. We derive new bounds for the condition number and extremal eigenvalues of the…
We consider the symmetric two-state 16-vertex model on the square lattice whose vertex weights are invariant under any permutation of adjacent edge states. The vertex-weight parameters are restricted to a critical manifold which is…
Methods for calculating lower bounds to the exact energy using the variance of the upper bound energy are discussed and explored. All the matrix elements of the Hamiltonian squared are collected and considered, and those for which no known…
Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem for over 40 years. An early result by Morgenstern from 1973, provides an $\Omega(n…
For a wide class of noninteracting tight-binding models in one dimension we present an analytical solution for all scattering and edge states on a half-infinite system. Without assuming any symmetry constraints we consider models with…
We revisit the corner transfer matrix renormalization group (CTMRG) method of Nishino and Okunishi for contracting two-dimensional (2D) tensor networks and demonstrate that its performance can be substantially improved by determining the…
In the first part of this study, a convex-constrained penalized formulation was studied for a class of constant modulus (CM) problems. In particular, the error bound techniques were shown to play a vital role in providing exact penalization…
Branching can be observed at the austenite-martensite interface of martensitic phase transformations. For a model problem, Kohn and M\"uller studied a branching pattern with optimal scaling of the energy with respect to its parameters.…
A method for bounding the rate of bit-stuffing encoders for 2-D constraints is presented. Instead of considering the original encoder, we consider a related one which is quasi-stationary. We use the quasi-stationary property in order to…
Motivated by the challenge of seeking a rigorous foundation for the bulk-boundary correspondence for free fermions, we introduce an algorithm for determining exactly the spectrum and a generalized-eigenvector basis of a class of banded…
We study the problem of constructing explicit families of matrices which cannot be expressed as a product of a few sparse matrices. In addition to being a natural mathematical question on its own, this problem appears in various…
We present the first super-linear lower bounds for natural graph problems in the CONGEST model, answering a long-standing open question. Specifically, we show that any exact computation of a minimum vertex cover or a maximum independent set…
We consider (a) the partition functions of the anisotropic dimer model on the rectangular (2M-1) x (2N-1) lattice with free and cylindrical boundary conditions with a single monomer residing on the boundary and (b) the partition function of…
We study extremal and integrated correlators of half-BPS operators in four-dimensional $\mathcal{N}=2$ SQCD and $\mathcal{N}=4$ SYM with $SU(3)$ gauge group. We focus on the large R-charge sector where the number of operators insertions…