نتایج جستجو برای: tight closure
تعداد نتایج: 95171 فیلتر نتایج به سال:
Many of the tools of higher dimensional complex birational algebraic geometry—including singularities of pairs, multiplier ideals, and log canonical thresholds— have ”characteristic p” analogs arising from ideas in tight closure theory. Tight closure, introduced by Hochster and Huneke in [17], is a closure operation performed on ideals in commutative rings of prime characteristic, and has an in...
This paper studies Frobenius maps on injective hulls of residue fields of complete local rings with a view toward providing constructive descriptions of objects originating from the theory of tight closure. Specifically, the paper describes algorithms for computing parameter test ideals, and tight closure of certain submodules of the injective hull of residue fields of a class of well-behaved r...
Throughout our discussion, all rings are commutative, Noetherian and have an identity element. The notion of the tight closure of an ideal was developed by M. Hochster and C. Huneke in [HH1] and has yielded many elegant and powerful results in commutative algebra. The theory leads to the notion of F–rational rings, defined by R. Fedder and K.-i. Watanabe as rings in which parameter ideals are t...
We give an example showing that tight closure does not commute with localization. Mathematical Subject Classification (2000): 13A35, 14H60
We define a closure operation for ideals in a commutative ring which has all the good properties of solid closure (at least in the case of equal characteristic) but such that also every ideal in a regular ring is closed. This gives in particular a kind of tight closure theory in characteristic zero without referring to positive characteristic.
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solution of integer problems in the fields of constraint programming and formal analysis and verification of software and hardware systems, since they couple algorithms having polynomial complexity with a relatively good ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید