Abstract. The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and...
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For several dimensions it yields improved upper bounds including some new bounds on...
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...