Related papers: An exponential lower bound for homogeneous depth-5…

Let $d$ be a square-free positive integer and $h(d)$ the class number of the real quadratic field $\mathbb{Q}{(\sqrt{d})}.$ In this paper we give an explicit lower bound for $h(n^2+r)$, where $r=1,4$, and also establish an equivalent…

If a single particle obeys non-relativistic QM in R^d and has the Hamiltonian H = - Delta + f(r), where f(r)=sum_{i = 1}^{k}a_ir^{q_i}, 2\leq q_i < q_{i+1}, a_i \geq 0$, then the eigenvalues E = E_{n\ell}^{(d)}(\lambda) are given…

For given integers $n$ and $d$, both at least 2, we consider a homogeneous multivariate polynomial $f_d$ of degree $d$ in variables indexed by the edges of the complete graph on $n$ vertices and coefficients depending on cardinalities of…

As part of their graph minor project, Robertson and Seymour showed in 1990 that the class of graphs that can be embedded in a given surface can be characterized by a finite set of minimal excluded minors. However, their proof, because…

In this paper, we show that for every constant $0 < \epsilon < 1/2$ and for every constant $d \geq 2$, the minimum size of a depth $d$ Boolean circuit that $\epsilon$-approximates Majority function on $n$ variables is…

We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sharp upper bound for their numbers of real solutions. This upper bound is non-trivial in that it is smaller than either the Kouchnirenko or…

We provide a monotone non increasing sequence of upper bounds $f^H_k$ ($k\ge 1$) converging to the global minimum of a polynomial $f$ on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper…

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

We improve a result of H. L. Montgomery and J. P. Weinberger by establishing the existence of infinitely many fundamental discriminants $d>0$ for which the class number of the real quadratic field $\mathbb{Q}(\sqrt{d})$ exeeds…

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…

The list of all groups that can appear as torsion subgroups of elliptic curves over number fields of degree $d$, $d=4,5,6$, is not completely determined. However, the list of groups $\Phi^{\infty}(d)$, $d=4,5,6$, that can be realized as…

In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natural restrictions of these models for which we are able to…

Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials…

For any real numbers $B \ge 1$ and $\delta \in (0, 1)$ and function $f: [0, B] \rightarrow \mathbb{R}$, let $d_{B; \delta} (f) \in \mathbb{Z}_{> 0}$ denote the minimum degree of a polynomial $p(x)$ satisfying $\sup_{x \in [0, B]} \big| p(x)…

We establish new correlation bounds and pseudorandom generators for a collection of computation models. These models are all natural generalizations of structured low-degree $F_2$-polynomials that we did not have correlation bounds for…

We relate the maximum semidefinite and linear extension complexity of a family of polytopes to the cardinality of this family and the minimum pairwise Hausdorff distance of its members. This result directly implies a known lower bound on…

We give the stratification by the symmetric tensor rank of all degree $d \ge 9$ homogeneous polynomials with border rank $5$ and which depend essentially on at least 5 variables, extending previous works (A. Bernardi, A. Gimigliano, M.…

Galluccio--Loebl and Tesler showed that the perfect-matching polynomial of a graph embedded in an orientable surface of genus $g$ can be written as a linear combination of at most $4^g$ Pfaffians. We show that, in general, exponentially…

Proving complexity lower bounds remains a challenging task: we only know how to prove conditional uniform lower bounds and nonuniform lower bounds in restricted circuit models. Williams (STOC 2010) showed how to derive nonuniform lower…