Zero sets of polynomials: one versus two variables (Q699848)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Zero sets of polynomials: one versus two variables |
scientific article; zbMATH DE number 1807954
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Zero sets of polynomials: one versus two variables |
scientific article; zbMATH DE number 1807954 |
Statements
Zero sets of polynomials: one versus two variables (English)
0 references
25 September 2002
0 references
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\).
0 references
polynomials in one and two variables
0 references
polynomials over finite fields
0 references
irreducible polynomials
0 references
zero sets of polynomials
0 references