Related papers: A tau-conjecture for Newton polygons

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

Let $(P, Q)$ be a pair of Jacobian polynomials. We can show that $ <P, Q>+l+2g(P)-2= 0= <P, [P,Q]>$, where $<f, g>$ is the intersection number of $f, g\in \CC[x, y]$ in the affine plane, $l$ is the number of branch at point at infinity and…

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

In this paper, we shall precise the asymptotic behaviour of Newton polygons of $L$ functions associated to character sums, coming from some $n$ variable Laurent polynomials. In order to do this, we use the free sum on convex polytopes. This…

Assuming that the Permanent polynomial requires algebraic circuits of exponential size, we show that the class VNP does not have efficiently computable equations. In other words, any nonzero polynomial that vanishes on the coefficient…

Let $p$ be a polynomial in the non-commuting variables $(a,x)=(a_1,...,a_{g_a},x_1,...,x_{g_x})$. If $p$ is convex in the variables $x$, then $p$ has degree two in $x$ and moreover, $p$ has the form $p = L + \Lambda ^T \Lambda,$ where $L$…

The twisted $T$-adic exponential sum associated to a polynomial in one variable is studied. An explicit arithmetic polygon in terms of the highest two exponents of the polynomial is proved to be a lower bound of the Newton polygon of the…

On the set of complex number $\mathbb{C}$ it is possible to define $n$-valued group for any positive integer $n$. The $n$-multiplication defines a symmetric polynomial $p_n = p_n(x, y, z)$ with integer coefficients. By the theorem on…

The zero locus of a bivariate polynomial $P(x,y)=0$ defines a compact Riemann surface $\Sigma$. The fundamental second kind differential is a symmetric $1\otimes 1$ form on $\Sigma\times \Sigma$ that has a double pole at coinciding points…

We show that packing axis-aligned unit squares into a simple polygon $P$ is NP-hard, even when $P$ is an orthogonal and orthogonally convex polygon with half-integer coordinates. It has been known since the early 80s that packing unit…

The M-convexity of dual Schubert polynomials was first proven by Huh, Matherne, M\'esz\'aros, and St. Dizier in 2022. We give a full characterization of the supports of dual Schubert polynomials, which yields an elementary alternative proof…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

For a system of polynomial equations, whose coefficients depend on parameters, the Newton polyhedron of its discriminant is computed in terms of the Newton polyhedra of the coefficients. This leads to an explicit formula (involving mixed…

In this paper, we prove a conjecture of Alexandrov that the generalized Brezin-Gross-Witten tau-functions are hypergeometric tau functions of BKP hierarchy after re-scaling. In particular, this shows that the original BGW tau-function,…

We resolve the Ramsey problem for $\{x,y,z:x+y=p(z)\}$ for all polynomials $p$ over $\mathbb{Z}$. In particular, we characterise all polynomials that are $2$-Ramsey, that is, those $p(z)$ such that any $2$-colouring of $\mathbb{N}$ contains…

Many problems in combinatorial geometry can be formulated in terms of curves or surfaces containing many points of a cartesian product. In 2000, Elekes and R\'onyai proved that if the graph of a polynomial contains $cn^2$ points of an…

For any matroid $M$, we compute the Tutte polynomial $T_M(x,y)$ using the mixed intersection numbers of certain classes in the combinatorial Chow ring $A^\bullet(M)$ arising from hypersimplices. Using the mixed Hodge-Riemann relations, we…

In this paper we give a combinatorial view on the adjunction theory of toric varieties. Inspired by classical adjunction theory of polarized algebraic varieties we define two convex-geometric notions: the Q-codegree and the nef value of a…

Recent developments of affine algebraic geometry, especially the theory of open algebraic surfaces, provide means to systematically explore geometric and topological properties of polynomials in two variables. Nevertheless, there is one…

The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…