2001
DOI: 10.1006/jsco.2001.0446
|View full text |Cite
|
Sign up to set email alerts
|

Computing the Radical of an Ideal in Positive Characteristic

Abstract: We propose a method for computing the radical of an arbitrary ideal in the polynomial ring in n variables over a perfect field of characteristic p > 0. In our method Buchberger's algorithm is performed once in n variables and a Gröbner basis conversion algorithm is performed at most n log p d times in 2n variables, where d is the maximum of total degrees of generators of the ideal and 3. Next we explain how to compute radicals over a finitely generated coefficient field over a field K, when we have a radical c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
14
0

Year Published

2002
2002
2015
2015

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 15 publications
(15 citation statements)
references
References 16 publications
1
14
0
Order By: Relevance
“…But the ratios between the timings for different examples roughly correspond to those obtained in Matsumoto (2001).…”
Section: Algorithm 6 (Zero-dimensional Radical)supporting
confidence: 67%
See 4 more Smart Citations
“…But the ratios between the timings for different examples roughly correspond to those obtained in Matsumoto (2001).…”
Section: Algorithm 6 (Zero-dimensional Radical)supporting
confidence: 67%
“…Of course this ideal is already radical except in characteristic 2. The other test ideals are labelled E2, E3, L, M, 8 3 , and C. We do not reprint them here, since they can be found in Matsumoto (2001) or Caboara et al (1997). In order to obtain meaningful running times, the author implemented Matsumoto's algorithm in MAGMA, and compared the timings with the MAGMA implementation of the algorithm from this paper.…”
Section: Algorithm 6 (Zero-dimensional Radical)mentioning
confidence: 96%
See 3 more Smart Citations