Related papers: Polynomial partitioning for a set of varieties

Grothendieck has proved that each class in the de Rham cohomology of a smooth complex affine variety can be represented by a differential form with polynomial coefficients. After having proved a single exponential bound for the degrees of…

Let $X$ be a (real or complex) infinite dimensional linear space. We establish conditions on a homogeneous polynomial $P$ on $X$ so that, if $W$ is any finite dimensional subspace of $X$ on which $P$ vanishes, then $P$ vanishes on an…

We prove that all polynomials in several variables can be decomposed as the sums of $k$th powers: $P(x_1,...,x_n) = Q_1(x_1,...,x_n)^k+...+ Q_s(x_1,...,x_n)^k$, provided that elements of the base field are themselves sums of $k$th powers.…

We define a necessary and sufficient condition on a polynomial $h\in \mathbb{Z}[x]$ to guarantee that every set of natural numbers of positive upper density contains a nonzero difference of the form $h(p)$ for some prime $p$. Moreover, we…

In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…

If $P(z)=\sum_{j=0}^{n}a_jz^j$ is a polynomial of degree $n$ having no zero in $|z|<1,$ then it was recently proved that for every $p\in[0,+\infty]$ and $s=0,1,\ldots,n-1,$ \begin{align*} \left\|a_nz+\frac{a_s}{\binom{n}{s}}\right\|_{p}\leq…

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

Every symmetric polynomial p(x)=p(x_1,...,x_g) (with real coefficients) in g noncommuting variables x_1, ..., x_g can be written as a sum and difference of squares of noncommutative polynomials. Let s(p), the negative signature of p, denote…

We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…

We discuss a form of a well-known problem of Kakeya for complex polynomials. Let p(z) be a complex polynomial. This problem requires to find disc that contains n zeros of some derivative of p(z), provided that location of several zeros of…

For each $n$, let 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 this paper, we recover an algorithm of Sylvester for determining…

Let $H$ be a $k$-partite $k$-graph with $n$ vertices in each partition class, and let $\delta_{k-1}(H)$ denote the minimum co-degree of $H$. We characterize those $H$ with $\delta_{k-1}(H) \geq n/2$ and with no perfect matching. As a…

Let $\mathbb{F}$ be a field. We show that given any $n$th degree monic polynomial $q(x)\in \mathbb{F}[x]$ and any matrix $A\in\mathbb{M}_n(\mathbb{F})$ whose trace coincides with the trace of $q(x)$ and consisting in its main diagonal of…

We prove for various finite groups $G$ and integers $n\geq 1$ that there are families of equations with Galois group $G$ that cannot be simplified to a one-parameter family even after adjoining a root of a polynomial of degree at most $n$.…

Let $H, K$ be subgroups of the permutation group $G$ of degree $n$ with $K\trianglelefteq G$ and $\sigma$ be a partition of the set of all different prime divisors of $|G/K|$. We prove that in polynomial time (in $n$) one can check $G/K$…

A $p$-divisible group over a field $K$ admits a slope decomposition; associated to each slope $\lambda$ is an integer $m$ and a representation $\gal(K) \ra \gl_m(D_\lambda)$, where $D_\lambda$ is the $\rat_p$-division algebra with Brauer…

We consider the problem of partitioning a graph into a non-fixed number of non-overlapping subgraphs of maximum density. The density of a partition is the sum of the densities of the subgraphs, where the density of a subgraph is its average…

Let W_n(K) be the Lie algebra of derivations of the polynomial algebra K[X]:=K[x_1,...,x_n] over an algebraically closed field K of characteristic zero. A subalgebra L of W_n(K) is called polynomial if it is a submodule of the K[X]-module…

Let $D$ be an integrally closed domain with quotient field $K$. Let $A$ be a torsion-free $D$-algebra that is finitely generated as a $D$-module. For every $a$ in $A$ we consider its minimal polynomial $\mu_a(X)\in D[X]$, i.e. the monic…

The celebrated Ore-DeMillo-Lipton-Schwartz-Zippel (ODLSZ) lemma asserts that n-variate non-zero polynomial functions of degree d over a field $\mathbb{F}$ are non-zero over any "grid" $S^n$ for finite subset $S \subseteq \mathbb{F}$, with…