English
Related papers

Related papers: On the Bateman-Horm Conjecture about Polynomial Ri…

200 papers

We prove the irreducibility of integer polynomials $f(X)$ whose roots lie inside an Apollonius circle associated to two points on the real axis with integer abscisae $a$ and $b$, with ratio of the distances to these points depending on the…

Number Theory · Mathematics 2021-03-30 Anca Iuliana Bonciocat , Nicolae Ciprian Bonciocat , Yann Bugeaud , Mihai Cipu

The subset of quadratic primes {p = an^2 + bn + c : n => 1} generated by an irreducible polynomial f(x) = ax^2 + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a…

General Mathematics · Mathematics 2015-04-03 N. A. Carella

We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…

Number Theory · Mathematics 2025-11-19 Oleksiy Klurman , Vlad Matei

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

Number Theory · Mathematics 2020-11-24 Yuri Bilu , Florian Luca

We improve Bombieri's asymptotic sieve to localise the variables. As a consequence, we prove, under a Elliott-Halberstam conjecture, that there exists an infinity of twins almost prime. Those are prime numbers $p$ such that for all…

Number Theory · Mathematics 2019-07-16 Nathalie Debouzy

The Schinzel hypothesis essentially claims that finitely many irreducible polynomials in one variable over Z simultaneously assume infinitely many prime values unless there is an obvious reason why this is impossible. We prove that under a…

Number Theory · Mathematics 2016-03-29 Andreas O. Bender , Olivier Wittenberg

Let $p$ be a prime and $q$ a power of $p$. For $n\ge 0$, let $g_{n,q}\in\Bbb F_p[{\tt x}]$ be the polynomial defined by the functional equation $\sum_{a\in\Bbb F_q}({\tt x}+a)^n=g_{n,q}({\tt x}^q-{\tt x})$. When is $g_{n,q}$ a permutation…

Combinatorics · Mathematics 2012-08-15 Neranga Fernando , Xiang-dong Hou , Stephen D. Lappano

Let $p>3$ and consider a prime power $q=p^h$. We completely characterize permutation polynomials of $\mathbb{F}_{q^2}$ of the type $f_{a,b}(X) = X(1 + aX^{q(q-1)} + bX^{2(q-1)}) \in \mathbb{F}_{q^2}[X]$. In particular, using connections…

Combinatorics · Mathematics 2019-11-22 Daniele Bartoli , Marco Timpanella

In this short paper we shall prove that there exist infinitely many consecutive square-free numbers of the form $[\alpha p]$, $[\alpha p]+1$, where $p$ is prime and $\alpha>0$ is irrational algebraic number. We also establish an asymptotic…

Number Theory · Mathematics 2019-07-09 S. I. Dimitrov

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

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

Commutative Algebra · Mathematics 2007-06-11 Arnaud Bodin

We study the number of prime polynomials of degree $n$ over $\mathbb{F}_q$ in which the $i^{th}$ coefficient is either preassigned to be $a_i \in \mathbb{F}_q$ or outside a small set $S_i \subset \mathbb{F}_q$. This serves as a function…

Number Theory · Mathematics 2017-12-13 Eyal Moses

Let $q>2$ be a prime power and $f=-{\tt x}+t{\tt x}^q+{\tt x}^{2q-1}$, where $t\in\Bbb F_q^*$. We prove that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following occurs: (i) $q$ is even and…

Number Theory · Mathematics 2013-03-05 Xiang-dong Hou

For an integer $r$, a prime power $q$, and a polynomial $f$ over a finite field ${\mathbb F}_{q^r}$ of $q^r$ elements, we obtain an upper bound on the frequency of elements in an orbit generated by iterations of $f$ which fall in a proper…

Number Theory · Mathematics 2014-07-29 Oliver Roche-Newton , Igor Shparlinski

Let $f=ax+x^{r(q-1)+1}\in \mathbb{F}_{q^2}^*[x], r\in \{5,7\}.$ We give explicit conditions on the values $(q,a)$ for which $f$ is a permutation polynomials of $\mathbb{F}_{q^2}.$

Number Theory · Mathematics 2014-06-19 Stephen Lappano

For each prime p other than 3, and each power q=p^k, we present two large classes of permutation polynomials over F_{q^2} of the form X^r B(X^{q-1}) which have at most five terms, where B(X) is a polynomial with coefficients in {1,-1}. The…

Number Theory · Mathematics 2025-01-09 Zhiguo Ding , Michael E. Zieve

Let $\mathbb{F}_q$ denote the finite field of $q$ elements and $\mathbb{F}_{q^n}$ the degree $n$ extension of $\mathbb{F}_q$. A normal basis of $\mathbb{F}_{q^n}$ over $\mathbb{F} _q$ is a basis of the form…

Number Theory · Mathematics 2018-07-27 Hua Huang , Shanmeng Han , Wei Cao

For k greater than 1 and r different from 0, let pi^k_{2r}(x) denote the number of prime pairs (p,p^k+2r) with p not exceeding (large) x. By the Bateman-Horn conjecture, the function pi^k_{2r}(x) should be asymptotic to…

Number Theory · Mathematics 2008-06-11 Fokko van de Bult , Jaap Korevaar

The probability for two monic polynomials of a positive degree n with coefficients in the finite field F_q to be relatively prime turns out to be identical with the probability for an n x n Hankel matrix over F_q to be nonsingular.…

Combinatorics · Mathematics 2011-02-10 Mario Garcia Armas , Sudhir R. Ghorpade , Samrith Ram

A polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called \emph{monogenic} if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

Number Theory · Mathematics 2022-04-19 Joshua Harrington , Lenny Jones
‹ Prev 1 3 4 5 6 7 10 Next ›