English
Related papers

Related papers: Null Polynomials modulo m

200 papers

A method of constructing specific polynomial representations $f(x)$ over the finite field $\mathbb{F}_p$ of the square roots function modulo a prime $p = 2^kn + 1$, $n$ odd, is presented. The formulas for the cases $k = 2$, $3$ and $4$ are…

Number Theory · Mathematics 2023-12-19 N. A. Carella

Let $p$ be an odd prime number. We prove that for $m\equiv1\mod p$, $x^m$ is perfectly nonlinear over $\mathbb{F}_{p^n}$ for infinitely many $n$ if and only if $m$ is of the form $p^l+1$, $l\in\mathbb{N}$. First, we study singularities of…

Number Theory · Mathematics 2012-05-04 Elodie Leducq

Let $\mathcal{N} \neq \{0\}$ be a fixed set of integers, closed under multiplication, closed under negation, or containing $\{\pm 1\}$. We prove that any zero of a polynomial in $\mathbf{Z}[X]$ whose coefficients lie in $\mathcal{N}$ can be…

Dynamical Systems · Mathematics 2024-12-13 David Hokken

For a polynomial $u(x)$ in $\mathbb{Z}[x]$ and $r\in\mathbb{Z}$, we consider the orbit of $u(x)$ at $r$, $\mathcal{O}_u(r):=\{u(r),u(u(r)),\ldots\}$. We ask two questions here: (i) what are the polynomials $u$ for which $0\in…

Number Theory · Mathematics 2023-05-30 Sayak Sengupta

Two conjectures, posed by Finch-Smith, Harrington, and Wong in a paper published in Integers in $2023$, are proven. Given a monic biquadratic polynomial $f(x) = x^4 + cx^2 + e$, we prove a formula for the sum of its distinct outputs modulo…

Number Theory · Mathematics 2023-09-26 Samer Seraj

Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi and…

Number Theory · Mathematics 2023-10-05 Tong Lin , Qiang Wang

Consider an ordinary generating function $\sum_{k=0}^{\infty}c_kx^k$, of an integer sequence of some combinatorial relevance, and assume that it admits a closed form $C(x)$. Various instances are known where the corresponding truncated sum…

Number Theory · Mathematics 2017-03-08 Sandro Mattarei , Roberto Tauraso

The relationship between a polynomial's zeros and factors is well known. If a is a zero of f(x) then (x-a) is a factor of f(x). In this paper, we generalize this idea to polynomials of two variables and with real coefficients. We consider…

Algebraic Geometry · Mathematics 2012-10-22 Micki Balaich , Mihail Cocos

Let $\xi$ and $m$ be integers satisfying $\xi\ne 0$ and $m\ge 3$. We show that for any given integers $a$ and $b$, $b \neq 0$, there are $\frac{\varphi(m)}{2}$ reduced residue classes modulo $m$ each containing infinitely many primes $p$…

Number Theory · Mathematics 2018-09-12 Anne-Maria Ernvall-Hytönen , Tapani Matala-aho , Louna Seppälä

The Ap\'ery polynomials are given by $$A_n(x)=\sum_{k=0}^n\binom nk^2\binom{n+k}k^2x^k\ \ (n=0,1,2,\ldots).$$ (Those $A_n=A_n(1)$ are Ap\'ery numbers.) Let $p$ be an odd prime. We show that…

Number Theory · Mathematics 2014-04-29 Zhi-Wei Sun

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…

Number Theory · Mathematics 2019-08-23 Jitender Singh , Sanjeev Kumar

Let $m$ and $k \geq 2$ be positive integers. We show that polynomial $P = (1+x)^m(1+x^k)$ is strongly unimodal (frequently known as {\it log concave\/}) if and only if $m \geq k^2 -3$; this is also the criterion for $P$ to be merely…

Combinatorics · Mathematics 2018-04-05 David Handelman

Let $p$ be an odd prime, and let $m$ be an integer with $p\nmid m$. In this paper show that $$\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom ak\binom{-1-a}k}{m^k} \equiv 0\pmod p \quad\hbox{implies}\quad\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom ak…

Number Theory · Mathematics 2015-03-12 Zhi-Hong Sun

We consider a certain class of multiplicative functions $f: \mathbb N \rightarrow \mathbb C$ and study the distribution of zeros of Dirichlet polynomials $F_N(s)= \sum_{n\le N} f(n)n^{-s}$ corresponding to these functions. We prove that the…

Number Theory · Mathematics 2019-12-10 Arindam Roy , Akshaa Vatwani

For every $m\in\mathbb{N}$, we establish the convergence of the averaged distributions of the zeros of the $m$-th order derivatives $(f^n)^{(m)}$ of the iterated polynomials $f^n$ of a polynomial $f\in\mathbb{C}[z]$ of degree $>1$ towards…

Dynamical Systems · Mathematics 2024-01-10 Yûsuke Okuyama

The reduction modulo $p$ of a family of lacunary integer polynomials, associated with the dynamical zeta function $\zeta_{\beta}(z)$ of the $\beta$-shift, for $\beta > 1$ close to one, is investigated. We briefly recall how this family is…

Number Theory · Mathematics 2022-01-11 Denys Dutykh , Jean-Louis Verger-Gaugry

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

Logic · Mathematics 2015-10-06 Robert Lubarsky , Fred Richman

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

We study integral almost square-free modular categories; i.e., integral modular categories of Frobenius-Perron dimension $p^nm$, where $p$ is a prime number, $m$ is a square-free natural number and ${\rm gcd}(p,m)=1$. We prove that if…

Category Theory · Mathematics 2016-05-24 Jingcheng Dong , Libin Li , Li Dai

Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…

Symbolic Computation · Computer Science 2023-02-14 Rémi Imbach , Guillaume Moroz