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

We establish a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (abbreviated as a $d$-polytope) with $2d+2$ vertices, extending the previously known case for $k=1$. We identify all…

We continue the study of the circuit class GC^0, which augments AC^0 with unbounded-fan-in gates that compute arbitrary functions inside a sufficiently small Hamming ball but must be constant outside it. While GC^0 can compute functions…

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

In this work we explore a correspondence between quantum circuits and low-degree polynomials over the finite field F_2. Any quantum circuit made up of Hadamard, Z, controlled-Z and controlled-controlled-Z gates gives rise to a degree-3…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

We construct explicit pseudorandom generators that fool $n$-variate polynomials of degree at most $d$ over a finite field $\mathbb{F}_q$. The seed length of our generators is $O(d \log n + \log q)$, over fields of size exponential in $d$…

$f,g_1,...,g_m$ be elements of the polynomial ring $\mathbb{R}[x_1,...,x_n]$. The paper deals with the general problem of computing a lower bound for $f$ on the subset of $\mathbb{R}^n$ defined by the inequalities $g_i\ge 0$, $i=1,...,m$.…

We study the problem of constructing explicit families of matrices which cannot be expressed as a product of a few sparse matrices. In addition to being a natural mathematical question on its own, this problem appears in various…

We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…

We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…

We study the structure of bounded degree polynomials over finite fields. Haramaty and Shpilka [STOC 2010] showed that biased degree three or four polynomials admit a strong structural property. We confirm that this is the case for degree…

We show that any Algebraic Branching Program (ABP) computing the polynomial $\sum_{i = 1}^n x_i^n$ has at least $\Omega(n^2)$ vertices. This improves upon the lower bound of $\Omega(n\log n)$, which follows from the classical result of Baur…

A family $f_t(z)$ of polynomials over a number field $K$ will be called \emph{weighted homogeneous} if and only if $f_t(z)=F(z^e, t)$ for some binary homogeneous form $F(X, Y)$ and some integer $e\geq 2$. For example, the family $z^d+t$ is…

The problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows the existence of functions whose circuit complexity is…

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

We show that the degree of the Alexander polynomial of an irreducible plane algebraic curve with nodes and cusps as the only singularities does not exceed ${5 \over 3}d-2$ where $d$ is the degree of the curve. We also show that the…

We explicitly construct the first nontrivial extractors for degree $d \ge 2$ polynomial sources over $\mathbb{F}_2^n$. Our extractor requires min-entropy $k\geq n - \tilde{\Omega}(\sqrt{\log n})$. Previously, no constructions were known,…

Assuming that the Permanent polynomial requires algebraic circuits of exponential size, we show that the class VNP does not have efficiently computable equations. In other words, any nonzero polynomial that vanishes on the coefficient…

In this paper, we present upper bounds for the depth of some classes of polyhedra, including: polyhedra with finite fundamental group, polyhedra $P$ with abelian or free $\pi_1(P)$ and finitely generated $H_i(tilde{P};\mathbb{Z}$,…

We develop a representation theoretic technique for detecting closed orbits that is applicable in all characteristics. Our technique is based on Kempf's theory of optimal subgroups and we make some improvements and simplify the theory from…