Abstract. In this paper we primarily study monomial ideals and their minimal free resolutions by studying their associated LCM lattices. In particular, we formally define the notion of coordina-tizing a finite atomic lattice P to produce a monomial ideal whose LCM lattice is P, and we give a complete characterization of all such coordinatizations. We prove that all relations in the lattice L(n) of all finite atomic lattices with n ordered atoms can be re-alized as deformations of exponents of monomial ideals. We also give structural results for L(n). Moreover, we prove that the cel-lular structure of a minimal free resolution of a monomial ideal M can be extended to minimal resolutions of certain monomial ideals whose LCM lattices are great...
Historically, the study of monomial ideals became fashionable after the pioneering work by Richard S...
We study the WLP and SLP of artinian monomial ideals in S = K[x1, . . . , xn] via studying their min...
Using discrete Morse theory, we give an algorithm that prunes the excess of information in the Taylo...
AbstractWe introduce the class of lattice-linear monomial ideals and use the lcm-lattice to give an ...
AbstractWe introduce the class of lattice-linear monomial ideals and use the lcm-lattice to give an ...
In this paper we investigate the class of rigid monomial ideals. We give a characterization of the m...
Abstract: The relationships between the generators of an ideal encapsulate a great deal of informati...
Let k be a field and S = k [x1 , . . . , xn ] a polynomial ring. This thesis considers the structure...
Let P be a finite partially ordered set with unique minimal element 0̂. We study the Betti poset of ...
Abstract. The Laplacian matrix of a graph G describes the combinatorial dy-namics of the Abelian San...
Monomial ideals form an important link between commutative algebra and combinatorics. Our aim is to ...
Monomial ideals form an important link between commutative algebra and combinatorics. Our aim is to ...
We construct the minimal resolutions of three classes of monomial ideals: dominant, 1-semidominant, ...
AbstractWe provide the first examples of minimal free resolutions of monomial ideals which cannot be...
The question we address in this paper is: which monomial ideals have minimal cellular resolutions, t...
Historically, the study of monomial ideals became fashionable after the pioneering work by Richard S...
We study the WLP and SLP of artinian monomial ideals in S = K[x1, . . . , xn] via studying their min...
Using discrete Morse theory, we give an algorithm that prunes the excess of information in the Taylo...
AbstractWe introduce the class of lattice-linear monomial ideals and use the lcm-lattice to give an ...
AbstractWe introduce the class of lattice-linear monomial ideals and use the lcm-lattice to give an ...
In this paper we investigate the class of rigid monomial ideals. We give a characterization of the m...
Abstract: The relationships between the generators of an ideal encapsulate a great deal of informati...
Let k be a field and S = k [x1 , . . . , xn ] a polynomial ring. This thesis considers the structure...
Let P be a finite partially ordered set with unique minimal element 0̂. We study the Betti poset of ...
Abstract. The Laplacian matrix of a graph G describes the combinatorial dy-namics of the Abelian San...
Monomial ideals form an important link between commutative algebra and combinatorics. Our aim is to ...
Monomial ideals form an important link between commutative algebra and combinatorics. Our aim is to ...
We construct the minimal resolutions of three classes of monomial ideals: dominant, 1-semidominant, ...
AbstractWe provide the first examples of minimal free resolutions of monomial ideals which cannot be...
The question we address in this paper is: which monomial ideals have minimal cellular resolutions, t...
Historically, the study of monomial ideals became fashionable after the pioneering work by Richard S...
We study the WLP and SLP of artinian monomial ideals in S = K[x1, . . . , xn] via studying their min...
Using discrete Morse theory, we give an algorithm that prunes the excess of information in the Taylo...