Starting with an additive group Zn (group of integers modulo n) to find all combinations of m elements, removing all translates of a combination. By a translate T+i of combination T, I mean the combinations whose elements can be expressed as a+i for each a in T , where i is a fixed non-zero in Zn .
For example if we run this
n=int(input("Enter the order of the group Zn : "))
G=Zmod(n)
m=int(input("Enter the order of the Combination required: "))
CMB= Combinations(G,m)
show(CMB.list())
Then for n=5 and m=3 we get the following output
π²πΌπ±=[[0,1,2],[0,1,3],[0,1,4],[0,2,3],[0,2,4],[0,3,4],[1,2,3],[1,2,4],[1,3,4],[2,3,4]]
Here the translates of [0,1,2] are [1,2,3], [2,3,4],[0,3,4],[0,1,4] where i =,1,2,3,4, respectively
I want to retain only [0,1,2] and remove all its translates from the output.