Mathematics > Commutative Algebra
[Submitted on 5 Feb 2004]
Title:Combinatorics of rank jumps in simplicial hypergeometric systems
View PDFAbstract: Let A be an integer (d x n) matrix, and assume that the convex hull conv(A) of its columns is a simplex of dimension d-1. Write \NA for the semigroup generated by the columns of A. It was proved by M. Saito [math.AG/0012257] that the semigroup ring \CC[\NA] over the complex numbers \CC is Cohen-Macaulay if and only if the rank of the GKZ hypergeometric system H_A(beta) equals the normalized volume of conv(A) for all complex parameters beta in \CC^d. Our refinement here shows, in this simplicial case, that H_A(beta) has rank strictly larger than the volume of conv(A) if and only if beta lies in the Zariski closure in \CC^d of all \ZZ^d-graded degrees where the local cohomology H^i_m(\CC[\NA]) at the maximal ideal m is nonzero for some i < d.
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.