Macaulay2 Engine
Loading...
Searching...
No Matches

◆ degreeMonoid()

const Monoid * degreeMonoid ( const std::vector< std::string > & names)

Definition at line 30 of file util-polyring-creation.cpp.

31{
32 std::vector<int> wts;
33 for (int i=0; i<names.size(); i++)
34 wts.push_back(-1);
36 ({
38 MonomialOrderings::GroupLex(names.size()),
40 });
41
42 return Monoid::create(mo,
43 IM2_Ring_trivial_polyring()->cast_to_PolynomialRing(),
44 names,
45 {},
46 {});
47}
static Monoid * create(const MonomialOrdering *mo, const PolynomialRing *DR, const std::vector< std::string > &names, const std::vector< int > &degs, const std::vector< int > &hefts)
Definition monoid.cpp:61
static MonomialOrdering * Weights(const std::vector< int > &wts)
static MonomialOrdering * PositionUp()
static MonomialOrdering * GroupLex(int nvars)
static MonomialOrdering * join(const std::vector< MonomialOrdering * > &M)
const Ring * IM2_Ring_trivial_polyring()
Definition ring.cpp:114
Front-end-side description of a monomial ordering as a list of mon_part blocks.

References Monoid::create(), MonomialOrderings::GroupLex(), IM2_Ring_trivial_polyring(), MonomialOrderings::join(), MonomialOrderings::PositionUp(), and MonomialOrderings::Weights().

Referenced by degreeRing().