archives@tulane.edu / The primary objects studied in this dissertation are ordinary and symbolic powers of monomial ideals in a polynomial ring over a field. In particular, we are interested in studying their local cohomology and Castlenuovo-Mumford regularity. In Chapter 3, we restrict our study to edge ideals of unicyclic graphs, that is, squarefree monomial ideals generated in degree $2$ corresponding to a graph that has a single cycle. When the cycle is even, the symbolic power was known to coincide with the ordinary power. When the cycle is odd, we are able to describe the symbolic powers explicitly, which allows us to compute invariants of the ideal explicitly. Furthermore, in certain cases, we can calculate the Castelnuovo-Mumford regularity. In Chapter 4, we study ideals that can be written as the sum of monomial ideals in different polynomial rings. In order to study the graded local cohomology of these ideals, we use a formula of Takayama which allows us to translate this problem of computing homology of certain simplicial complexes called \textit{degree complexes}. We build up the construction of the degree complexes of ordinary and symbolic powers of sums, and then we use this to discuss their graded local cohomologies. In Chapter 5, we study ideals that can be written as the fiber product of squarefree monomial ideals in different polynomial rings. Building on the construction from Chapter 4, we are able to determine that the nonempty faces in the degree complex of ordinary and symbolic powers of fiber products come from the faces of the degree complexes of powers of the component ideals. This allows us to compute the homology of these degree complexes explicitly. Furthermore, this allows us to compute the regularity of symbolic powers of fiber products of squarefree monomial ideals in terms of the regularities of the component ideals. / 1 / Jonathan O'Rourke

The class of squarefree monomial ideals is a classical object in commutative algebra, which has a strong connection to combinatorics. Our main goal throughout this dissertation is to study the algebraic properties of squarefree monomial ideals using combinatorial structures and invariants of hypergraphs. We focus on the following algebraic properties and invariants: the persistence property, non-increasing depth property, Castelnuovo-Mumford regularity and projective dimension. It has been believed for a long time that squarefree monomial ideals satisfy the persistence property and non-increasing depth property. In a recent work, Kaiser, Stehlik and Skrekovski provided a family of graphs and showed that the cover ideal of the smallest member of this family gives a counterexample to the persistence and non-increasing depth properties. We show that the cover ideals of all members of their family of graphs indeed fail to have the persistence and non-increasing depth properties. Castelnuovo-Mumford regularity and projective dimension are both important invariants in commutative algebra and algebraic geometry that govern the computational complexity of ideals and modules. Our focus is on finding bounds for the regularity in terms of combinatorial data from associated hypergraphs. We provide two upper bounds for the edge ideal of any vertex decomposable graph in terms of induced matching number and the number of cycles. We then give an upper bound for the edge ideal of a special class of vertex decomposable hypergraphs. Moreover, we generalize a domination parameter from graphs to hypergraphs and use it to give an upper bound for the projective dimension of the edge ideal of any hypergraph. / Mengyao Sun

In this thesis, we study Hilbert functions of monomial ideals in the polynomial ring and the Kruskal-Katona ring. In particular, we classify Gotzmann edge ideals and, more generally, Gotzmann squarefree monomial ideals. In addition, we discuss Betti numbers of Gotzmann ideals and measure how far certain edge ideals are from Gotzmann. This thesis also contains a thorough account the combinatorial relationship between lex segments and Macaulay representations of their dimensions and codimensions.

No description available.

An artinian standard graded algebra has the weak Lefschetz property if the multiplication by a general linear form induces maps of maximal rank between consecutive degree components. It has the strong Lefschetz property if the multiplication by powers of a general linear form also induce maps of maximal rank between the appropriate degree components. These properties are mainly studied for the constraints they place, when present, on the Hilbert series of the algebra. While the majority of research on the Lefschetz properties has focused on characteristic zero, we primarily consider the presence of the properties in positive characteristic. We study the Lefschetz properties by considering the prime divisors of determinants of critical maps. First, we consider monomial complete intersections in a finite number of variables. We provide two complements to a result of Stanley. We next consider monomial almost complete intersections in three variables. We connect the characteristics in which the weak Lefschetz property fails with the prime divisors of the signed enumeration of lozenge tilings of a punctured hexagon. Last, we study how perturbations of a family of monomial algebras can change or preserve the presence of the Lefschetz properties. In particular, we introduce a new strategy for perturbations rooted in techniques from algebraic geometry.

In 1990, Fröberg presented a combinatorial classification of the quadratic square-free monomial ideals with linear resolutions. He showed that the edge ideal of a graph has a linear resolution if and only if the complement of the graph is chordal. Since then, a generalization of Fröberg's theorem to higher dimensions has been sought in order to classify all square-free monomial ideals with linear resolutions. Such a characterization would also give a description of all square-free monomial ideals which are Cohen-Macaulay. In this thesis we explore one method of extending Fröberg's result. We generalize the idea of a chordal graph to simplicial complexes and use simplicial homology as a bridge between this combinatorial notion and the algebraic concept of a linear resolution. We are able to give a generalization of one direction of Fröberg's theorem and, in investigating the converse direction, find a necessary and sufficient combinatorial condition for a square-free monomial ideal to have a linear resolution over fields of characteristic 2.

This thesis concerns the study of the Lefschetz properties of artinian monomial algebras. An artinian algebra is said to satisfy the strong Lefschetz property if multiplication by all powers of a general linear form has maximal rank in every degree. If it holds for the first power it is said to have the weak Lefschetz property (WLP). In the first paper, we study the Lefschetz properties of monomial algebras by studying their minimal free resolutions. In particular, we give an afirmative answer to an specific case of a conjecture by Eisenbud, Huneke and Ulrich for algebras having almost linear resolutions. Since many algebras are expected to have the Lefschetz properties, studying algebras failing the Lefschetz properties is of a great interest. In the second paper, we provide sharp lower bounds for the number of generators of monomial ideals failing the WLP extending a result by Mezzetti and Miró-Roig which provides upper bounds for such ideals. In the second paper, we also study the WLP of ideals generated by forms of a certain degree invariant under an action of a cyclic group. We give a complete classication of such ideals satisfying the WLP in terms of the representation of the group generalizing a result by Mezzetti and Miró-Roig. / <p>QC 20180220</p>

Ha Minh Lam et M. Morales ont introduit une classe d'idéaux binomiaux qui est une extension binomiale d'idéaux monomiaux libres de carrés.Étant donné I un idéal monomial quadratique de k[x] libre de carrés et J une somme d'idéaux de scroll de k[z] qui satisfont certaines conditions, nous définissons l'extension binomiale de I comme B=I+J. Le sujet de cette thèse est d'étudier le nombre p plus grand tel que les sizygies de B son linéaires jusqu'au pas p-1. Sous certaines conditions d'ordre imposées sur les facettes du complexe de Stanley-Reisner de I nous obtiendrons un ordre > pour les variables de l'anneau de polynomes k[z]. Ensuite nous prouvons pour un calcul des bases de Gröbner que l'idéal initial in(B), sous l'ordre lexicographique induit par l'ordre de variables >, est quadratique libre de carrés. Nous montrerons que B est régulier si et seulement si I est 2-régulier. Dans le cas géneral, lorsque I n'est pas 2-régulier nous trouverons une borne pour l'entier q maximal qui satisfait que les premier q-1 sizygies de B son linéaires. En outre, en supossant que J est un idéal torique et en imposant des conditions supplémentaires, nous trouveron une borne supérieure pour l'entier q maximal qui satisfait que les premier q-1 sizygies de B son linéaires. En imposant des conditions supplémentaires, nous prouverons que les deux bornes sont égaux. / Ha Minh Lam et M. Morales introduced a family of binomial ideals that are binomial extensions of square free monomial ideals. Let I be a square free monomial ideal of k[x] and J a sum of scroll ideals in k[z] with some extra conditions, we define the binomial extension of $I$ as $B=I+Jsubset sis$. The aim of this thesis is to study the biggest number p such that the syzygies of B are linear until the step p-1. Due to some order conditions given to the facets of the Stanley-Reisner complex of I we get an order > for the variables of the polynomial ring k[z]. By a calculation of the Gröbner basis of the ideal $B$ we obtain that the initial ideal in(B) is a square free monomial ideal. We will prove that B is 2-regular iff I is 2-regular. In the general case, wheter I is not 2-regular we will find a lower bound for the the maximal integer q which satisfies that the first q-1 sizygies of B are linear. On the other hand, wheter J is toric and supposing other conditions, we will find a upper bound for the integer q which satisfies that the first q-1 syzygies of B are linear. By given more conditions we will prove that the twobounds are equal.

The main objective of this dissertation is to present an algebraic method capable of determining a solution, if any, of a non linear polynomial equation systems using Gröbner basis. In order to accomplish that, we first present some concepts and theorems linked to polynomial rings with several undetermined and monomial ideals where we highlight the division extended algorithm, the Hilbert Basis and the Buchberger´s algorithm. Beyond that, using basics of Elimination and Extension Theorems, we present an algebraic solution to the map coloring that use 3 colors as well as a general solution to the Sudoku puzzle. / O objetivo principal desse trabalho é, usando bases de Gröbner, apresentar um método algébrico capaz de determinar a solução, quando existir, de sistemas de equações polinomiais não necessariamente lineares. Para tanto, necessitamos inicialmente apresentar alguns conceitos e teoremas ligados a anéis de polinômios com várias indeterminadas e de ideais monomiais, dentre os quais destacamos o algoritmo extendido da divisão, o teorema da Base de Hilbert e o algoritmo de Buchberger. Além disso, usando noções básicas da Teoria de eliminação e extensão, apresentamos uma solução algébrica para o problema da coloração de mapas usando três cores, bem como um solução geral para o puzzle Sudoku.

The thesis deals with stochastic and algebraic aspects of the integer convex hull. In the first part, the intrinsic volumes of the randomized integer convex hull are investigated. In particular, we obtained an exact asymptotic order of the expected intrinsic volumes difference in a smooth convex body and a tight inequality for the expected mean width difference. In the algebraic part, an exact formula for the Bhattacharya function of complete primary monomial ideas in two variables is given. As a consequence, we derive an effective characterization for complete monomial ideals in two variables.