Related papers: On correlation bounds against polynomials
We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…
The approximate coherent state rank is the minimal number of (classical) coherent states required to approximate a continuous-variable bosonic quantum state and directly relates to the classical complexity of simulating bosonic…
To determine the dimension of null space of any given linearized polynomial is one of vital problems in finite field theory, with concern to design of modern symmetric cryptosystems. But, the known general theory for this task is much far…
In this work we propose a simple but effective high order polynomial correction allowing to enhance the consistency of all kind of boundary conditions for the Euler equations (Dirichlet, characteristic far-field and slip-wall), both in 2D…
The paper deals with a complex polynomial $H$ in two variables having - a generic highest homogeneous part (without multiple zero lines), - nonconstant lower terms. In particular, under these conditions the polynomial $H$ has at least two…
The celebrated result of Kabanets and Impagliazzo (Computational Complexity, 2004) showed that PIT algorithms imply circuit lower bounds, and vice versa. Since then it has been a major challenge to understand the precise connections between…
The aim of my thesis is to discuss, develop and apply the newest developments of this fascinating theory connected to modern harmonic analysis. In particular, we investigate some strong convergence result of partial sums of Vilenkin-Fourier…
We study the complexity of learning and approximation of self-bounding functions over the uniform distribution on the Boolean hypercube ${0,1}^n$. Informally, a function $f:{0,1}^n \rightarrow \mathbb{R}$ is self-bounding if for every $x…
This paper presents a simple, self-contained account of Garding's theory of hyperbolic polynomials, including a recent convexity result of Bauschke-Guler-Lewis-Sendov and an inequality of Gurvits. This account also contains new results,…
The purpose of this note is to discuss several results that have been obtained in the last decade in the context of sharp adjoint Fourier restriction/Strichartz inequalities. Rather than aiming at full generality, we focus on several…
Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$ one has $$\log\left[\mathrm{lcm}(f(1),f(2),\ldots f(N))\right]\sim(d-1)N\log N$$ as $N \to \infty$. He proved it in the case $d=2$ but it…
We build a variant of Collatz Conjecture for polynomials over $\mathbb{F}_2$ and we prove that it is solved. By the way, we give several examples.
In the minimal scenario of quantum correlations, two parties can choose from two observables with two possible outcomes each. Probabilities are specified by four marginals and four correlations. The resulting four-dimensional convex body of…
Many practical optimization problems lack strong convexity. Fortunately, recent studies have revealed that first-order algorithms also enjoy linear convergences under various weaker regularity conditions. While the relationship among…
We give a deterministic polynomial time $2^{O(r)}$-approximation algorithm for the number of bases of a given matroid of rank $r$ and the number of common bases of any two matroids of rank $r$. To the best of our knowledge, this is the…
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient method which can avoid singularities and breakdowns in the…
Combining a modular approach to the $abc$ conjecture developed by the second author with the classical method of linear forms in logarithms, we obtain improved unconditional bounds for two classical problems. First, for Szpiro's conjecture…
A correlation function of the classical orthogonal polynomials is defined and determined. The correlation function obeys a second order difference equation in two variables. The correlation function for the Gegenbauer, Chebyshev and…
Higher criticism is a method for detecting signals that are both sparse and weak. Although first proposed in cases where the noise variables are independent, higher criticism also has reasonable performance in settings where those variables…
A notorious open question in circuit complexity is whether Boolean operations of arbitrary arity can efficiently be expressed using modular counting gates only. H{\aa}stad's celebrated switching lemma yields exponential lower bounds for the…