Abstract
We classify all convex polyominoes whose coordinate rings are Gorenstein. We also give an upper bound for the Castelnuovo-Mumford regularity of the coordinate ring of any convex polyomino in terms of the smallest interval which contains its vertices. We give a recursive formula for computing the multiplicity of a stack polyomino.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献