相关论文: Bounds on the realizations of zero-nonzero pattern…

We upper bound the number of common zeros over a finite grid of multivariate polynomials and an arbitrary finite collection of their consecutive Hasse derivatives (in a coordinate-wise sense). To that end, we make use of the tool from…

We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…

For each $n$, let $\text{RD}(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In 1945, Segre called for a better understanding of the large…

We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…

Over finite fields, if the image of a polynomial map is not the entire field, then its cardinality can be bounded above by a significantly smaller value. Earlier results bound the cardinality of the value set using the degree of the…

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

We derive optimal asymptotic and non-asymptotic lower bounds on the Widom factors for weighted Chebyshev and orthogonal polynomials on compact subsets of the real line. In the Chebyshev case we extend the optimal non-asymptotic lower bound…

Let $V$ be a vector space over a finite field $k$. We give a condition on a subset $A \subset V$ that allows for a local criterion for checking when a function $f:A \to k$ is a restriction of a polynomial function of degree $<m$ on $V$. In…

We prove new combinatorial results about polynomial configurations in large subsets of finite fields. Bergelson--Leibman--McCutcheon (2005) showed that for any polynomial $P(x) \in \mathbb{Z}[x]$ with $P(0) = 0$, if $A \subseteq…

If E is a locally convex topological vector space, let P(E) be the pre-ordered set of all continuous seminorms on E. We study, on the one hand, for g an infinite cardinal those locally convex spaces E which have the g-neighbourhood property…

Let F:=(f_1,...,f_n) be a random polynomial system with fixed n-tuple of supports. Our main result is an upper bound on the probability that the condition number of f in a region U is larger than 1/epsilon. The bound depends on an integral…

Let $X$ be a (real or complex) infinite dimensional linear space. We establish conditions on a homogeneous polynomial $P$ on $X$ so that, if $W$ is any finite dimensional subspace of $X$ on which $P$ vanishes, then $P$ vanishes on an…

The $\epsilon$-approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within $\epsilon$ in the $\ell_\infty$ norm. We prove several lower bounds on this…

We prove the existence of an effective universal upper bound for the order of any integral periodic orbit of any integral algebraic dynamical system in a fixed ambient space. Using this, we demonstrate the decidability of periodicity in…

Global polynomial optimization methods typically rely on compactness of the feasible region in order to find solutions. These methods can incur considerable computational expense and most commercially available solvers do not verify the…

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…

We derive upper bounds for the smallest zero and lower bounds for the largest zero of Laguerre, Jacobi and Gegenbauer polynomials. Our approach uses mixed three term recurrence relations satisfied by polynomials corresponding to different…

Given a subspace $U\subset\mathbb{C}[x_1,\dots,x_n]_d$ we consider the closure of the image of the rational map $\mathbb{P}^{n-1}\dashrightarrow\mathbb{P}^{\dim U-1}$ given by $U$. Its coordinate ring is isomorphic to $\bigoplus_{i\ge 0}…

We introduce a broad class of equations that are described by a graph, which includes many well-studied systems. For these, we show that the number of solutions (or the dimension of the solution set) can be bounded by studying certain…