Related papers: Note on lower estimates of multiplicities

We give a new lower bound for the discrete norm of a polynomial on the circle

We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P of Z[X_1,...,X_k] over the standard simplex, assuming that m>0. Recent algorithmic developments in real algebraic geometry enable us to obtain a…

We consider the least singular value of a large random matrix with real or complex i.i.d. Gaussian entries shifted by a constant $z\in\mathbb{C}$. We prove an optimal lower tail estimate on this singular value in the critical regime where…

We give a lower bound of $\Omega(\sqrt n)$ on the unambiguous randomised parity-query complexity of the approximate majority problem -- that is, on the lowest randomised parity-query complexity of any function over $\{0,1\}^n$ whose value…

Algebraic surfaces in the complex projective space with a high number of A-type singularities have been presented in a recent paper. We extend the construction in order to obtain lower bounds for the maximal number of A singularities for…

Let $\varepsilon >0$. Let $f$ be a Steinhaus or Rademacher random multiplicative function. We prove that we have almost surely, as $x \to +\infty$, $$ \sum_{n \leqslant x} f(n) \ll \sqrt{x} (\log_2 x)^{\frac{3}{4}+ \varepsilon}. $$

In this paper we present a lower bound for the minimal dimension $\mu(\mathfrak{n})$ of a faithful representation of a finite dimensional $p$-step nilpotent Lie algebra $\mathfrak{n}$ over a field of characteristic zero. Our bound is given…

We give a lower bound on the probability of error in quantum state discrimination. The bound is a weighted sum of the pairwise fidelities of the states to be distinguished.

In this note we give a new lower bound on the virtual crossing number via the writhe polynomial, which refines a result of B. Mellor. The proof is based on a new interpretation of the writhe polynomial. The characterization of the writhe…

We give new lower bounds for $L^p$ estimates of the Schr\"odinger maximal function by generalizing an example of Bourgain.

We consider the problem of estimating the volume of a compact domain in a Euclidean space based on a uniform sample from the domain. We assume the domain has a boundary with positive reach. We propose a data splitting approach to correct…

Lower bounds involving $f$-divergences between the underlying probability measures are proved for the minimax risk in estimation problems. Our proofs just use simple convexity facts. Special cases and straightforward corollaries of our…

One of the most important quantum algorithms ever discovered is Grover's algorithm for searching an unordered set. We give a new lower bound in the query model which proves that Grover's algorithm is exactly optimal. Similar to existing…

We introduce a $2$-approximation algorithm for the minimum total covering number problem.

We present a new method to propagate lower bounds on conditional probability distributions in conventional Bayesian networks. Our method guarantees to provide outer approximations of the exact lower bounds. A key advantage is that we can…

In this paper, we give a sharp lower bound for the minimum deviation of the Chebyshev polynomial on a compact subset of the real line in terms of the corresponding logarithmic capacity. Especially if the set is the union of several real…

A tight lower bound for required I/O when computing an ordinary matrix-matrix multiplication on a processor with two layers of memory is established. Prior work obtained weaker lower bounds by reasoning about the number of segments needed…

This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…

The use of realistic input models has gained popularity in the theory community. Assuming a realistic input model often precludes complicated hypothetical inputs, and the analysis yields bounds that better reflect the behaviour of…

For each $n$, let $\text{RD}(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In 1945, Segre called for a better understanding of the large…