[GAP Forum] Set Partitions

[fatemeh moftakhar]

Dear Colleagues,

I need to the algorithm of computing the number of partitions of an n-set
in GAP. Could you please send me the address of a paper or a book that
contains such an algorithm?
My main question is complexity of the algorithm that GAP uses for
generating set partitions. I know the following paper that the complexity
of this algorithm is \theta(1.6). Is this complexity  better than GAP
algorithm?

M. C. ER, A fast algorithm for generating set partitions, The Computer
Journal, 31(3) (1988) 283-284.

Best regards
Fatemeh Moftakhar


-- 
Regards;
Miss Fatemeh Moftakhar
PhD Candidate,
Department of Pure Mathematics,
Faculty of Mathematical Sciences,
University of Kashan, Kashan, Iran