An algorithm for constructing certain differential operators in positive characteristic
From MaRDI portal
Publication:5265514
Abstract: Given a non-zero polynomial in a polynomial ring with coefficients in a finite field of prime characteristic , we present an algorithm to compute a differential operator which raises to its th power. For some specific families of polynomials, we also study the level of such a differential operator , i.e., the least integer such that is -linear. In particular, we obtain a characterization of supersingular elliptic curves in terms of the level of the associated differential operator.
Recommendations
- Factoring differential operators over algebraic curves in positive characteristic
- Fast algorithms for differential equations in positive characteristic
- Invariant differential operators in positive characteristic
- An algorithm for construction of commuting ordinary differential operators by geometric data
- scientific article; zbMATH DE number 4031886
- A vanishing theorem for differential operators in positive characteristic
- An algorithm for computing fundamental solutions of difference operators
- Some algebraic properties of differential operators
- scientific article; zbMATH DE number 2065261
- scientific article; zbMATH DE number 29097
Cited in
(6)- A fast algorithm for computing the characteristic polynomial of the \(p\)-curvature
- The level of pairs of polynomials
- Iterative differential embedding problems in positive characteristic
- Factoring differential operators over algebraic curves in positive characteristic
- Differential operators and hyperelliptic curves over finite fields
- scientific article; zbMATH DE number 4000086 (Why is no real title available?)
This page was built for publication: An algorithm for constructing certain differential operators in positive characteristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265514)