Computation of the a-invariant of ladder determinantal rings
classification
🧮 math.CO
math.AC
keywords
ladderdeterminantalinvariantringsalgorithmiccasecompactcomputation
read the original abstract
We solve the problem of effectively computing the $a$-invariant of ladder determinantal rings. In the case of a one-sided ladder, we provide a compact formula, while, for a large family of two-sided ladders, we provide an algorithmic solution.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.