> Hey, do you sleep sometimes, too? Or is there two Ralf Hemmecke?
Yes. Yes. (Although the second one is probably not interested in
combiatorial species.)
> (isotypes are probably as difficult as can be)
Sure, so we'll first do the easy stuff.
>> However, I don't want to commit without a test battery.
>
> I think a good test would be graphs:
> FC(Subsets, Combinations(2))
> Subsets is implemented in iso-experiments, Combinations *nearly*: "structures"
> is missing...
Heh? You did this just for efficiency?
Why can't we use
Subsets = SetSpecies * SetSpecies
and
Combinations(2) = RestrictedSpecies(SetSpecies, 2) * SetSpecies
as is described in BLL?
> But the first few terms of the generating function are in BLL.
Ah!!! Indeed. I wanted to take that example, but I didn't have the series.
BLL says in section 1.2 (G = simple graph species)
G(x) = \sum_{n=0}^\infty {2^{\binom{n}{2}} \frac{x^n}{n!}}
Thank you.
Ralf
PS: I'll have the same question for CartesianProduct tomorrow, but then
I guess I also need a test for the cycle index series. ... ooops there
is one in BLL, but we don't have oriented cyles yet. :-(
PS2: Are you documenting your code?
-------------------------------------------------------------------------
Take Surveys. Earn Cash. Influence the Future of IT
Join SourceForge.net's Techsay panel and you'll get the chance to share your
opinions on IT & business topics through brief surveys-and earn cash
http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV
_______________________________________________
Aldor-combinat-devel mailing list
Aldor-combinat-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/aldor-combinat-devel
