All Questions
4 questions
5
votes
0
answers
2k
views
Saturated ideals in computational algebra
Let $R$ a commutative ring with one and $I, J \triangleleft R$ two ideals.
The saturated ideal $I^{sat}_J$ with respect $J$ is the ideal
$$(I : J^\infty )= \cup_{n \geq 1} (I:J^n)$$
where $(I:J^n)= \{...
2
votes
0
answers
61
views
Efficient algorithm to prove that a polynomial ideal contains 1
I have the following problem:
Suppose to have an ideal $I\triangleleft k[x_1,...,x_n]$ defined by generators. There exists an efficient algorithm (perhaps more efficient than calculating the Groebner ...
1
vote
1
answer
108
views
Finding a characteristic for which the zero-locus of an ideal is not empty
I have a set of polynomials $f_1, \dots, f_m \in \mathbb{Z}[x_1, \dots, x_n]$ and I am interested in finding if these polynomials have a common root inside either $\mathbb{C}[x_1, \dots, x_n]$ or $\...
1
vote
1
answer
395
views
Is this algorithm for primary decomposition correct?
I've written some code for Sage to compute radical ideals and primary decompositions over $\overline{Q}$ (the field of algebraic numbers), and I'm not sure if it's right.
Since Singular (the ...