English
Related papers

Related papers: Sharp Effective Finite-Field Nullstellensatz

200 papers

Using the functional interpretation from proof theory, we analyze nonconstructive proofs of several central theorems about polynomial and differential polynomial rings. We extract effective bounds, some of which are new to the literature,…

Logic · Mathematics 2018-10-17 William Simmons , Henry Towsner

Grigoriev and Podolskii (2018) have established a tropical analogue of the effective Nullstellensatz, showing that a system of tropical polynomial equations is solvable if and only if a linearized system obtained from a truncated Macaulay…

Combinatorics · Mathematics 2024-10-22 Marianne Akian , Antoine Béreau , Stéphane Gaubert

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

Number Theory · Mathematics 2024-09-09 Jonathan W. Bober , Lara Du , Dan Fretwell , Gene S. Kopp , Trevor D. Wooley

Alon's combinatorial Nullstellensatz (Theorem 1.1 from \cite{Alon1}) is one of the most powerful algebraic tools in combinatorics, with a diverse array of applications. Let $\F$ be a field, $S_1,S_2,..., S_n$ be finite nonempty subsets of…

Combinatorics · Mathematics 2011-09-26 Géza Kós , Lajos Rónyai

We show that there is a defining equation of degree at most $\mathsf{poly}(n)$ for the (Zariski closure of the) set of the non-rigid matrices: that is, we show that for every large enough field $\mathbb{F}$, there is a non-zero…

Computational Complexity · Computer Science 2020-11-06 Mrinal Kumar , Ben Lee Volk

We use recent results about linking the number of zeros on algebraic varieties over $\mathbb{C}$, defined by polynomials with integer coefficients, and on their reductions modulo sufficiently large primes to study congruences with products…

Number Theory · Mathematics 2022-07-25 Bryce Kerr , Jorge Mello , Igor Shparlinski

Most results on the value sets $V_f$ of polynomials $f \in \mathbb{F}_q[x]$ relate the cardinality $|V_f|$ to the degree of $f$. In particular, the structure of the spectrum of the class of polynomials of a fixed degree $d$ is rather well…

Combinatorics · Mathematics 2017-01-24 Leyla Işık , Alev Topuzoğlu

Let $f_1,\dots,f_k \in \mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an $n<x$ such that $\|f_i(n)\|\ll x^{-1/10.5kd(d-1)+o(1)}$ for all $1\le i\le k$. This improves on an earlier…

Number Theory · Mathematics 2024-07-03 Cheuk Fung Lau

We address some questions concerning indecomposable polynomials and their behaviour under specialization. For instance we give a bound on a prime $p$ for the reduction modulo $p$ of an indecomposable polynomial $P(x)\in \Zz[x]$ to remain…

Commutative Algebra · Mathematics 2014-02-26 Arnaud Bodin , Guillaume Chéze , Pierre Débes

We establish expansion properties for suitably generic polynomials of degree $d$ in $d+1$ variables over finite fields. In particular, we show that if $P\in\mathbb{F}_q[x_1,\ldots,x_{d+1}]$ is a polynomial of degree $d$ coming from an…

Combinatorics · Mathematics 2024-03-07 Nuno Arala , Sam Chow

Given a polynomial system $\mathcal{F}$ over a finite field $k$ which is not necessarily of dimension zero, we consider the Weil descent $\mathcal{F}'$ of $\mathcal{F}$ over a subfield $k'$. We prove a theorem which relates the last fall…

Algebraic Geometry · Mathematics 2021-03-15 Ming-Deh Huang

Let $A$ be the algebra of all $n \times n$ matrices with entries from $\RR[x_1,\ldots,x_d]$ and let $G_1,\ldots,G_m,F \in A$. We will show that $F(a)v=0$ for every $a \in \RR^d$ and $v \in \RR^n$ such that $G_i(a)v=0$ for all $i$ if and…

Algebraic Geometry · Mathematics 2018-04-24 Jaka Cimpric

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

Number Theory · Mathematics 2019-02-20 Alexei Entin

Understanding bounds for the effective differential Nullstellensatz is a central problem in differential algebraic geometry. Recently, several bounds have been obtained using Dicksonian and antichains sequences (with a given growth rate).…

Commutative Algebra · Mathematics 2020-11-17 Omar León Sánchez , Alexey Ovchinnikov

We study zeros of polynomials in the multivariate skew polynomial ring $D[x_1,\ldots,x_n; \sigma]$, where $\sigma$ is an automorphism of a division ring $D$. We prove a generalization of Alon's celebrated Combinatorial Nullstellensatz for…

Commutative Algebra · Mathematics 2025-08-15 Gil Alon , Angelot Behajaina , Elad Paran

We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…

Computational Complexity · Computer Science 2025-07-01 Somnath Bhattacharjee , Mrinal Kumar , Shanthanu S. Rai , Varun Ramanathan , Ramprasad Saptharishi , Shubhangi Saraf

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be any linearly independent polynomials with zero constant term. We show that there exists a $\gamma>0$ such that any subset of $\mathbb{F}_q$ of size at least $q^{1-\gamma}$ contains a nontrivial…

Number Theory · Mathematics 2019-05-29 Sarah Peluse

We give a general method for producing various effective Null and Positivstellens\"atze, and getting new Positivstellens\"atze in algebraically closed valued fields and ordered groups. These various effective Nullstellens\"atze produce…

Algebraic Geometry · Mathematics 2025-05-06 Michel Coste , Henri Lombardi , Marie-Françoise Roy

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

Number Theory · Mathematics 2021-11-10 Borys Kuca

In this article we will discuss a new, mostly theoretical, method for solving (zero-dimensional) polynomial systems, which lies in between Gr\"obner basis computations and the heuristic first fall degree assumption and is not based on any…

Commutative Algebra · Mathematics 2015-06-19 Ming-Deh A. Huang , Michiel Kosters , Yun Yang , Sze Ling Yeo