A polynomial with coefficients from a finite field GF (q) that is the product of linear polynomials is usually referred to as a Rédei polynomial. This is due to the appearance of the polynomial R(T, S) = (x,y)∈A (T − xS + y), where A is some subset of GF (q)2, in the book of Rédei [15] from the early seventies. In the affine plane AG(2, q) the point (x, y) is incident with the line Y = mX + α if and only if α = −mx + y. Hence −α is a root of R(T,m) of multiplicity k if and only if the line Y = mX + α is incident with k points of the set A. This observation allows one to look at a problem of the following type: Given a subset of points of the affine plane that has restricted intersection properties with the lines of the plane, say somethin...
AbstractLet α,β∈Fqt∗ and let Nt(α,β) denote the number of solutions (x,y)∈Fqt∗×Fqt∗ of the equation ...
SIGLEAvailable from British Library Document Supply Centre- DSC:DX86869 / BLDSC - British Library Do...
AbstractThe recently developed algorithm of Niederreiter for the factorization of polynomials over f...
The problem for which Rédei introduced the polynomial R(T , S) was that of determining those functio...
A most efficient way of investigating combinatorially defined point sets in spaces over finite field...
AbstractBurde's theory about p-dimensionalvectorsmodulop (J. Reine Angew. Math. 268/269 (1974) 302–3...
The problem of finding roots in F of polynomials in F[x] for F = GF(qm), where q is a prime or prime...
AbstractStarting with a result in combinatorial number theory we prove that (apart from a couple of ...
Let 3ίΓ be a finite field of characteristic p that contains exactly q elements. Let F(x) be a polyno...
The main objective of this work is to solve problems and demonstrate theorems of euclidean plane ge...
AbstractWe study the factorization of polynomials of the form Fr(x)=bxqr+1−axqr+dx−c over the finite...
It is illustrated how elementary properties of polynomials can be used to attack extremal problems i...
A method of using polynomials to describe objects in finite geometries is outlined and the problems...
Following [P. Pederson, et al. 94] and based on [H. Hong et al. 95] we develop several algorithms to...
Abstract. Starting with a result in combinatorial number theory we prove that (apart from a couple o...
AbstractLet α,β∈Fqt∗ and let Nt(α,β) denote the number of solutions (x,y)∈Fqt∗×Fqt∗ of the equation ...
SIGLEAvailable from British Library Document Supply Centre- DSC:DX86869 / BLDSC - British Library Do...
AbstractThe recently developed algorithm of Niederreiter for the factorization of polynomials over f...
The problem for which Rédei introduced the polynomial R(T , S) was that of determining those functio...
A most efficient way of investigating combinatorially defined point sets in spaces over finite field...
AbstractBurde's theory about p-dimensionalvectorsmodulop (J. Reine Angew. Math. 268/269 (1974) 302–3...
The problem of finding roots in F of polynomials in F[x] for F = GF(qm), where q is a prime or prime...
AbstractStarting with a result in combinatorial number theory we prove that (apart from a couple of ...
Let 3ίΓ be a finite field of characteristic p that contains exactly q elements. Let F(x) be a polyno...
The main objective of this work is to solve problems and demonstrate theorems of euclidean plane ge...
AbstractWe study the factorization of polynomials of the form Fr(x)=bxqr+1−axqr+dx−c over the finite...
It is illustrated how elementary properties of polynomials can be used to attack extremal problems i...
A method of using polynomials to describe objects in finite geometries is outlined and the problems...
Following [P. Pederson, et al. 94] and based on [H. Hong et al. 95] we develop several algorithms to...
Abstract. Starting with a result in combinatorial number theory we prove that (apart from a couple o...
AbstractLet α,β∈Fqt∗ and let Nt(α,β) denote the number of solutions (x,y)∈Fqt∗×Fqt∗ of the equation ...
SIGLEAvailable from British Library Document Supply Centre- DSC:DX86869 / BLDSC - British Library Do...
AbstractThe recently developed algorithm of Niederreiter for the factorization of polynomials over f...