2009
DOI: 10.1016/j.jalgebra.2009.07.007
|View full text |Cite
|
Sign up to set email alerts
|

A-graded methods for monomial ideals

Abstract: We use Z d -gradings to study d-dimensional monomial ideals.The Koszul functor is employed to interpret the quasidegrees of local cohomology in terms of the geometry of distractions and to explicitly compute the multiplicities of exponents. These multigraded techniques originate from the study of hypergeometric systems of differential equations.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
6
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(7 citation statements)
references
References 18 publications
1
6
0
Order By: Relevance
“…To compute the rank of M , we then apply Euler-Koszul homology to this resolution and follow the resulting spectral sequence, as in the proof of [BM09,Theorem 4.5]. That argument and the fact that the theorem has been proven for A-hypergeometric systems in [Berk10,Theorem 7.3] imply that this procedure and its associated numerics are compatible with ρ, and this compatibility yields the desired result.…”
Section: Binomial D-modulesmentioning
confidence: 99%
“…To compute the rank of M , we then apply Euler-Koszul homology to this resolution and follow the resulting spectral sequence, as in the proof of [BM09,Theorem 4.5]. That argument and the fact that the theorem has been proven for A-hypergeometric systems in [Berk10,Theorem 7.3] imply that this procedure and its associated numerics are compatible with ρ, and this compatibility yields the desired result.…”
Section: Binomial D-modulesmentioning
confidence: 99%
“…The program computes the reliability polynomials for these systems with 10 components and 10 levels of performance in less than a minute. Figure 4 shows the reliability polynomials of a k-out-of-10 decreasing MS system for which k 1 to k 10 are (9,8,7,6,5,5,4,4,3,2). The program took 40 seconds on a laptop 1 , hence the method is practical.…”
Section: 3mentioning
confidence: 99%
“…The choice between steps (3) or (3') depends on our needs. If we are only interested in computing the full reliability formula, then we can use any algorithm that computes Hilbert series in step (3). However, if we need bounds for our system reliability, then we can compute any free resolution of I S,j and thus perform step (3').…”
Section: 2mentioning
confidence: 99%
See 1 more Smart Citation
“…Berkesch and Matusevich [BeMa08] used an extension [DMM08] of these homological methods to more general multigraded modules over polynomial rings to see what the Cohen-Macaulay characterization by rank jumps says about quotients by monomial ideals. Their conclusions were based on the fact that ranks of systems of differential equations arising from monomial ideals are controlled by the geometry of their distractions, from which Berkesch and Matusevich defined the exponent simplicial complexes using standard pairs.…”
Section: Distracting Arrangements and Exponent Complexesmentioning
confidence: 99%