Note on Factorable Polynomials
Canadian mathematical bulletin, Tome 12 (1969) no. 5, pp. 589-595
Voir la notice de l'article provenant de la source Cambridge
Let X1, X2,..., Xk, denote k ≥ 2 indeterminates and let f(X1,..., Xk) be a homogeneous polynomial, in GF(pn) [X1,..., Xk], which is irreducible but not absolutely irreducible over GF(pn). Thus f is irreducible in GF(pn)[X1,..., Xk] but reducible in some GF(pnm) [X1,..., Xk], m > 1. For any polynomial h(X1,..., Xk) in GF(pnl)[X1,..., Xk, l ≥ 1, let Npn (h) denote the number of (x1,..., xk) ∈ GF(pn)×...× GF(pn) such that (hx1..., xk) = 0.
Williams, Kenneth S. Note on Factorable Polynomials. Canadian mathematical bulletin, Tome 12 (1969) no. 5, pp. 589-595. doi: 10.4153/CMB-1969-076-4
@article{10_4153_CMB_1969_076_4,
author = {Williams, Kenneth S.},
title = {Note on {Factorable} {Polynomials}},
journal = {Canadian mathematical bulletin},
pages = {589--595},
year = {1969},
volume = {12},
number = {5},
doi = {10.4153/CMB-1969-076-4},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1969-076-4/}
}
Cité par Sources :