Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Sum of degrees of irreducible factors for polynomials in several variables - MaRDI portal

Sum of degrees of irreducible factors for polynomials in several variables (Q933501)

From MaRDI portal





scientific article; zbMATH DE number 5303219
Language Label Description Also known as
English
Sum of degrees of irreducible factors for polynomials in several variables
scientific article; zbMATH DE number 5303219

    Statements

    Sum of degrees of irreducible factors for polynomials in several variables (English)
    0 references
    0 references
    21 July 2008
    0 references
    For a non-zero polynomial in \(\mathbb C[X_1,\dots,X_k]\) whose factorization is \(f=\prod_{i=1}^s p_i^{a_i}\), where the \(p_i\)'s are irreducible and pairwise coprime, and all \(a_i\) are positive, put \[ n_0(f)=\deg\left( \prod_{i=1}^s p_i \right), \qquad n_1(f)=\deg\left( \prod_{1\leq i\leq s,\;a_i=1} p_i \right). \] Using Mason's \(abc\)-theorem, Brindza derived lower bounds for \(n_0(f)\) and \(n_1(f)\) in the univariate case, and later Pintér gave lower bounds for \(n_0(f+g)\) and \(n_1(f+g)\), when \(f\) and \(g\) are relatively prime polynomials in \(\mathbb C[X]\). In the present paper, the author proves lower bounds for \(n_0(f_1+\dots+f_n)\) and \(n_1(f_1+\dots+f_n)\), when \(f_1, \dots f_n\) are pairwise relatively prime polynomials of several variables with complex coefficients.
    0 references
    simple and distinct irreducible factors
    0 references
    polynomials in several variables
    0 references

    Identifiers