Grobner bases: Degree bounds and generic ideals

In this thesis, we study two problems related to Grobner basis theory: degree bounds for general ideals and Grobner bases structure for generic ideals. We start by giving an introduction to Grobner bases and their basic properties and presenting a recent algorithm by Gao, Volny and Wang.;Next, we survey degree bounds for the ideal membership problem, the effective Nullstellensatz, and polynomials in minimal Grobner bases. We present general upper bounds, and bounds for several classes of special ideals. We provide classical examples showing some of these bounds cannot be improved in general. We present a comprehensive study of a result by Lazard, that gives a bound on the degree of Grobner bases after a generic change of variables. The maximum degree of minimal generators of the initial ideal obtained this way is related to the regularity of the ideal, an important concept in algebraic geometry. We give a complete proof of Lazard's bound, filling in the details omitted in his paper.;Finally, we study Grobner bases structure for generic ideals. It was conjectured by Moreno-Socias that the initial ideal of generic ideals is almost reverse lexicographic, which implies a conjecture by Froberg on Hilbert series of generic algebras. In the literature, these conjectures were attacked using indirect methods. We use a direct incremental approach, based on a method by Gao, Guan and Volny. We show how a Grobner basis for the ideal (I, g) can be obtained from that of I when adding a generic polynomial g, using properties of the standard basis of I. For a generic ideal I = ( f1,...,fn) in K[x1,...,x n], with deg fi = d i, we are able to give a complete description of the ideal of leading terms of I in the case where di ≥ (Sigma (i = 1)/(j = 1) d j) -- i --2. As a result, we obtain a partial answer to Moreno-Socias Conjecture: the initial ideal of I is almost reverse lexicographic if the degrees of generators satisfy the condition above. This result slightly improves a result by Cho and Park. We hope this approach can be strengthened to prove the conjecture in full.