Reducibility of polynomials in two variables
The author generalizes classical theorems on irreducibility of polynomials of the form \(f(x)+a\) to two variables. Let \(K\) be an algebraically closed field. Extending the case of a single variable, a polynomial \(f \in K[x,y]\) is not a composite polynomial if \(f(x,y)\) cannot be written as \(h(g(x,y))\) with \(g \in K[x,y]\) and \(h \in K[z]\) of degree at least 2. If \(f(x,y)= \prod^{N+1}_{i=1} L_ i(x,y)^{r_ i}\) is a product of linear polynomials, \(N>0\), and \(\{(x,y) \in K^ 2:L_ 1(x,y)=L_ 2(x,y)=0\} \neq \emptyset\), \(\text{gcd} (r_ 1,\dots,r_{N+1})=1\), then \(f\) is not a composite polynomial and for every \(a \in K^ \times\), \(f(x,y)+a\) is irreducible over \(K\). The theorem is deduced from a more general result. Methods of algebraic geometry are used.
- An irreducibility criterion for polynomials in several variables
- On the irreducibility of some polynomials in two variables
- Irreducibility results for compositions of polynomials in several variables
- Irreducible multivariate polynomials obtained from polynomials in fewer variables
- Irreducibility criteria for compositions of multivariate polynomials over arbitrary fields
- Reducibility of polynomials in several variables. II
- Canonical forms of irreducible polynomials of second degree in each of two complex variables
- A note on polynomial reduction
- Mini-workshop: Interactions between low-dimensional topology and complex algebraic geometry. Abstracts from the mini-workshop held October 22--28, 2017
- Irreducibility of f(u(x),v(y))
- Bounding the number of remarkable values via Jouanolou's theorem
- Irreducibility of a sum of polynomials depending on disjoint sets of variables
- Subgroups generated by rational functions in finite fields
- On the geometry of regular maps from a quasi-projective surface to a curve
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
- Irreducibility results for compositions of polynomials in several variables
- A generalization of the Stein-Lorenzini inequality.
- Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields
- A bound for the degree of a system of equations determining the variety of reducible polynomials
- Families of polynomials and their specializations
- scientific article; zbMATH DE number 93939 (Why is no real title available?)
- Nontrivial rational polynomials in two variables have reducible fibres
- On the irreducibility of some polynomials in two variables
- scientific article; zbMATH DE number 2164375 (Why is no real title available?)
- Irreducibility of Hypersurfaces
- Reducibility of polynomials over algebraic number fields
- Reducibility of polynomials of the form f(x)-g(y)
- Nearly irreducibility of polynomials and the Newton diagrams
- A note on the spectrum of a rational function
- On the total order of reducibility of a pencil of algebraic plane curves
- Linear systems of geometrically irreducible plane cubics over finite fields
- The total reducibility order of a polynomial in two variables
- On certain extremal pencils of curves with respect to the total reducibility order
- The number of reducible hypersurfaces in a pencil. -- Erratum
- Low-degree planar monomials in characteristic two
- An algebraic geometry version of the Kakeya problem
- Reducibility of rational functions in several variables
- Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem
This page was built for publication: Reducibility of polynomials in two variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1312863)
