Related papers: Bhargava factorials and irreducibility of integer-…

For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…

We study the number of irreducible polynomials over $\mathbf{F}_{q}$ with some coefficients prescribed. Using the technique developed by Bourgain, we show that there is an irreducible polynomial of degree $n$ with $r$ coefficients…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.

The free singularity locus of a noncommutative polynomial f is defined to be the sequence $Z_n(f)=\{X\in M_n^g : \det f(X)=0\}$ of hypersurfaces. The main theorem of this article shows that f is irreducible if and only if $Z_n(f)$ is…

Given an integral domain $D$ with quotient field $K$, the ring of integer-valued polynomials on D is the subring $\{f (X) \in K[X]: f(D) \subset D\}$ of the polynomial ring $K[X]$. Using the related tools of $t$-closure and associated…

Integer factorization is a fundamental problem in algorithmic number theory and computer science. It is considered as a one way or trapdoor function in the (RSA) cryptosystem. To date, from elementary trial division to sophisticated methods…

We provide a sufficient condition for a polynomial ring, not necessarily commutative, to have a first-order definition for the rational integers.

We provide an irreducibility test and factoring algorithm (with some qualifications) for formal power series in the unique factorization domain $R[[X]]$, where $R$ is any principal ideal domain. We also classify all integral domains arising…

Schinzel's Hypothesis H is a general conjecture in number theory on prime values of polynomials that generalizes, e.g., the twin prime conjecture and Dirichlet's theorem on primes in arithmetic progression. We prove an arithmetic analog of…

We prove a quantitative version of Hilbert's irreducibility theorem for function fields: If $f(T_1,\ldots, T_n,X)$ is an irreducible polynomial over the field of rational functions over a finite field $\mathbb{F}_q$ of characteristic $p$,…

We say that a monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N\ge 2$ is 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…

In this paper we construct an infinite sequence of binary irreducible polynomials starting from any irreducible polynomial $f_0 \in \F_2 [x]$. If $f_0$ is of degree $n = 2^l \cdot m$, where $m$ is odd and $l$ is a non-negative integer,…

Morton and Vivaldi defined the polynomials whose roots are parabolic parameters for a one-parameter family of polynomial maps. We call these polynomials delta factors. They conjectured that delta factors are irreducible for the family…

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…

Jakhar shown that for $f(x)=a_nx^n + a_{n-1}x^{n-1}+\cdot+ a_0$ ($a_0\neq 0$) is a polynomial with rational coefficients, if there exists a prime integer $p$ satisfying $\nu_p(a_n)=0$ and $n\nu_p(a_i)\ge (n-i)\nu_p(a_0)> 0$ for every $0\le…

Let R be an integral domain and let f(X) be a nonzero polynomial in R[X]. The content of f is the ideal c(f) generated by the coefficients of f. The polynomial f(X) is called Gaussian if c(fg)=c(f)c(g) for all g(X) in R[X]. It is well known…

For a subgroup of $PGL(2,q)$ we show how some irreducible polynomials over $\mathbb{F}_q$ arise from the field of invariant rational functions. The proofs rely on two actions of $PGL(2,F)$, one on the projective line over a field $F$ and…

Let $K$ be a global field and $n > 1$ an integer. We show $n$ is composite if and only if there is an irreducible polynomial $f(x) \in K[x]$ of degree $n$ which is reducible $q$-adically for all the primes $q$ of $K$.

For a polynomial $f$ from a class $\mathcal{C}$ of polynomials, we show that the problem to compute all the constant degree irreducible factors of $f$ reduces in polynomial time to polynomial identity tests (PIT) for class $\mathcal{C}$ and…