2000 character limit reached
The $F$-pure threshold of a determinantal ideal
Published 25 Oct 2012 in math.AC | (1210.6729v2)
Abstract: The $F$-pure threshold is a numerical invariant of prime characteristic singularities, that constitutes an analogue of the log canonical thresholds in characteristic zero. We compute the $F$-pure thresholds of determinantal ideals, i.e., of ideals generated by the minors of a generic matrix.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.