Related papers: On approximate Gauss-Lucas theorems

We consider a set $X$ of distinct points in the $n$-dimensional projective space over an algebraically closed field $k$. Let $A$ denote the coordinate ring of $X$, and let $a_i(X)=\dim_k [{\rm Tor}_i^R(A,k)]_{i+1}$. Green's Strong…

Let $p_n$ denote the $n$-th prime number, $\{q_n\}$ be a sequence of positive numbers and $x\in\mathbb{R}$. In this note we prove that the inequality $$q_n p_{n+1}^{x}-q_{n+1}p_{n}^{x}<p_{n}^{x}p_{n+1}^{x-1}, $$ holds for infinitely many…

Call a Laurent polynomial $W$ `complete' if its Newton polytope is full-dimensional with zero in its interior. We show that if $W$ is any complete Laurent polynomial with coefficients in the positive part of the field $K$ of generalised…

We use Gale duality for polynomial complete intersections and adapt the proof of the fewnomial bound for positive solutions to obtain the bound (e^4+3) 2^(k choose 2) n^k/4 for the number of non-zero real solutions to a system of n…

We prove that if $P(X) \in \mathbb{Z}[X]$ is an integer polynomial of degree $n$ and having $P(0) = 1$, then either $P(X)$ is a product of cyclotomic polynomials, or else at least one of the complex roots of $P$ belongs to the disk $|z|…

A classical theorem of Spencer shows that any set system with n sets and n elements admits a coloring of discrepancy O(n^1/2). Recent exciting work of Bansal, Lovett and Meka shows that such colorings can be found in polynomial time. In…

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

Let $V$ be a vector space over a finite field $k=\mathbb{F} _q$ of dimension $n$. For a polynomial $P:V\to k$ we define the bias of $P$ to be $$b_1(P)=\frac {|\sum _{v\in V}\psi (P(V))|}{q^n}$$ where $\psi :k\to \mathbb{C} ^\star$ is a…

Let $K$ be a convex body in $\mathbb{R}^n$ and $f : \partial K \rightarrow \mathbb{R}_+$ a continuous, strictly positive function with $\int\limits_{\partial K} f(x) d \mu_{\partial K}(x) = 1$. We give an upper bound for the approximation…

A two-dimensional $n$-correct set is a set of nodes admitting unique bivariate interpolation with polynomials of total degree at most ~$n$. We are interested in correct sets with the property that all fundamental polynomials are products of…

This paper investigates the number of monic integer polynomials of degree $n$ whose roots are all real and positive. We establish an asymptotic formula for the case of fixed trace by estimating the number of integer sequences satisfying…

The Casas--Alvero conjecture predicts that every univariate polynomial over a field of characteristic zero having a common factor with each of its derivatives $H_i(f)$ is a power of a linear polynomial. One approach to proving the…

Let $X_1,X_2,\ldots$ be independent and identically distributed random variables in $\mathbb{C}$ chosen from a probability measure $\mu$ and define the random polynomial $$ P_n(z)=(z-X_1)\ldots(z-X_n)\,. $$ We show that for any sequence $k…

Consider a random polynomial $Q_n$ of degree $n+1$ whose zeroes are i.i.d. random variables $\xi_0,\xi_1,\ldots,\xi_n$ in the complex plane. We study the pairing between the zeroes of $Q_n$ and its critical points, i.e. the zeroes of its…

Suppose that $\langle f_n \rangle$ is a sequence of polynomials, $\langle f_n^{(k)}(0)\rangle$ converges for every non-negative integer $k$, and that the limit is not $0$ for some $k$. It is shown that if all the zeros of $f_1, f_2, \dots$…

Let p be any prime, and let a and n be nonnegative integers. Let $r\in Z$ and $f(x)\in Z[x]$. We establish the congruence $$p^{\deg f}\sum_{k=r(mod p^a)}\binom{n}{k}(-1)^k f((k-r)/p^a) =0 (mod p^{\sum_{i=a}^{\infty}[n/p^i]})$$ (motivated by…

Giving a joint generalization of a result of Brazitikos, Chasapis and Hioni and results of Giannopoulos and Milman, we prove that roughly $\left\lceil \frac{d}{(1-\vartheta)^d}\ln\frac{1}{(1-\vartheta)^d} \right\rceil$ points chosen…

Lorentzian polynomials are a fascinating class of real polynomials with many applications. Their definition is specific to the nonnegative orthant. Following recent work, we examine Lorentzian polynomials on proper convex cones. For a…

Given a set $P$ of $n$ points in the plane, its unit-disk graph $G(P)$ is a graph with $P$ as its vertex set such that two points of $P$ are connected by an edge if their (Euclidean) distance is at most $1$. We consider several classical…

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n$ having no zeros in the unit disk. ~Then it is well known that for $R\geq 1,$ $\displaystyle{\max_{|z|=R}|p(z)|}\leq…