2000 character limit reached
Hilbert Series of simple thin polyominoes
Published 15 Jun 2020 in math.AC and math.CO | (2006.08512v2)
Abstract: Let P be a simple thin polyomino, roughly speaking a polyomino that has no holes and does not contain a square tetromino as a subpolyomino. In this paper, we determine the reduced Hilbert series $h(t)/(1-t)d$ of K[P] by proving that $h(t)$ is the rook polynomial of P. As an application, we characterize the Gorenstein simple thin polyominoes.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.