Hi!
> ... about fast implementation of path algebras
Does anyone know how things are done in the C sources of KBMag[1]?
After all, it's quite similar in nature: the basic objects are (more
or less) words, and non commutative Gröbner bases are closely related
to Knuth Bendix completions. Of course some of the products can be
zero, and indeed are more often than not.
Cheers,
Nicolas
[1] http://www.gap-system.org/Packages/kbmag.html
--
Nicolas M. Thiéry "Isil" <nthi...@users.sf.net>
http://Nicolas.Thiery.name/
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To post to this group, send email to sage-combinat-devel@googlegroups.com.
To unsubscribe from this group, send email to
sage-combinat-devel+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/sage-combinat-devel?hl=en.
