Macaulay2 » Documentation
Packages » DirectSummands » Example: summands of the Frobenius pushforward » frobeniusTwist

next | previous | forward | backward | up | index | toc

frobeniusTwist -- apply the Frobenius twist to rings, modules, and matrices

Usage:

frobeniusTwist(e, M)
Inputs:
- e, an integer,
- M, a ring, an ideal, a module, or a matrix,
Outputs:
- a ring,
- an ideal,
- a module,
- a matrix,

Description

This function applies the $e$-fold Frobenius twist to the input, adjusting coefficients and gradings accordingly.

See also

frobeniusMap -- the iterated Frobenius map of a ring in positive characteristic
frobeniusPushforward -- compute Frobenius pushforwards

Ways to use frobeniusTwist:

frobeniusTwist(ZZ,Ideal)
frobeniusTwist(ZZ,Matrix)
frobeniusTwist(ZZ,Module)
frobeniusTwist(ZZ,Ring)

For the programmer

The object frobeniusTwist is a method function.

The source of this document is in /build/reproducible-path/macaulay2-1.26.06+ds/M2/Macaulay2/packages/DirectSummands/docs.m2:680:0.