Related papers: Degree Estimates for Polynomials Constant on a Hyp…

In this note we consider roots of multivariate polynomials over a finite grid. When given information on the leading monomial with respect to a fixed monomial ordering, the footprint bound [8, 5] provides us with an upper bound on the…

We establish the sharp estimate <<_d N^{2/d} for the number of rational points of height at most N on an irreducible projective curve of degree d. We deduce this from a result for general hypersurfaces that is sensitive to the coefficients…

This work focuses on the degree bound of maps between balls with maximum geometric rank and minimum target dimension where this geometric rank occurs. Specifically, we show that rational proper maps between $\mathbb{B}_n$ and $\mathbb{B}_N$…

We prove that a generic homogeneous polynomial of degree $d$ is determined, up to a nonzero constant multiplicative factor, by the vector space spanned by its partial derivatives of order $k$ whenever $k\leq\frac{d}{2}-1$.

We show that over the field of complex numbers, \emph{every} homogeneous polynomial of degree $d$ can be approximated (in the border complexity sense) by a depth-$3$ arithmetic circuit of top fan-in at most $d+1$. This is quite surprising…

We study the projective geometry of algebraic neural layers, namely families of maps induced by a polynomial activation function, with particular emphasis on the generic Euclidean Distance degree ($\mathrm{gED}$). This invariant is…

In this paper, we characterize arbitrary polynomial vector fields on $S^n$. We establish a necessary and sufficient condition for a degree one vector field on the odd-dimensional sphere $S^{2n-1}$ to be Hamiltonian. Additionally, we…

A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…

In this paper we are concerned with the Bohnenblust--Hille type inequalities for certain polynomials of bounded degree but of very large number of variables. As the polynomials will be defined on groups, one can think about the problem as…

D. Khavinson and G. Swiatek proved that harmonic polynomials p(z)+q(z), where p is holomorphic, q is antiholomorphic, and deg p = n > 1 = deg q, can have at most 3n-2 complex zeros. We show that this bound is sharp for all n by proving a…

Let $P_{<n}(z)$ be the Rudin-Shapiro polynomial of degree $n-1$. We show that $|P_{<n}(z)|\le \sqrt{6n-2}-1$ for all $n\ge0$ and $|z|=1$, confirming a longstanding conjecture. This bound is sharp in the case when $n=(2\cdot 4^k+1)/3$ and…

We study the $n$-variable Boolean functions which keep their algebraic degree unchanged when they are restricted to any (affine) hyperplane, or more generally to any affine space of a given co-dimension $k$. For cryptographic applications…

We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…

We generalize the recent work of S. Fomin and G. Mikhalkin on polynomial formulas for Severi degrees. The degree of the Severi variety of plane curves of degree d and delta nodes is given by a polynomial in d, provided delta is fixed and d…

We show that the set of complex points in the moduli space of polynomials of degree d corresponding to post-critically finite polynomials is a set of algebraic points of bounded height. It follows that for any B, the set of conjugacy…

We prove a complex polynomial of degree $n$ has at most $\lceil n/2 \rceil$ attractive fixed points lying on a line. We also consider the general case.

Let Pd,n denote the space of all real polynomials of degree at most d on R^n. We prove a new estimate for the logarithmic measure of the sublevel set of a polynomial P in Pd,1. Using this estimate, we prove a sharp estimate for a singular…

In this paper, equivalence constants between various polynomial norms are calculated. As an application, we also obtain sharp values of the Hardy--Littlewood constants for $2$-homogeneous polynomials on $\ell_p^2$ spaces, $2<p\leq\infty$…

We prove that there is a constant $C\leq 6.614$ such that every Boolean function of degree at most $d$ (as a polynomial over $\mathbb{R}$) is a $C\cdot 2^d$-junta, i.e. it depends on at most $C\cdot 2^d$ variables. This improves the $d\cdot…

This note will study complex polynomial maps of degree $n\ge 2$ with only one critical point.