Related papers: Polynomials constant on a hyperplane and CR maps o…

Let $P_N(R)$ be the space of all real polynomials in $N$ variables with the usual inner product $<, >$ on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form…

The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the…

Let {f_t} be any algebraic family of rational maps of a fixed degree, with a marked critical point c(t). We first prove that the hypersurfaces of parameters for which c(t) is periodic converge as a sequence of positive closed (1,1) currents…

It is proved that the associative differential graded algebra of (polynomial) polyvector fields on a vector space (may be infinite- dimensional) is quasi-isomorphic to the corresponding cohomological Hochschild complex of (polynomial)…

For a convex domain $D$ bounded by the hypersurface $\partial D$ in a space of constant curvature we give sharp bounds on the width $R-r$ of a spherical shell with radii $R$ and $r$ that can enclose $\partial D$, provided that normal…

We use two ingredients to prove the hyperbolicity of generic hypersurfaces of sufficiently high degree and of their complements in the complex projective space. One is the pullbacks of appropriate low pole order meromorphic jet…

We prove that for any graph $G$ the (complex) zeros of its chromatic polynomial, $\chi_G(x)$, lie inside the disk centered at $0$ of radius $4.25 \Delta(G)$, where $\Delta(G)$ denotes the maximum degree of $G$. This improves on a recent…

In 2013, Koldobsky posed the problem to find a constant $d_n$, depending only on the dimension $n$, such that for any origin-symmetric convex body $K\subset\mathbb{R}^n$ there exists an $(n-1)$-dimensional linear subspace…

We show that for every finite symetric set S of integer vectors, every real trigonometric polynomial on the d dimensional torus with spectrum in S has a zero in every closed ball of diameter D, where D is the sum over S of 1 over 4 times…

In 1984, Deligne proved that for any prime number $p$, the reduction modulo $p$ of the diagonal of a multivariate algebraic power series with integer coefficients is algebraic over the field of rational functions with coefficients in…

Consider a system of polynomials in many variables over the ring of integers of a number field $K$. We prove an asymptotic formula for the number of integral zeros of this system in homogeneously expanding boxes. As a consequence, any…

In his paper "On the Schlafli differential equality", J. Milnor conjectured that the volume of n-dimensional hyperbolic and spherical simplices, as a function of the dihedral angles, extends continuously to the closure of the space of…

We establish the sharp growth order, up to epsilon losses, of the $L^2$-norm of the maximal directional averaging operator along a finite subset $V$ of a polynomial variety of arbitrary dimension $m$, in terms of cardinality. This is an…

In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…

In this paper, we give sharp upper and lower bounds for the number of degenerate monic (and arbitrary, not necessarily monic) polynomials with integer coefficients of fixed degree $n \ge 2$ and height bounded by $H \ge 2$. The polynomial is…

We study the problem of approximating the value of the matching polynomial on graphs with edge parameter $\gamma$, where $\gamma$ takes arbitrary values in the complex plane. When $\gamma$ is a positive real, Jerrum and Sinclair showed that…

In this paper we prove that the complex polynomial Bohnenblust-Hille constant for $2$-homogeneous polynomials in ${\mathbb C}^2$ is exactly $\sqrt[4]{\frac{3}{2}}$. We also give the exact value of the real polynomial Bohnenblust-Hille…

We prove that for every $t\in \mathbb{N}$ there is a constant $\gamma_t$ such that every graph with twin-width at most $t$ and clique number $\omega$ has chromatic number bounded by $2^{\gamma_t \log^{4t+3} \omega}$. In other words, we…

It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…

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…