Welcome to MathOverflow

Question

0

Varieties decompose uniquely into finitely many irreducibles, and each variety is generated by only finitely polynomials. These two finiteness properties make varieties seemingly "manageable" objects, and leads me to the question:

Can a computer, given a variety (finite set of polynomials) produce a list of its irreducible components (finite set of finite sets of polynomials) in finite time?

flag	asked Oct 25 2009 at 11:38 Justin 1,336●3●13●25

S1 · Accepted Answer · 2009-10-25 12:11:12Z UTC

2

This is just about primary decomposition! There are several CAS which can do that, for example Singular.

answered Oct 25 2009 at 12:11

S1
2,783●8●25

Thanks, do you know if Mathematica has such a function? – Justin Oct 25 2009 at 12:23

I don't know Mathematica because I hate this Sin[] notation and so on :) Maple can do primary decompositions in polynomial rings (theoretically, I never used this). I think Sage just uses the interface to Singular. – S1 Oct 25 2009 at 12:41

1

Magma can do it too. – Qiaochu Yuan Oct 25 2009 at 13:36

1

As can Macaulay2. – Graham Leuschke Oct 25 2009 at 15:10

Does automatic decomposition of varieties into irreducibles exist?

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

1 Answer

You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.