Computing the support of local cohomology modules (Q2457402): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066422935 / rank
 
Normal rank

Revision as of 20:35, 19 March 2024

scientific article
Language Label Description Also known as
English
Computing the support of local cohomology modules
scientific article

    Statements

    Computing the support of local cohomology modules (English)
    0 references
    0 references
    23 October 2007
    0 references
    Let \(k = \mathbb{C}\) be the field of complex numbers, let \(R = k[x_1, x_2, \dots, x_n]\), and let \(I \subseteq R\) be an ideal. Recall that the local cohomology module \(H^r_I(R)\) has a natural \(A_n\)-module structure, where \(A_n\) is the \(n\)-th Weyl algebra. In this paper, the authors presents an algorithm for computing the characteristic cycles of \(H^r_I(R)\). This algorithm is based upon a result of \textit{V. Ginsburg} [Invent. Math. 84, 327 -- 402 (1986; Zbl 0598.32013)], and its reinterpretation by \textit{J. Briançon, P. Maisonobe}, and \textit{M. Merle} [Invent. Math. 117, No. 3, 531--550 (1994; Zbl 0920.32010)]. This result gives formula for the characteristic cycle of the localization \(M_f\) in terms of the characteristic cycle of \(M\), when \(M\) is a regular holonomic \(A_n\)-module and \(f \in R\), and it is stated in the analytic category by \textit{J. Briançon, P. Maisonobe} and \textit{M. Merle} [Invent. Math. 117, No. 3, 531--550 (1994; Zbl 0920.32010)]. Examples of calculations of vanishing cycles of local cohomology modules are given, using an implementation in \texttt{Macaulay 2}. The algorithm avoids computing the Bernstein polynomial of \(f\) (used in algorithms for computing local cohomology modules).
    0 references
    0 references
    0 references
    0 references
    0 references
    local cohomology
    0 references
    vanishing cycles
    0 references
    0 references
    0 references
    0 references
    0 references