Show simple item record

Filtration Theorems and Bounding Generators of Symbolic Multi-powers

dc.contributor.authorChen, Yuanyuan
dc.date.accessioned2019-10-01T18:28:14Z
dc.date.availableNO_RESTRICTION
dc.date.available2019-10-01T18:28:14Z
dc.date.issued2019
dc.date.submitted
dc.identifier.urihttps://hdl.handle.net/2027.42/151674
dc.description.abstractWe prove a very powerful generalization of the theorem on generic freeness that gives countable ascending filtrations, by prime cyclic A-modules A/P, of finitely generated algebras R over a Noetherian ring A and of finitely generated R-modules such that the number of primes P that occur is finite. Moreover, we can control, in a sense that we can make precise, the number of factors of the form A/P that occur. In the graded case, the number of occurrences of A/P up to a given degree is eventually polynomial. The degree is at most the number of generators of R over A. By multi-powers of a finite sequence of ideals we mean an intersection of powers of the ideals with exponents varying. Symbolic multi-powers are defined analogously using symbolic powers instead of powers. We use our filtration theorems to give new results bounding the number of generators of the multi-powers of a sequence of ideals and of the symbolic multi-powers as well under various conditions. This includes the case of ordinary symbolic powers of one ideal. Furthermore, we give new results bounding, by polynomials in the exponents, the number of generators of multiple Tor when each input module is the quotient of R by a power of an ideal. The ideals and exponents vary. The bound is given by a polynomial in the exponents. There are similar results for Ext when both of the input modules are quotients of R by a power of an ideal. Typically, the two ideals used are different, and the bound is a polynomial in two exponents.
dc.language.isoen_US
dc.subjectsymbolic powers
dc.subjectfiltration theorems
dc.titleFiltration Theorems and Bounding Generators of Symbolic Multi-powers
dc.typeThesis
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineMathematics
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studies
dc.contributor.committeememberHochster, Mel
dc.contributor.committeememberTappenden, James P
dc.contributor.committeememberCanton, Eric
dc.contributor.committeememberDerksen, Harm
dc.contributor.committeememberSmith, Karen E
dc.subject.hlbsecondlevelMathematics
dc.subject.hlbtoplevelScience
dc.description.bitstreamurlhttps://deepblue.lib.umich.edu/bitstream/2027.42/151674/1/yych_1.pdf
dc.identifier.orcid0000-0001-6142-741X
dc.identifier.name-orcidChen, Yuanyuan; 0000-0001-6142-741Xen_US
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.