On Tue, 12 Feb 2008 at 10:50PM -0500, David Roe wrote: > So, these kinds of issues were the subject of the coercion project at > SD7. Robert Bradshaw, Mike Hansen, Bobby Moretti and I are currently > in the process of changing a lot of the infrastructure behind parents, > elements, etc. If you want to help (or want to see our current > progress) see the sprint page at > http://wiki.sagemath.org/days7/coercion or contact one of us via > e-mail.
This is something that interests me, although I don't know how much help I can be. I'd like to add combinatorial classes for complete matchings of [n] to Sage. Matchings are thought of in several different ways: as set partitions with blocks of size 2, as fixed-point-free involutions (permutations of order 2), and as matchings of the complete graph. I would definitely like to mix these things, and add more. (In some recent research, I found myself wanting to define a poset structure on the edges of matchings.) So I don't have any smart ideas, but perhaps this could be one data point for how users want coercion/multiple inheritance to work. Dan -- --- Dan Drake <[EMAIL PROTECTED]> ----- KAIST Department of Mathematical Sciences ------- http://math.kaist.ac.kr/~drake
signature.asc
Description: Digital signature
