Topology and Factorization of Polynomials

نویسنده

  • HANI SHAKER
چکیده

For any polynomial P ∈ C[X1, X2, ..., Xn], we describe a C-vector space F (P ) of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of F (P ) is the number of irreducible factors of P . Moreover, the knowledge of F (P ) gives a complete factorization of the polynomial P by taking gcd’s. This generalizes previous results by Ruppert and Gao in the case n = 2.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition

We present an algorithm for isolating the roots of an arbitrary complex polynomial p that also works for polynomials with multiple roots provided that the number k of distinct roots is given as part of the input. It outputs k pairwise disjoint disks each containing one of the distinct roots of p, and its multiplicity. The algorithm uses approximate factorization as a subroutine. In addition, we...

متن کامل

A New Algorithm for Factoring Polynomials Over Finite Fields

We present a new probabilistic algorithm for factoring polynomials over finite fields.

متن کامل

Omega and PIv Polynomial in Dyck Graph-like Z(8)-Unit Networks

Design of crystal-like lattices can be achieved by using some net operations. Hypothetical networks, thus obtained, can be characterized in their topology by various counting polynomials and topological indices derived from them. The networks herein presented are related to the Dyck graph and described in terms of Omega polynomial and PIv polynomials.

متن کامل

Deterministic distinct-degree factorization of polynomials over finite fields

A deterministic polynomial time algorithm is presented for finding the distinctdegree factorization of multivariate polynomials over finite fields. As a consequence, one can count the number of irreducible factors of polynomials over finite fields in deterministic polynomial time, thus resolving a theoretical open problem of Kaltofen from 1987.

متن کامل

Non-unique factorization of polynomials over residue class rings of the integers

We investigate non-unique factorization of polynomials in Zpn [x] into irreducibles. As a Noetherian ring whose zero-divisors are contained in the Jacobson radical, Zpn [x] is atomic. We reduce the question of factoring arbitrary non-zero polynomials into irreducibles to the problem of factoring monic polynomials into monic irreducibles. The multiplicative monoid of monic polynomials of Zpn [x]...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008