Polyominoes are two-dimensional objects obtained by joining edge by edge squares of same size. Originally, polyominoes appeared in mathematical recreations, but it turned out that they have applications in various fields, for example, theoretical physics and bio-informatics. Among the most popular topics in combinatorics related to polyominoes one finds enumerating polyominoes of given size, including the asymptotic growth of the numbers of polyominoes, tiling problems, and reconstruction of polyominoes. Recently Qureshi introduced a binomial ideal induced by the geometry of a given polyomino, called polyomino ideal, and its related algebra. From that moment different authors studied algebraic properties and invariants related to this ideal, such as primality, Gröbner bases, Gorensteinnes and Castelnuovo-Mumford regularity. In this thesis, we provide an overview on the results that we obtained about polyomino ideals and its related algebra. In the first part of the thesis, we discuss questions about the primality and the Gröbner bases of the polyomino ideal. In the second part of the thesis, we talk over the Castelnuovo-Mumford regularity, Hilbert series, and Gorensteinnes of the polyomino ideal and its coordinate ring.

<p>The goal of this dissertation is to broaden the classes of ideals for which the generators of residual intersections are known. This is split into two main parts.</p> <p>The first part is Chapter 5, where we prove that, for an ideal I in a local Cohen-Macaulay ring R, under suitable technical assumptions, we are able to express s-residual intersections, for s ≥ μ(I) − 2, in terms of (μ(I) − 2)-residual intersections. This result implies that s- residual intersections can be expressed in terms of links, if μ(I) ≤ ht(I) + 3 and some other hypotheses are satisfied. In Chapter 5, we prove our result using two different methods and two different sets of technical assumptions on the depth conditions satisfied by the ideal I. For Section 5.2 and Section 5.3 we use the properties of Fitting ideals and methods developed in [33] to prove our main result. In these sections, we require I to satisfy the Gs condition and be weakly (s − 2)-residually S2. In Section 5.4, we prove analogous results to those in Section 5.2 and Section 5.3 using disguised residual intersections, a notion developed by Bouca and Hassansadeh in [5].</p> <p>The second part is Chapter 6 where we prove that the n-residual intersections of ideals generated by maximal minors of a 2 × n generic matrix for n ≥ 4 are sums of links. To prove this, we require a series of technical results. We begin by proving the main theorem for this chapter in a special case, using the results of Section 6.1 to compute the generators of the relevant links in a our special case, and then using these generators to compute the Gro ̈bner Basis for the sum of links in Section 6.2. The computation of the Gro ̈bner basis, as well as an application of graph theoretic results about binomial edge ideals [17], allow us to show that our main theorem holds in this special case. Lastly, we conclude our proof in Section 6.3, where we show that n-residual intersections of ideals generated by maximal minors of 2 × n generic matrices commute with specialization maps, and use this to show that the generic n-residual intersections of ideals generated by maximal minors of a 2 × n generic matrix for n ≥ 4 are sums of links. This allows us to prove the main theorem of Chapter 6.</p>

Thesis (Ph. D.)--State University of New York at Binghamton, Department of Mathematical Sciences, 2007. / Includes bibliographical references.