AbstractThis work is a continuation and extension of our earlier articles on irreducible polynomials. We investigate the irreducibility of polynomials of the form g(f(x)) over an arbitrary but fixed totally real algebraic number field L, where g(x) and f(x) are monic polynomials with integer coefficients in L, g is irreducible over L and its splitting field is a totally imaginary quadratic extension of a totally real number field. A consequence of our main result is as follows. If g is fixed then, apart from certain exceptions f of bounded degree, g(f(x)) is irreducible over L for all f having distinct roots in a given totally real number field
In 1956, Ehrenfeucht proved that a polynomial f <SUB>1</SUB>(x <SUB>1</SUB>) + · + f <SUB>n</SUB> (x...
In this thesis we consider some problems concerning polynomials over finite fields. The first topic...
AbstractLet K be a field of characteristic 0. We produce families of polynomials f(x,y), irreducible...
It is well known that if f(x) is a monic irreducible polynomial of degree d with coefficients in a c...
AbstractWe characterize the polynomials P(X, Y) that are irreducible over a number field K and such ...
Some generalizations of the classical Eisenstein and Schönemann Irreducibility Criteria and their ap...
Some generalizations of the classical Eisenstein and Schönemann Irreducibility Criteria and their ap...
One of the fundamental tasks of Symbolic Computation is the factorization of polynomials into irredu...
In this note, we show that, for any f ∈ Z[x] and any prime number p, there exists g ∈ Z[x] for which...
AbstractWe prove a criterion for the irreducibility of the polynomials in one indeterminate with the...
Abstract. A class of irreducible polynomials P over a valued field (F, v) is introduced, which is th...
Let ν be a valuation of any rank of a field K with value group G<SUB>ν</SUB> and f(X)= X<SUP>m</SUP>...
In this note, we show that, for any f∈ℤx and any prime number p, there exists g∈ℤx for which the pol...
In many mathematical investigations such as determination of degree of a field extension, determinat...
ii Consider a polynomial f(x) having non-negative integer coefficients with f(b) prime for some inte...
In 1956, Ehrenfeucht proved that a polynomial f <SUB>1</SUB>(x <SUB>1</SUB>) + · + f <SUB>n</SUB> (x...
In this thesis we consider some problems concerning polynomials over finite fields. The first topic...
AbstractLet K be a field of characteristic 0. We produce families of polynomials f(x,y), irreducible...
It is well known that if f(x) is a monic irreducible polynomial of degree d with coefficients in a c...
AbstractWe characterize the polynomials P(X, Y) that are irreducible over a number field K and such ...
Some generalizations of the classical Eisenstein and Schönemann Irreducibility Criteria and their ap...
Some generalizations of the classical Eisenstein and Schönemann Irreducibility Criteria and their ap...
One of the fundamental tasks of Symbolic Computation is the factorization of polynomials into irredu...
In this note, we show that, for any f ∈ Z[x] and any prime number p, there exists g ∈ Z[x] for which...
AbstractWe prove a criterion for the irreducibility of the polynomials in one indeterminate with the...
Abstract. A class of irreducible polynomials P over a valued field (F, v) is introduced, which is th...
Let ν be a valuation of any rank of a field K with value group G<SUB>ν</SUB> and f(X)= X<SUP>m</SUP>...
In this note, we show that, for any f∈ℤx and any prime number p, there exists g∈ℤx for which the pol...
In many mathematical investigations such as determination of degree of a field extension, determinat...
ii Consider a polynomial f(x) having non-negative integer coefficients with f(b) prime for some inte...
In 1956, Ehrenfeucht proved that a polynomial f <SUB>1</SUB>(x <SUB>1</SUB>) + · + f <SUB>n</SUB> (x...
In this thesis we consider some problems concerning polynomials over finite fields. The first topic...
AbstractLet K be a field of characteristic 0. We produce families of polynomials f(x,y), irreducible...