The total reducibility order of a polynomial in two variables
Let \(K\) be an algebraically closed field of characteristic zero and let \(P\in K[x,y]\), \(\deg P>0\). \(P\) is called a composite polynomial if there exist \(R\in K[z]\), \(\deg R>1\) and \(Q\in K[x,y]\) such that \(P=R(Q)\). For \(A\in K[x,y]\) let \(\sigma (A)=\{\lambda \in K : A-\lambda\) is reducible\(\}\). For \(\lambda\in \sigma (A)\) let \(A-\lambda =\prod^{n(\lambda)}_{i=1}A_{i\lambda}^{k_{i\lambda}}\) where \(A_{i\lambda}\) are distinct primes. Let \(\rho_{\lambda}(A)=n(\lambda)-1\) and let \(\rho (A)=\sum_{\lambda \in \sigma (A)}\rho_{\lambda}(A)\). The following theorem is proved: If \(A\in K[x,y]\) is not a composite polynomial then \(\rho (A)<\deg A.\) The author also deals with the solutions of the equation \[ \frac{\partial P}{\partial x}\frac{\partial F}{\partial y}- \frac{P}{\partial y}\frac{F}{\partial x}=TF, \] where \(P\in K[x,y]\setminus K\) and \(T\in K[x,y]\) are given polynomials and \(F\in K(x,y)\) is an unknown rational function. It is proved that those polynomials \(T\) for which the equation has nontrivial solutions \(F\) form a free \(\mathbb Z\)-module of finite rank. If \(Q\) is not a composite polynomial such that \(P\in K[Q]\), then the rank of this module is \(\rho(Q)\).
- Reducibility of polynomials in two variables
- Reducibility of polynomials in several variables. II
- On the irreducibility of some polynomials in two variables
- scientific article; zbMATH DE number 1467743
- Reducibility of polynomials in one variable over the rationals
- Reducibility behavior of polynomials with varying coefficients
- Counting reducible and singular bivariate polynomials
- Counting reducible and singular bivariate polynomials
- Reducibility by means of almost polynomial functions
- scientific article; zbMATH DE number 3765914 (Why is no real title available?)
- scientific article; zbMATH DE number 3563286 (Why is no real title available?)
- Linear differential operators related to the Jacobian conjecture have a closed image
- On linear differential operators related to the Jacobian conjecture
- On the density of image of differential operators generated by polynomials
- Reduzibilität ebener Kurven.
- Sur les algèbres de Weyl
- The Jacobian conjecture: Reduction of degree and formal expansion of the inverse
- Relative differential forms and complex polynomials
- Mini-workshop: Interactions between low-dimensional topology and complex algebraic geometry. Abstracts from the mini-workshop held October 22--28, 2017
- Algebraic methods in sum-product phenomena
- Mappings with a composite part and with a constant Jacobian
- Bounding the number of remarkable values via Jouanolou's theorem
- On the geometry of regular maps from a quasi-projective surface to a curve
- A generalization of the Stein-Lorenzini inequality.
- Linear families of smooth hypersurfaces over finitely generated fields
- Ranks of relative-unit-groups related to redset(f)
- Families of polynomials and their specializations
- Free Bertini's theorem and applications
- On composite polynomials
- ON THE KERNEL OF SOME DERIVATIONS OF
- Schwartz-Zippel bounds for two-dimensional products
- On components of polynomial automorphisms in two variables
- On some sufficient conditions for polynomials to be closed polynomials over domains
- EXPANDING POLYNOMIALS ON SETS WITH FEW PRODUCTS
- A note on the spectrum of a rational function
- On the total order of reducibility of a pencil of algebraic plane curves
- Jacobian pairs and Hamiltonian flows
- On certain extremal pencils of curves with respect to the total reducibility order
- The number of reducible hypersurfaces in a pencil. -- Erratum
- On polynomials in three variables annihilated by two locally nilpotent derivations
- Linear differential operators related to the Jacobian conjecture have a closed image
- Reducibility of rational functions in several variables
- Generating series for irreducible polynomials over finite fields
- Indecomposability of polynomials via Jacobian matrix
This page was built for publication: The total reducibility order of a polynomial in two variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q752765)
