19
Views
1
CrossRef citations to date
0
Altmetric
Original Article

Computations with Frobenius Powers

&
Pages 161-173 | Published online: 30 Jan 2011

  • D. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Undergraduate Texts in Mathematics. New York: Springer-Verlag, 1992.
  • D. R. Grayson and M. E. Stillman. "Macaulay2, a Software System for Research in Algebraic Geometry." Available from World Wide Web (http://www.math.uiuc.edu/Macaulay2/), 2003. http://www.math.uiuc.edu/Macaulay2
  • M. Hochster and C. Huneke. "Tight Closure, Invariant Theory, and the Briançon-Skoda Theorem." J. Amer. Math. Soc. 3 (1990), 31–116.
  • M. Katzman. "The Complexity of Frobenius Powers of Ideals." J. Algebra 203 (1998), 211–225.
  • K. E. Smith. "Tight Closure Commutes with Localization in Binomial Rings." Proc. Amer. Math. Soc. 129 (2001) 667–669.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.