English
Related papers

Related papers: Polynomial products modulo primes and applications

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

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

Number Theory · Mathematics 2017-04-28 Carlos D'Andrea , Alina Ostafe , Igor E. Shparlinski , Martin Sombra

For a polynomial $F(t,A_1,\ldots,A_n)\in\mathbf{F}_p[t,A_1,\ldots,A_n]$ ($p$ being a prime number) we study the factorization statistics of its specializations $$F(t,a_1,\ldots,a_n)\in\mathbf{F}_p[t]$$ with $(a_1,\ldots,a_n)\in S$, where…

Number Theory · Mathematics 2018-12-27 Alexei Entin

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

We study the algebraic dynamical systems generated by triangular systems of rational functions and estimate the height growth of iterations generated by such systems. Further, using a result on the reduction modulo primes of systems of…

Number Theory · Mathematics 2021-02-09 Sudhansu Sekhar Rout

We obtain a new bound for the number of solutions to polynomial equations in cosets of multiplicative subgroups in finite fields, which generalises previous results of P. Corvaja and U. Zannier (2013). We also obtain a conditional…

Number Theory · Mathematics 2020-05-13 Sergei V. Konyagin , Igor E. Shparlinski , Ilya V. Vyugin

In this paper we study some products related to quadratic residues and quartic residues modulo primes. Let $p$ be an odd prime and let $A$ be any integer. We mainly determine completely the product $$f_p(A):=\prod_{1\le i,j\le(p-1)/2\atop…

Number Theory · Mathematics 2020-09-11 Zhi-Wei Sun

We study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field…

Number Theory · Mathematics 2023-09-19 Lior Bary-Soroker , Noam Goldgraber

We prove, that the sequence $1!, 2!, 3!, \dots$ produces at least $(\sqrt{2} + o(1))\sqrt{p}$ distinct residues modulo prime $p$. Moreover, factorials on an interval $\mathcal{I} \subseteq \{0, 1, \dots, p - 1\}$ of length $N > p^{7/8 +…

Number Theory · Mathematics 2024-04-16 A. Grebennikov , A. Sagdeev , A. Semchankau , A. Vasilevskii

We study number theoretic properties of the map $x \mapsto x^{x} \mod{p}$, where $x \in \{1,2,\ldots,p-1\}$, and improve on some recent upper bounds, due to Kurlberg, Luca, and Shparlinski, on the number of primes $p < N$ for which the map…

Number Theory · Mathematics 2017-07-05 Adam Tyler Felix , Pär Kurlberg

Given a natural number $n \geq 4$ we show that there exists infinitely many polynomials $f_{n}(x):= \prod_{i=1}^{n} (x^{2} - a_{i})$ such that (i) $f_{n}(x)$ has a root modulo every positive integer, (ii) $f_{n}(x)$ has no rational roots,…

Number Theory · Mathematics 2022-07-19 Bhawesh Mishra

Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the iterated…

Computational Complexity · Computer Science 2014-07-15 David Harvey , Joris van der Hoeven , Grégoire Lecerf

We study the complexity of representing polynomials as a sum of products of polynomials in few variables. More precisely, we study representations of the form $$P = \sum_{i = 1}^T \prod_{j = 1}^d Q_{ij}$$ such that each $Q_{ij}$ is an…

Computational Complexity · Computer Science 2015-04-24 Mrinal Kumar , Shubhangi Saraf

Let $p>3$ be a prime. Gauss first introduced the polynomial $S_p(x)=\prod_{c}(x-\zeta_p^c),$ where $0<c<p$ and $c$ varies over all quadratic residues modulo $p$ and $\zeta_p=e^{2\pi i/p}$. Later Dirichlet investigated this polynomial and…

Number Theory · Mathematics 2025-03-04 Hai-Liang Wu , Yue-Feng She

We study the properties of the product, which runs over the primes, $$\mathfrak{p}_n = \prod_{s_p(n) \, \geq \, p} p \quad (n \geq 1),$$ where $s_p(n)$ denotes the sum of the base-$p$ digits of $n$. One important property is the fact that…

Number Theory · Mathematics 2017-10-16 Bernd C. Kellner

We prove that the sequence $n!\,(\bmod\,p)$ occupies at least $\sqrt{\frac{3}{2}N}$ residue classes in the short interval $H\le n \le H+N$ and $N\gg p^{\frac{1}{4}}$ improving previously known trivial bound $\sqrt{N}.$ In the other…

Number Theory · Mathematics 2015-05-07 Oleksiy Klurman , Marc Munsch

For odd primes $p$ we consider the factors \[ A(p)=\frac{p-\chi_4(p)}{p+\chi_4(p)}, \qquad \chi_4(p)= \begin{cases} 1,&p\equiv 1\pmod 4, \\ -1,&p\equiv 3\pmod 4, \end{cases} \] and study products of $A(p)$ restricted to unions of residue…

General Mathematics · Mathematics 2026-05-12 Mike Winkler

For a large prime $p$, and a polynomial $f$ over a finite field $F_p$ of $p$ elements, we obtain a lower bound on the size of the multiplicative subgroup of $F_p^*$ containing $H\ge 1$ consecutive values $f(x)$, $x = u+1, \ldots, u+H$,…

Number Theory · Mathematics 2014-01-28 Igor E. Shparlinski

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

Number Theory · Mathematics 2022-01-19 Amit Ghosh , Kenneth Ward

We study the existence of products of primes in arithmetic progressions, building on the work of Ramar\'e and Walker. One of our main results is that if $q$ is a large modulus, then any invertible residue class mod $q$ contains a product of…

Number Theory · Mathematics 2022-08-12 Barnabás Szabó
‹ Prev 1 2 3 10 Next ›