Zero sets of polynomials: one versus two variables

DOI10.1007/PL00000562MaRDI QIDQ699848zbMATH OpenFDO

Authors Mihai Caragiu

Publication date 25 September 2002

Published in Elemente der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/PL00000562

zbMATH Keywords

irreducible polynomialspolynomials in one and two variablespolynomials over finite fieldszero sets of polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Polynomials over commutative rings (13B25)

Review text

If \(f\) is an irreducible polynomial in one variable over a field \(K\), then either \(f\) is of degree one (and has exactly one zero in \(K\)), or there is no zero of \(f\) in \(K\). The author shows that the situation is radically different when we consider polynomials in two variables. By elementary reasoning, he constructs absolutely irreducible polynomials \(f(X,Y)\in\mathbb F_q[X,Y]\) which satisfy \(f(x,y)=0\) for all \(x,y\in\mathbb F_q\).

Recommendations

• On some classes of irreducible polynomials
• Irreducibility of f(u(x),v(y))
• Zero sets and factorization of polynomials of two variables
• On the irreducibility of some polynomials in two variables
• Number of Irreducible Polynomials in Several Variables over Finite Fields

Cited in

(3)

• Zero sets and factorization of polynomials of two variables
• Zero sets of univariate polynomials
• When Does F(α^d) = F(α)?

This page was built for publication: Zero sets of polynomials: one versus two variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q699848)