English
Related papers

Related papers: Polynomials Meeting Ax's Bound

200 papers

The polynomials $d_n(x)$ are defined by \begin{align*} d_n(x) &= \sum_{k=0}^n{n\choose k}{x\choose k}2^k. \end{align*} We prove that, for any prime $p$, the following congruences hold modulo $p$: \begin{align*}…

Number Theory · Mathematics 2016-04-19 Song Guo , Victor J. W. Guo

In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…

Combinatorics · Mathematics 2017-12-19 David G. L. Wang , Jiarui Zhang

We make use of a result of Hurwitz and Reznick, and a consequence of this result due to Fidalgo and Kovacec, to determine a new sufficient condition for a polynomial $f\in\mathbb{R}[X_1,...,X_n]$ of even degree to be a sum of squares. This…

Optimization and Control · Mathematics 2012-11-15 Mehdi Ghasemi , Murray Marshall

In this paper, we prove that if $f(x)=\sum_{k=0}^n{n\choose k}a_kx^k$ is a polynomial with real zeros only, then the sequence $\{a_k\}_{k=0}^n$ satisfies the following inequalities $a_{k+1}^2(1-\sqrt{1-c_k})^2/a_k^2…

Combinatorics · Mathematics 2020-12-08 J. J. F Guo

For any polynomial mapping $F=(F_1,\dots ,F_n)$ of $\Cal C^n$ with a finite number of zeros we define the Noether exponent $\nu(F)$. We prove the Jacobi formula for all polynomials of degree strictly less than $\sum_{i=1}^n (\deg…

alg-geom · Mathematics 2016-08-14 Arkadiusz Płoski

Let $f$ be a polynomial system consisting of $n$ polynomials $f_1,\cdots, f_n$ in $n$ variables $x_1,\cdots, x_n$, with coefficients in $\mathbb{Q}$ and let $\langle f\rangle$ be the ideal generated by $f$. Such a polynomial system, which…

Commutative Algebra · Mathematics 2018-07-31 Jean-Paul Cardinal

Andreev's Problem states the following: Given an integer $d$ and a subset of $S \subseteq \mathbb{F}_q \times \mathbb{F}_q$, is there a polynomial $y = p(x)$ of degree at most $d$ such that for every $a \in \mathbb{F}_q$, $(a,p(a)) \in S$?…

Computational Complexity · Computer Science 2019-07-19 Aditya Potukuchi

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

Computational Complexity · Computer Science 2014-08-19 Robert L. Surowka , Kenneth W. Regan

We show that if a polynomial $f\in \mathbb{R}[x_1,\ldots,x_n]$ is nonnegative on a closed basic semialgebraic set $X=\{x\in\mathbb{R}^n:g_1(x)\ge 0,\ldots,g_r (x)\ge 0\}$, where $g_1,\ldots,g_r\in\mathbb{R}[x_1,\ldots,x_n]$, then $f$ can be…

Algebraic Geometry · Mathematics 2015-07-23 Krzysztof Kurdyka , Stanisław Spodzieja

Let $\chi$ be an order $c$ multiplicative character of a finite field and $f(x)=x^d+\lambda x^e$ a binomial with $(d,e)=1$. We study the twisted classical and $T$-adic Newton polygons of $f$. When $p>(d-e)(2d-1)$, we give a lower bound of…

Number Theory · Mathematics 2021-10-01 Shenxing Zhang

Define the codewords of the Tensor Reed-Muller code $\mathsf{TRM}(r_1,m_1;r_2,m_2;\dots;r_t,m_t)$ to be the evaluation vectors of all multivariate polynomials in the variables $\left\{x_{ij}\right\}_{i=1,\dots,t}^{j=1,\dots m_i}$ with…

Information Theory · Computer Science 2026-01-23 Emmanuel Abbe , Colin Sandon , Oscar Sprumont

We consider the equation $P(Q(x_1,\ldots,x_\nu))=Q(P(x_1),\ldots,P(x_\nu))$ in polynomials over the field of complex numbers and prove that if ${\rm deg}(P)>1$, then it is only solvable in polynomials that are affinely conjugate to…

Number Theory · Mathematics 2024-12-17 Arseny Mingajev

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…

Combinatorics · Mathematics 2017-01-26 Pierre-Yves Bienvenu

We provide sufficient and necessary conditions for the coefficients of a $q$-polynomial $f$ over $\mathbb{F}_{q^n}$ which ensure that the number of distinct roots of $f$ in $\mathbb{F}_{q^n}$ equals the degree of $f$. We say that these…

Combinatorics · Mathematics 2020-09-17 Bence Csajbók , Giuseppe Marino , Olga Polverino , Ferdinando Zullo

Let $r$ be a prime power and $q=r^m$. For $0\le i\le m-1$, let $f_i\in \mathbb{F}_r[x]$ be $q$-linearized and $a_i\in \mathbb{F}_q$. Assume that $z\in \mathbb{\bar{F}}_r$ satisfies the equation $\sum_{i=0}^{m-1}a_if_i(z)^{r^i}=0$, where…

Number Theory · Mathematics 2015-03-12 Neranga Fernando , Xiang-dong Hou

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

Number Theory · Mathematics 2014-07-21 David Krumm

For an odd prime $p$ and an integer $w\ge 1$, polynomial quotients $q_{p,w}(u)$ are defined by $$ q_{p,w}(u)\equiv \frac{u^w-u^{wp}}{p} \bmod p ~~ \mathrm{with}~~ 0 \le q_{p,w}(u) \le p-1, ~~u\ge 0, $$ which are generalizations of Fermat…

Number Theory · Mathematics 2014-02-11 Zhixiong Chen , Arne Winterhof

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

Computational Geometry · Computer Science 2014-03-20 Orit E. Raz , Micha Sharir , József Solymosi

Let K be an algebraically closed field of characteristic 0. Following Medvedev-Scanlon, a polynomial of degree d > 1 is said to be disintegrated if neither f nor -f is linearly conjugate to x^d or T_d(x) where T_d is the Chebyshev…

Number Theory · Mathematics 2015-10-20 Dragos Ghioca , Khoa D. Nguyen

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Algebraic Geometry · Mathematics 2009-10-12 Arnaud Bodin
‹ Prev 1 4 5 6 7 8 10 Next ›