Related papers: Prime rational functions over a field

We investigate finite sets of rational functions $\{ f_{1},f_{2}, \dots, f_{r} \}$ defined over some number field $K$ satisfying that any $t_{0} \in K$ is a $K_{p}$-value of one of the functions $f_{i}$ for almost all primes $p$ of $K$. We…

We find all polynomials f,g,h over a field K such that g and h are linear and f(g(x))=h(f(x)). We also solve the same problem for rational functions f,g,h, in case the field K is algebraically closed.

Consider a finite l-group acting on the affine space of dimension n over a field k, whose characteristic differs from l. We prove the existence of a fixed point, rational over k, in the following cases: --- The field k is p-special for some…

Let $K$ be a number field or a function field of characteristic 0. If $K$ is a number field, assume the $abc$-conjecture for $K$. We prove a variant of Zsigmondy's theorem for ramified primes in preimage fields of rational functions in…

The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.

In this paper, we consider rational functions $f$ with some minor restrictions over the finite field $\mathbb{F}_{q^n},$ where $q=p^k$ for some prime $p$ and positive integer $k$. We establish a sufficient condition for the existence of a…

Polynomials and elements over finite fields exhibit closely related algebraic structures, and many properties defined for elements extend naturally to polynomials. The concepts of order and $\mathbb{F}_q$-Order for elements have been…

For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong…

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

We study how the field of definition of a rational function changes under iteration. We provide a complete classification of polynomials with the property that the field of definition of one of their iterates drops in degree (over a given…

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

We consider the problem of defining polynomials over function fields of positive characteristic. Among other results, we show that the following assertions are true. 1. Let $\G_p$ be an algebraic extension of a field of $p$ elements and…

Let f(t) be a rational function of degree at least 2 with rational coefficients. For a given rational number x_0, define x_{n+1}=f(x_n) for each nonnegative integer n. If this sequence is not eventually periodic, then the difference…

Let k be an algebraically closed field of characteristic zero. An element F from k(x_1,...,x_n) is called a closed rational function if the subfield k(F) is algebraically closed in the field k(x_1,...,x_n). We prove that a rational function…

Let $k$ be an algebraic closed field of characteristic zero. Let $K$ be the rational function field $K=k(t)$. Let $\phi$ be a non isotrivial rational function in $K(z)$. We prove a bound for the cardinality of the set of $K$--rational…

In this paper, we prove the existence of a first-order definition of the polynomial ring over a nonprincipal ultraproduct of finite fields of unbounded cardinalities in its fraction field by a universal-existential formula in the language…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

Let K be a number field, let f(x) in K(x) be a rational function of degree d> 1, and let z in K be a wandering point such that f^n(z) is nonzero for all n > 0. We prove that if the abc-conjecture holds for K, then for all but finitely many…

Given a polynomial $\phi$ over a global function field $K$ and a wandering base point $b\in K$, we give a geometric condition on $\phi$ ensuring the existence of primitive prime divisors for almost all points in the orbit…