Related papers: Polynomial partitioning for a set of varieties

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Let $P_1,...,P_n$ be generic homogeneous polynomials in $n$ variables of degrees $d_1,...,d_n$ respectively. We prove that if $\nu$ is an integer satisfying ${\sum_{i=1}^n d_i}-n+1-\min\{d_i\}<\nu,$ then all multivariate subresultants…

In 2015, Guth proved that if $S$ is a collection of $n$ $g$-dimensional semi-algebraic sets in $\mathbb{R}^d$ and if $D\geq 1$ is an integer, then there is a $d$-variate polynomial $P$ of degree at most $D$ so that each connected component…

We find a lower bound on the proportion of derangements in a finite transitive group that depends on the minimal nontrivial subdegree. As a consequence, we prove that, if $\Gamma$ is a $G$-vertex-transitive digraph of valency $d\ge 1$, then…

A $d^{\{n\}}$-cage $\mathsf K$ is the union of $n$ groups of hyperplanes in $\Bbb P^n$, each group containing $d$ members. The hyperplanes from the distinct groups are in general position, thus producing $d^n$ points, where hyperplanes from…

We define the covering gonality and separable covering gonality of varieties over arbitrary fields, generalizing the definition given by Bastianelli-de Poi-Ein-Lazarsfeld-Ullery for complex varieties. We show that over an arbitrary field a…

Given an odd integer polynomial f(x) of a degree k >=3, we construct a non-negative valued, normed trigonometric polynomial with the spectrum in the set of integer values of f(x) not greater than n, and a small free coefficient…

The $k$-independence number of a graph is the maximum size of a set of vertices at pairwise distance greater than $k$. A graph is called $k$-partially walk-regular if the number of closed walks of a given length $l\le k$, rooted at a vertex…

Let $\Gamma=(V,E)$ be a finite simple graph. A matching $M \subseteq E$ is positive if there exists a weight function on $V$ such that the matching $M$ is characterized by those edges with positive weights. A positive matching decomposition…

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n,$ where the coefficients $a_j,$ $j \in \{0,1,2,\cdots n\},$ may be complex. We impose some restriction on the coefficients of the real part of the given polynomial…

We prove asymptotically optimal bounds on the number of edges a graph $G$ must have in order that any $r$-colouring of $E(G)$ has a colour class which contains every $D$-degenerate graph on $n$ vertices with bounded maximum degree. We also…

In this paper, we study the derivatives of an integer-valued polynomial of a given degree. Denoting by $E_n$ the set of the integer-valued polynomials with degree $\leq n$, we show that the smallest positive integer $c_n$ satisfying the…

Let $K[x]$ be a polynomial algebra in a variable $x$ over a commutative $\Q$-algebra $K$, and $\G'$ be the monoid of $K$-algebra monomorphisms of $K[x]$ of the type $\s : x\mapsto x+\l_2x^2+... +\l_nx^n$, $\l_i\in K$, $\l_n$ is a unit of…

Assuming the Generalised Riemann Hypothesis (GRH), we show that for all k, there exist polynomials with coefficients in $\MA$ having no arithmetic circuits of size O(n^k) over the complex field (allowing any complex constant). We also build…

We prove a conjecture of Bonamy, Bousquet, Pilipczuk, Rz\k{a}\.zewski, Thomass\'e, and Walczak, that for every graph $H$, there is a polynomial $p$ such that for every positive integer $s$, every graph of average degree at least $p(s)$…

Let $\Omega$ be a convex open set in $\mathbb R^n$ and let $\Lambda_k$ be a finite subset of $\Omega$. We find necessary geometric conditions for $\Lambda_k$ to be interpolating for the space of multivariate polynomials of degree at most…

We obtain tight bounds for the minimal number of generators of an ideal with bounded-degree generators in a polynomial ring $K[X_1,\dots,X_n],$ as well as a sharp quantification of the maximum possible size of a minimal generating set of…

Let $X_n(K)$ be a building of Coxeter type $X_n = A_n$ or $X_n = D_n$ defined over a given division ring $K$ (a field when $X_n = D_n$). For a non-connected set $J$ of nodes of the diagram $X_n$, let $\Gamma(K) = Gr_J(X_n(K))$ be the…

The main purpose of this paper is to show that the mixed Hodge polynomial of the ``space of equations'' for smooth complete intersections of given multidegree in $\mathbb{C} P^n$ is divisible by the mixed Hodge polynomial of the group…

Consider a system of n polynomial equations and r polynomial inequations in n indeterminates of degree bounded by d with coefficients in a polynomial ring of s parameters with rational coefficients of bit-size at most $\sigma$. From the…