|
Macaulay2 Engine
|
Concrete commutative PolyRing — standard polynomial ring inheriting from PolyRingFlat. More...
Go to the source code of this file.
Classes | |
| class | PolyRing |
| Concrete PolyRingFlat subclass implementing ordinary commutative polynomial rings K[x_1, ..., x_n] with a generic coefficient ring K and monoid M. More... | |
Functions | |
| const PolyRing * | isUnivariateOverPrimeField (const Ring *R) |
Concrete commutative PolyRing — standard polynomial ring inheriting from PolyRingFlat.
Declares the concrete PolyRing that engine code instantiates whenever it talks about "a polynomial ring." The class descends from the abstract layer in polyring.hpp through PolyRingFlat (the intermediate that asserts coefficients are non-polynomial) and is the parent of the flavoured polynomial-ring subclasses the engine actually defines: SkewPolynomialRing (skewpoly.hpp), WeylAlgebra (weylalg.hpp), SolvableAlgebra (solvable.hpp), and SchurRing (schur.hpp). The quotient flavour PolyRingQuotient (polyquotient.hpp) sits beside PolyRing — both inherit directly from PolyRingFlat — and the non-commutative M2FreeAlgebra (M2FreeAlgebra.hpp) is on a separate Ring hierarchy. TermIdeal, Matrix, GBRing / GBRingSkew, GBComputation, and ChineseRemainder are forward-declared so the header stays light.
Definition in file poly.hpp.