On Mon, Apr 29, 2013 at 11:38:38AM +0000, Simon King wrote: > Second question: How do we call this structure? It is not a monoid, unless > there is a single vertex (it has idempotents corresponding to its vertices), > If it has more than one vertex, then it contains a zero element that one > obtains when concatenating paths that do not match. > > Florent suggested to call it "monoidoid".
I think Florent just invented a new name for 'category', or more exactly the path algebra of a category. ------------------------------------------------------------------------------ Jean MICHEL, Groupes et representations, IMJ-PRG UMR7586 tel.(33)157279144 Bureau 639 Bat. Sophie Germain Case 7012 - 75205 PARIS Cedex 13 -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-combinat-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-combinat-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
