2000 character limit reached
Bernstein-Sato theory modulo
Published 13 Jan 2024 in math.AC, math.AG, and math.NT | (2401.07082v2)
Abstract: For fixed prime integer $p > 0$ we develop a notion of Bernstein-Sato polynomial for polynomials with -coefficients, compatible with existing theory in the case . We show that the roots" of such polynomials are rational and we show that the negative roots agree with those of the mod- reduction. We give examples to show that, surprisingly, roots may be positive in this context. Moreover, our construction allows us to define a notion ofstrength" for roots by measuring -torsion, and we show that ``strong" roots give rise to roots in characteristic zero through mod- reduction.
Paper Prompts
Sign up for free to create and run prompts on this paper.