English
Related papers

Related papers: Represent MOD function by low degree polynomial wi…

200 papers

Ko [RAIRO 24, 1990] and Bruschi [TCS 102, 1992] showed that in some relativized world, PSPACE (in fact, ParityP) contains a set that is immune to the polynomial hierarchy (PH). In this paper, we study and settle the question of…

Computational Complexity · Computer Science 2007-05-23 Joerg Rothe

An open problem in complexity theory is to find the minimal degree of a polynomial representing the $n$-bit OR function modulo composite $m$. This problem is related to understanding the power of circuits with $\text{MOD}_m$ gates where $m$…

Computational Complexity · Computer Science 2015-11-13 Holden Lee

We prove a lower bound of $\Omega\left(n^{1.5}\right)$ for the number of product gates in non-commutative arithmetic circuits for an explicit $n$-variate degree-$n$ polynomial $f_{n}$ (over every field). We observe that this implies that…

Computational Complexity · Computer Science 2026-04-27 Ran Raz

This paper studies so-called "null polynomials modulo m", i.e., polynomials with integer coefficients that satisfy f(x)=0 (mod m) for any integer x. The study on null polynomials is helpful to reduce congruences of higher degrees modulo m…

Number Theory · Mathematics 2007-05-23 Shujun Li

We prove that the most natural low-degree test for polynomials over finite fields is ``robust'' in the high-error regime for linear-sized fields. Specifically we consider the ``local'' agreement of a function $f: \mathbb{F}_q^m \to…

Computational Complexity · Computer Science 2023-11-22 Prahladh Harsha , Mrinal Kumar , Ramprasad Saptharishi , Madhu Sudan

Let $F$ be a non-negatively graded free module over a polynomial ring $\mathbb{K}[x_1,\dots,x_n]$ generated by $m$ basis elements. Let $M$ be a submodule of $F$ generated by elements in $F$ with degrees bounded by $D$ and dim $F/M$=$r$. We…

Commutative Algebra · Mathematics 2022-04-22 Yihui Liang

Let $\mathbb{F}_{q}$ be a finite field of characteristic $p$, and let $f \in \mathbb{F}_{q}[x]$ be a polynomial of degree $d > 0$. Denote the image set of this polynomial as $V_{f}=\{f(\alpha)\mid\alpha\in\mathbb{F}_{q}\}$ and denote the…

Number Theory · Mathematics 2026-02-04 Jiyou Li , Zhiyao Zhang

For a polynomial $g(x)$ of deg $k \geq 2$ with integer coefficients and positive integer leading coefficient, we prove an upper bound for the least prime $p$ such that $g(p)$ is in non-homogeneous Beatty sequence $\lbrace \lfloor \alpha…

Number Theory · Mathematics 2019-12-03 C. G. Karthick Babu

For a set $\cM=\{-\mu,-\mu+1,\ldots, \lambda\}\setminus\{0\}$ with non-negative integers $\lambda,\mu<q$ not both 0, a subset $\cS$ of the residue class ring $\Z_q$ modulo an integer $q\ge 1$ is called a $(\lambda,\mu;q)$-\emph{covering…

Information Theory · Computer Science 2013-10-02 Zhixiong Chen , Igor E. Shparlinski , Arne Winterhof

We prove the following result, which is motivated by the recent work of Kurano and Roberts on Serre's positivity conjecture. Assume that (R,m) is a local ring with finitely-generated module M such that R/ann(M) is quasi-unmixed and contains…

Commutative Algebra · Mathematics 2007-05-23 Sean Sather-Wagstaff

We consider the problem of identity testing and recovering (that is, interpolating) of a "hidden" monic polynomials $f$, given an oracle access to $f(x)^e$ for $x\in\mathbb F_q$, where $\mathbb F_q$ is the finite field of $q$ elements and…

Computational Complexity · Computer Science 2018-03-02 Marek Karpinski , Laszlo Mérai , Igor E. Shparlinski

Let $\Delta= \sum_{m=0}^\infty q^{(2m+1)^2} \in \mathbb{F}_2[[q]]$ be the reduction mod 2 of the $\Delta$ series. A modular form $f$ modulo $2$ of level 1 is a polynomial in $\Delta$. If $p$ is an odd prime, then the Hecke operator $T_p$…

Number Theory · Mathematics 2024-11-21 Jean-Louis Nicolas

Let p be a prime and let F_pbar be the algebraic closure of the finite field of p elements. Let f(x) be any one variable rational function over F_pbar with n poles of orders d_1, ...,d_n. Suppose p is coprime to d_i for every i. We prove…

Number Theory · Mathematics 2007-05-23 Hui June Zhu

Set $ A := Q/({\bf z}) $, where $ Q $ is a polynomial ring over a field, and $ {\bf z} = z_1,\ldots,z_c $ is a homogeneous $ Q $-regular sequence. Let $ M $ and $ N $ be finitely generated graded $ A $-modules, and $ I $ be a homogeneous…

Commutative Algebra · Mathematics 2019-08-14 Dipankar Ghosh , Tony J. Puthenpurakal

Let $R$ be a Dedekind ring, $\mathfrak{p}$ a nonzero prime ideal of $R$, $P\in R[X]$ a monic irreducible polynomial, and $K$ the quotient field of $R$. We give in this paper a lower bound for the $\mathfrak{p}$-adic valuation of the index…

Number Theory · Mathematics 2018-10-09 M. E. Charkani , A. Deajim

Let d>2 and let p be a prime coprime to d. Let Z_pbar be the ring of integers of Q_pbar. Suppose f(x) is a degree-d polynomial over Qbar and Z_pbar. Let P be a prime ideal over p in the ring of integers of Q(f), where Q(f) is the number…

Number Theory · Mathematics 2007-05-23 Hui June Zhu

An integer-valued multiplicative function $f$ is said to be polynomially-defined if there is a nonconstant separable polynomial $F(T)\in \mathbb{Z}[T]$ with $f(p)=F(p)$ for all primes $p$. We study the distribution in coprime residue…

Number Theory · Mathematics 2023-05-31 Paul Pollack , Akash Singha Roy

For nonautonomous, nonuniformly elliptic integrals with so-called $(p,q)$-growth conditions, we show a general interpolation property allowing to get basic higher integrability results for H\"older continuous minimizers under improved…

Analysis of PDEs · Mathematics 2021-03-02 Cristiana De Filippis , Giuseppe Mingione

We obtain a new lower bound on the size of value set f(F_p) of a sparse polynomial f in F_p[X] over a finite field of p elements when p is prime. This bound is uniform with respect of the degree and depends on some natural arithmetic…

Number Theory · Mathematics 2020-02-19 Igor E. Shparlinski , Jose Felipe Voloch

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…

Quantum Physics · Physics 2008-05-12 Andris Ambainis