I would appreciate some advice on constructing the monoid algebra of an infinite monoid. I hope this is appropriate forum and I apologise if I have missed this in the documentation. I am confused about the similarities and differences between class inheritance and parents/ categories. Another source of confusion is that since CombinatorialFreeModule was introduced a number of approaches to this problem are now deprecated.
In case this request seems vague and difficult to respond to here is the example I have in mind in more detail. The monoid I have in mind is the monoid of heaps of pieces. Let G be a set with a reflexive transitive relation (whose elements are called pieces). Then a heap is a finite poset (P,<) together with a map P -> G. There are conditions which are not relevant here. There is a multiplication map which makes this a monoid; again the details are not relevant here. As far as I know posets are mutable but at least for the heaps I am interested in I know how to make them immutable so hash and CombinatorialFreeModule etc. are available. In summary, the set G (with the relation) determines an infinite monoid. Then given a (commutative) ring R the free R-module on this monoid is an R-algebra. What is the right framework for implementing this in sage? A secondary question: does sage have any support for working with algebras with relations? -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
