Closed Fougeroc closed 2 months ago
If two permutation have a labels equal but with a different ranking in alphabet they are considered different. Is it supposed to be so ?
sage: from surface_dynamics import * sage: p1 = iet.GeneralizedPermutation(([0,1,1], [3,3,2,0,2])) sage: p2 = iet.GeneralizedPermutation(([0,2,1,1], [3,3,2,0])) sage: p3 = G.outgoing_edges(p1)[0][1] sage: p2._labels [[0, 1, 2, 2], [3, 3, 1, 0]] sage: p3._labels [[0, 3, 1, 1], [2, 2, 3, 0]] sage: p2 0 2 1 1 3 3 2 0 sage: p3 0 2 1 1 3 3 2 0 sage: p2 == p3 False
If two permutation have a labels equal but with a different ranking in alphabet they are considered different. Is it supposed to be so ?
sage: from surface_dynamics import * sage: p1 = iet.GeneralizedPermutation(([0,1,1], [3,3,2,0,2])) sage: p2 = iet.GeneralizedPermutation(([0,2,1,1], [3,3,2,0])) sage: p3 = G.outgoing_edges(p1)[0][1] sage: p2._labels [[0, 1, 2, 2], [3, 3, 1, 0]] sage: p3._labels [[0, 3, 1, 1], [2, 2, 3, 0]] sage: p2 0 2 1 1 3 3 2 0 sage: p3 0 2 1 1 3 3 2 0 sage: p2 == p3 False