Hi!
Perhaps you can try something like this:
DeleteDuplicates[list1, And[Length@FindFreeIndices[#1] ===
Length@FindFreeIndices[#2], EqualExpressionsQ[#1, #2]] &]
or
DeleteDuplicates[list1, And[Length@FindFreeIndices[#1] ===
Length@FindFreeIndices[#2],
First@xAct`SymManipulator`Private`SpecialEqualExpressionsQ[#1,
#2]] &]
I don't know if this is exactly what you wanted though. I don't
know why the first version is slow.
"EqualExpressionsQ[expr1, expr2] returns True if there is a permutation of the free indices of expr1 such that its canonical form equals that of expr2, and False otherwise. "
The slightly modified version in SymManipulator does the same, but outputs more information about the change in free indices.
Regards
Thomas
--
You received this message because you are subscribed to the Google Groups "xAct Tensor Computer Algebra" group.
To unsubscribe from this group and stop receiving emails from it, send an email to xact+uns...@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/xact/9fcdcea7-4270-4bc0-826e-08941dd6f736n%40googlegroups.com.