English
Related papers

Related papers: Null Polynomials modulo m

200 papers

Let $d\ge4$ and $c\in(-d,d)$ be relatively prime integers. We show that for any sufficiently large integer $n$ (in particular $n>24310$ suffices for $4\le d\le 36$), the smallest prime $p\equiv c\pmod d$ with $p\ge(2dn-c)/(d-1)$ is the…

Number Theory · Mathematics 2015-10-23 Zhi-Wei Sun

Let $P(x)$ be a polynomial of degree $m$, with nonnegative and non-decreasing coefficients. We settle the conjecture that for any positive real number $d$, the coefficients of $P(x+d)$ form a unimodal sequence, of which the special case $d$…

Combinatorics · Mathematics 2008-09-10 Yi Wang , Yeong-Nan Yeh

Let $M$ be a finitely generated module on a local ring $R$ and $\F: M_0\subset M_1\subset...\subset M_t=M$ a filtration of submodules of $M$ such that $ d_o<d_1< ... <d_t=d$, where $d_i=\dim M_i$. This paper is concerned with a non-negative…

Commutative Algebra · Mathematics 2010-03-23 Nguyen Tu Cuong , Doan Trung Cuong , Hoang Le Truong

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

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

Number Theory · Mathematics 2024-01-17 Jitender Singh , Rishu Garg

Call a monic integer polynomial exceptional if it has a root modulo all but a finite number of primes, but does not have an integer root. We classify all irreducible monic integer polynomials $h$ for which there is an irreducible monic…

Number Theory · Mathematics 2023-08-28 Christian Elsholtz , Benjamin Klahn , Marc Technau

Let $p$ be a prime and let $a$ be a positive integer. In this paper we investigate $\sum_{k=0}^{p^a-1}\binom[(h+1)k,k+d]/m^k$ modulo a prime $p$, where $d$ and $m$ are integers with $-h<d<=p^a$ and $m\not=0 (mod p)$. We also study…

Number Theory · Mathematics 2009-09-28 Zhi-Wei Sun

This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials…

Number Theory · Mathematics 2010-01-21 Xavier Taixes i Ventosa , Gabor Wiese

Let $\mathbb{Z}_p[x]$ be the set of all functions whose coefficients are in the field of $p$-adic integers $\mathbb{Z}_p$. This work considers a problem of finding a root of a polynomial equation $P(x)=0$ where $P(x)\in\mathbb{Z}_p[x]$. The…

Numerical Analysis · Mathematics 2016-02-26 Julius Fergy T. Rabago

J.P. Serre showed that for any integer $m,~a(n)\equiv 0 \pmod m$ for almost all $n,$ where $a(n)$ is the $n^{\text{th}}$ Fourier coefficient of any modular form with rational coefficients. In this article, we consider a certain class of…

Number Theory · Mathematics 2024-04-05 Subham Bhakta , S. Krishnamoorthy , R. Muneeswaran

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

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…

Commutative Algebra · Mathematics 2016-12-07 Anuj Jakhar , Neeraj Sangwan

We characterize polynomials having the same set of nonzero cyclic resultants. Generically, for a polynomial $f$ of degree $d$, there are exactly $2^{d-1}$ distinct degree $d$ polynomials with the same set of cyclic resultants as $f$.…

Commutative Algebra · Mathematics 2007-05-23 Christopher J. Hillar

In this paper, we concentrate on counting and testing dominant polynomials with integer coefficients. A polynomial is called dominant if it has a simple root whose modulus is strictly greater than the moduli of its remaining roots. In…

Number Theory · Mathematics 2015-01-13 Artūras Dubickas , Min Sha

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

Number Theory · Mathematics 2023-01-10 Arnaud Bodin , Pierre Dèbes , Salah Najib

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence: $$\sum_{0<i_1<...<i_n<p}(i_1/3)(-1)^{i_1}/(i_1...i_n)=0 (mod p).$$

Number Theory · Mathematics 2010-02-25 Li-Lu Zhao , Zhi-Wei Sun

We consider absolutely irreducible polynomials $f \in Z[x,y]$ with $\deg_x(f)=m$, $\deg_y(f)=n$ and height $H$. We show that for any prime $p$ with $p>c_{mn} H^{2mn+n-1}$ the reduction $f \bmod p$ is also absolutely irreducible. Furthermore…

Number Theory · Mathematics 2007-05-23 Wolfgang M. Ruppert

We give congruences modulo powers of $p \in \{3, 5,7\}$ for the Fourier coefficients of certain modular functions in level $p$ with poles only at 0, answering a question posed by Andersen and the first author and continuing work done by the…

Number Theory · Mathematics 2020-04-02 Paul Jenkins , Ryan Keck

Let $f(z)$ be in $1+z\mathbb{Q}[[z]]$ and $\mathcal{S}$ be an infinite set of prime numbers such that, for all $p\in\mathcal{S}$, we can reduce $f(z)$ modulo $p$. We let $f(z)_{\mid p}$ denote the reduction of $f(z)$ modulo $p$. Generally,…

Number Theory · Mathematics 2023-02-10 Daniel Vargas Montoya

Let $\mathbb{F}_q$ denote the finite field of characteristic $p$ and order $q$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic rational integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. Given two positive…

Number Theory · Mathematics 2023-10-25 Weihua Li , Wei Cao