'Return permutation that is other higher in rank than self.
The rank is the lexicographical rank, with the identity permutation
having rank of 0.
Examples
>>> from sympy.combinatorics.permutations import Permutation
>>> Permutation.print_cyclic = False
>>> I = Permutation([0, 1, 2, 3])
>>> a = Permutation([2, 1, 3, 0])
>>> I + a.rank() == a
True
See Also
__sub__, inversion_vector'

def __add__(self, other):

    rank = ((self.rank() + other) % self.cardinality)
    rv = self.unrank_lex(self.size, rank)
    rv._rank = rank
    return rv
