Related papers: Note on lower estimates of multiplicities

In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…

We give a simple proof of the fact that an "$f$-estimate" for the $\bar\partial$-Neumann problem implies a lower bound on the geomatric type of the boundary along any complex one dimensional variety. The proof uses the existence of peak…

The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…

We introduce a method to lower bound an entropy-based measure of genuine multipartite entanglement via nonlinear entanglement witnesses. We show that some of these bounds are tight and explicitly work out their connection to a framework of…

This paper considers a variation of the full-information secretary problem where the random variables to be observed are independent but not necessary identically distributed. The main result is a sharp lower bound for the optimal win…

This note provides a Lefschetz theorem for Minkowski sums of polytopes, and conclude lower bound theorems for Minkowski sums of polytopes. It is written as an appendix to arXiv:1405.7368, so notation and references follow that paper.

We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the best known bounds for unbounded metric TSP problems. In…

Sharp bounds on the least eigenvalue of an arbitrary graph are presented. Necessary and sufficient (just sufficient) conditions for the lower (upper) bound to be attained are deduced using edge clique partitions. As an application, we prove…

We give an improved lower bound for the $L_2$-discrepancy of finite point sets in the unit square.

The purpose of this note is to supply an upper and a lower bound (which are in general sharp) for the $h$-vector of a level algebra which is relatively compressed with respect to any arbitrary level algebra $A$. The useful concept of…

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

We derive measurable lower bounds on concurrence of arbitrary mixed states, for both bipartite and multipartite cases. First, we construct measurable lower bonds on the purely algebraic bounds of concurrence [F. Mintert et al. (2004), Phys.…

In this short note, we employ well-known results to improve the lower bound for the constant associated with the linear term in the asymptotic expansion of the minimal logarithmic energy on the sphere.

A difference basis with respect to $n$ is a subset $A \subseteq \mathbb{Z}$ such that $A - A \supseteq \{1, \ldots, n\}$. R\'{e}dei and R\'{e}nyi showed that the minimum size of a difference basis with respect to $n$ is $(c+o(1))\sqrt{n}$…

Behavior of the entropy numbers of classes of multivariate functions with mixed smoothness is studied here. This problem has a long history and some fundamental problems in the area are still open. The main goal of this paper is to develop…

Motivated by the Matrix Spencer conjecture, we study the problem of finding signed sums of matrices with a small matrix norm. A well-known strategy to obtain these signs is to prove, given matrices $A_1, \dots, A_n \in \mathbb{R}^{m \times…

In this paper, we provide an method to obtain the lower bound on the number of the distinct maximum genus embedding of the complete bipartite graph Kn;n (n be an odd number), which, in some sense, improves the results of S. Stahl and H.…

We improve the estimates in the restriction problem in dimension $n \ge 4$. To do so, we establish a weak version of a $k$-linear restriction estimate for any $k$. The exponents in this weak $k$-linear estimate are sharp for all $k$ and…

We give a sharp lower bound to the largest possible Euclidean norm of signed sums of $n$ vectors in the plane. This is achieved by connecting the signed vector sum problem to the isoperimetric problem for the circumradius of polygons. In…

We develop new techniques for proving lower bounds on the least singular value of random matrices with limited randomness. The matrices we consider have entries that are given by polynomials of a few underlying base random variables. This…