Thanks for this. A ref to sage is a good idea.
There is a nice paper by Nicholas Harvey which deals with symbolic
issues around Binet-Cauchy and matroids:
http://people.csail.mit.edu/nickh/Publications/AlgebraicMatching/Algebraic-SIAM.pdf
Maybe closer to your interests, Alan Sokal has done a lot o
Thanks that's great!
The pretty printing didn't seem to do much in my native Python shell.
I should probably be using IPython and then isympy but I think I
prefer to stick to the basics since a Windows-based worksheet is sure
to skew things otherwise!
Good idea about links to further work.
Yes,
Hi Robin,
Maybe a useful resource for you could be the graph theory work in
sage:
http://www.sagemath.org/doc/reference/graphs.html
and the associated book being written
http://code.google.com/p/graph-theory-algorithms-book/
Also, have you got a nice reference that talks about the Binet-Cauchy
in
