Related papers: Refining Multivariate Value Set Bounds

In this paper we obtain further improvement of index bounds for character sums of polynomials over finite fields. We present some examples, which show that our new bound is an improved bound compared to both the Weil bound and the index…

Estimating the cardinality of the output of a query is a fundamental problem in database query processing. In this article, we overview a recently published contribution that casts the cardinality estimation problem as linear optimization…

The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…

We study a graded vector space of polynomials associated to a square matrix, defined by a finite difference condition along the rows. We show this space coincides with one defined by directional derivatives, and prove it is…

In this work we present a method, based on the use of Bernstein polynomials, for the numerical resolution of some boundary values problems. The computations have not need of particular approximations of derivatives, such as finite…

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 give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…

We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…

By introducing motivic Milnor fibers at infinity of polynomial maps, we propose some methods for the study of nilpotent parts of monodromies at infinity. The numbers of Jordan blocks in the monodromy at infinity will be described by the…

The BKK theorem states that the mixed volume of the Newton polytopes of a system of polynomial equations upper bounds the number of isolated torus solutions of the system. Homotopy continuation solvers make use of this fact to pick…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

The degree of a polynomial representing (or approximating) a function f is a lower bound for the number of quantum queries needed to compute f. This observation has been a source of many lower bounds on quantum algorithms. It has been an…

The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem…

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

We estimate the average cardinality $\mathcal{V}(\mathcal{A})$ of the value set of a general family $\mathcal{A}$ of monic univariate polynomials of degree $d$ with coefficients in the finite field $\mathbb{F}_{\hskip-0.7mm q}$. We…

Given a set of endomorphisms on $\mathbb{P}^N$, we establish an upper bound on the number of points of bounded height in the associated monoid orbits. Moreover, we give a more refined estimate with an associated lower bound when the monoid…

Investigating a problem posed by W. Hengartner (2000), we study the maximal valence (number of preimages of a prescribed point in the complex plane) of logharmonic polynomials, i.e., complex functions that take the form $f(z) = p(z)…

For a finite group $G$ acting faithfully on a finite dimensional $F$-vector space $V$, we show that in the modular case, the top degree of the vector coinvariants grows unboundedly: $\lim_{m\to\infty} \topdeg F[V^{m}]_{G}=\infty$. In…

In this paper, we study the value sets of non-permutation polynomial functions over the residue class ring $\mathbb{Z}/m\mathbb{Z}$. When $m=p^r$ is a power of some prime $p$, an upper bound is given for the size of the value set of a…

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…