Recent Advances in the Theory of Polyomino Ideals

TL;DR

This paper reviews recent progress in understanding the algebraic properties of polyomino ideals, focusing on prime characterization, Hilbert series relations, and computational tools, linking combinatorics and algebra.

Contribution

It provides a unified overview of advances in prime characterization, Gorenstein properties, and computational methods for polyomino ideals, connecting combinatorial and algebraic perspectives.

Findings

Characterization of prime polyomino ideals

Connection between Hilbert series and Gorensteinness

Development of a Macaulay2 package for polyomino ideals

Abstract

Polyomino ideals, defined as the ideals generated by the inner $2$-minors of a polyomino, are a class of binomial ideals whose algebraic properties are closely related to the combinatorial structure of the underlying polyomino. We provide a unified account of recent advances on two central themes: the characterization of prime polyomino ideals and the emerging connection between the Hilbert-Poincar\'e series and Gorensteinness of $K[\mathcal{P}]$ with the classical rook theory. Some further related properties, as radicality, primary decomposition, and levelness are discussed, and a \textit{Macaulay2} package, namely \texttt{PolyominoIdeals}, is also presented.