Factorization of polynomials in one variable over the tropical semiring

Details Factorization of polynomials in one variable over the tropical semiring Factorization of polynomials in one variable over the tropical semiring

2005-01-11

arxiv.org/abs/math/0501167v2

Mathematics

Combinatorics

Prop.11 now assumes matrices are two-valued

Scientific paper

We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization problem which are not polynomial time in the degree, but are polynomial time for polynomials of fixed degree. For two-variable polynomials we derive an irreducibility criterion which is almost always satisfied, even for fixed degree, and is polynomial time in the degree. We prove there are unique least common multiples of tropical polynomials, but not unique greatest common divisors. We show that if two polynomials in one variable have a common tropical factor, then their eliminant matrix is singular in the tropical sense. We prove the problem of determining tropical rank is NP-hard.

Affiliated with

Also associated with

No associations

Rating

Factorization of polynomials in one variable over the tropical semiring does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Factorization of polynomials in one variable over the tropical semiring, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Factorization of polynomials in one variable over the tropical semiring will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-201982