Let $F$ be a field of prime characteristic $p$ and let $q$ be a power of $p$. We assume that $F$ contains the finite field of order $q$. A $q$-polynomial $L$ over $F$ is an element of the polynomial ring $F[x]$ with the property that those powers of $x$ that occur as terms of $L$ with nonzero coefficient have exponent a power of $q$. If the exponent of the leading term of $L$ is $q^n$, we say that $L$ has $q$-degree $n$. We assume that the coefficient of the $x$ term of $L$ is nonzero. We investigate the Galois group $G$, say, of $L$ over $F$, under the assumption that $L(x)/x$ is irreducible in $F[x]$. It is well known that if $L$ has $q$-degree $n$, its roots are an $n$-dimensional vector space over the field of order $q$ and $G$ acts lin...
AbstractLetk=GF(q) be the finite field of orderq. Letf1(x),f2(x)∈k[x] be monic relatively prime poly...
AbstractThere has been some interest in finding irreducible polynomials of the type f(A(x)) for cert...
For an arbitrary q-polynomial f over GF(q^n) we study the problem of finding those q-polynomials g o...
AbstractWe describe a technique for determining the set-transitivity of the Galois group of a polyno...
Ideas and techniques from Khare´s and Wintenberger’s preprint on the proof of Serre’s conjecture for...
Ideas and techniques from Khare´s and Wintenberger’s preprint on the proof of Serre’s conjecture for...
Ideas and techniques from Khare´s and Wintenberger’s preprint on the proof of Serre’s conjecture for...
We propound a descent principle by which previously constructed equations over GF(qn)(X) may be defo...
The determination of polynomials over ℚ(t) with a given primitive nonsolvable permutation group of d...
AbstractWe present characterization theorems for polynomials of prime degree p ≥ 5 over Q with Frobe...
We propound a descent principle by which previously constructed equations over GF(qn)(X) may be defo...
AbstractWe give conditions under which the Galois group of the polynomial Xn + aX1 + b over the rati...
AbstractA primitive element of the Galois ring GR(pn, m) is an element of the group U of units whose...
AbstractPractical computational techniques are described to determine the Galois group of a polynomi...
AbstractFor a natural number n and a prime power q the general, special, projective general and proj...
AbstractLetk=GF(q) be the finite field of orderq. Letf1(x),f2(x)∈k[x] be monic relatively prime poly...
AbstractThere has been some interest in finding irreducible polynomials of the type f(A(x)) for cert...
For an arbitrary q-polynomial f over GF(q^n) we study the problem of finding those q-polynomials g o...
AbstractWe describe a technique for determining the set-transitivity of the Galois group of a polyno...
Ideas and techniques from Khare´s and Wintenberger’s preprint on the proof of Serre’s conjecture for...
Ideas and techniques from Khare´s and Wintenberger’s preprint on the proof of Serre’s conjecture for...
Ideas and techniques from Khare´s and Wintenberger’s preprint on the proof of Serre’s conjecture for...
We propound a descent principle by which previously constructed equations over GF(qn)(X) may be defo...
The determination of polynomials over ℚ(t) with a given primitive nonsolvable permutation group of d...
AbstractWe present characterization theorems for polynomials of prime degree p ≥ 5 over Q with Frobe...
We propound a descent principle by which previously constructed equations over GF(qn)(X) may be defo...
AbstractWe give conditions under which the Galois group of the polynomial Xn + aX1 + b over the rati...
AbstractA primitive element of the Galois ring GR(pn, m) is an element of the group U of units whose...
AbstractPractical computational techniques are described to determine the Galois group of a polynomi...
AbstractFor a natural number n and a prime power q the general, special, projective general and proj...
AbstractLetk=GF(q) be the finite field of orderq. Letf1(x),f2(x)∈k[x] be monic relatively prime poly...
AbstractThere has been some interest in finding irreducible polynomials of the type f(A(x)) for cert...
For an arbitrary q-polynomial f over GF(q^n) we study the problem of finding those q-polynomials g o...