Let K be an infinite perfect computable field and let I β K[x] be a zero-dimensional ideal represented by a GrΓΆbner basis. We derive a new algorithm for computing the reduced primary decomposition of I using only standard linear algebra and univariate polynomial factorization techniques. In practice
β¦ LIBER β¦
The core of zero-dimensional monomial ideals
β Scribed by Claudia Polini; Bernd Ulrich; Marie A. Vitulli
- Book ID
- 108051513
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 243 KB
- Volume
- 211
- Category
- Article
- ISSN
- 0001-8708
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Computing the Primary Decomposition of Z
β
Chris Monico
π
Article
π
2002
π
Elsevier Science
π
English
β 228 KB
On the arithmetical rank of monomial ide
β
Gennady Lyubeznik
π
Article
π
1988
π
Elsevier Science
π
English
β 207 KB
On the Hilbert series of monomial ideals
β
Goodarzi, Afshin
π
Article
π
2013
π
Elsevier Science
π
English
β 106 KB
On the numbers of generators of monomial
β
Ali Jaballah
π
Article
π
1992
π
Springer
π
English
β 146 KB
Decomposition of tableaus annihilated by
β
David Fu; Mark Heiligman; Cameron Wickham
π
Article
π
2003
π
Elsevier Science
π
English
β 161 KB
A (1-dimensional) linear recursive sequence s over a field K decomposes in the following canonical way. Let I β K[x] be the annihilator ideal of s. Since K[x] is a principal ideal domain, I = f K[x] for some polynomial f , which can be factored as f 1 β’ β’ β’ f r where the f i are coprime. Thus s can
On the radical of a monomial ideal
β
J. Herzog; Y. Takayama; N. Terai
π
Article
π
2005
π
Springer
π
English
β 91 KB