Related papers: Polytope Bounds on Multivariate Value Sets

Let (K, v) be a henselian valued field of arbitrary rank. In this paper, we give an irreducibility criterion for multivariate polynomials over K using valuation theory.

Extension problems for polynomial valuations on different cones of convex functions are investigated. It is shown that for the classes of functions under consideration, the extension problem reduces to a simple geometric obstruction on the…

Let S be a finite subset of a field. For multivariate polynomials the generalized Schwartz-Zippel bound [2], [4] estimates the number of zeros over Sx...xS counted with multiplicity. It does this in terms of the total degree, the number of…

This survey paper was primarily written as as the support for a course pesented at the JNCF2025: it aims to present some material that illustrates the kind of estimates one can obtain in effective algebraic geometry, for affine polynomial…

In this paper, we study multiplicative dependence of values of polynomials or rational functions over a number field. As an application, we obtain new results on multiplicative dependence in the orbits of a univariate polynomial dynamical…

In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…

We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.

In this paper we study the distribution of the size of the value set for a random polynomial with degree at most $q-1$ over a finite field $\mathbb{F}_q$. We obtain the exact probability distribution and show that the number of missing…

In this paper we introduce a new approach and obtain new results for the problem of studying polynomial images of affine subspaces of finite fields. We improve and generalise several previous known results, and also extend the range of such…

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

We improve the Cauchy radius of both scalar and matrix polynomials, which is an upper bound on the moduli of the zeros and eigenvalues, respectively, by using appropriate polynomial multipliers.

This paper addresses the problem of deciding the lower-boundedness of an arbitrary real polynomial p in n variables.

For signed graphs we provide a cubic polynomial upper bound on the multiplicity of its eigenvalues. We show that this bound is sharp by providing examples of signed graphs in which it is attained. We also discuss particular cases in which…

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

A weighted game or a threshold function in general admits different weighted representations even if the sum of non-negative weights is fixed to one. Here we study bounds for the diameter of the corresponding weight polytope. It turns out…

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 derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…

The aim of the paper is twofold. Firstly, by using the constant rank level set theorem from differential geometry, we establish sharp upper bounds for the dimensions of the solution sets of polynomial variational inequalities under mild…

Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying p_S(x+y)=\sum_{T\uplus U=S}p_T(x)p_U(y). Using umbral calculus, we give a formula for the expansion of such a set map in terms of any…

We describe the images of multilinear polynomials of arbitrary degree evaluated on the $3\times 3$ upper triangular matrix algebra over an infinite field.