Dear developers I have not started using sage yet but I am interested in non- commutative grobner bases and in applying similar methods to planar graphs. I have some C++ code (which does not work!) and I am thinking about moving to sage.
I think I understand classes. I know the data structures and the functions I want to implement. My main conceptual difficulty is that I have not understood categories/parents/elements despite looking at the documentation. I would like to discuss the design for implementing algorithms for working with reduction rules in sage. The applications are to Vaughan Jones' theory of planar algebras and to automating the approach to invariant tensors for simple Lie algebras pioneered by Cvitanovic and published in his book on "Birdtracks". An explicit example of the methods which is a non-trivial result and which can be done by hand is the diagrammatic proof (due to Rost and to Boos) that a vector product algebra has dimension 0,1,3,7. This is more or less the result (due to Hurwitz in 1895) that a composition algebra has dimension 1,2,4,8. -- 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.
