apply Permutation cycles to a letters list

edit

But that doesn't accept singletons is a minor problem

First, to specify tuples with single cycles, you need to have an extra "," - like ((4,5),) and ((1,2,3),). Second, to construct permutations with implicut presence of singletons you can replace test=Permutation(t) with

import sage.combinat.permutation as permutation
test = permutation.from_cycles(len(L),t)

Thank you @Max Alekseyev

import string
import sage.combinat.permutation as permutation
nl=12 # letters number
L=list(string.ascii_lowercase[0:nl])
tuplesL=[ ((1,5,8,4),(2,6,7,3)), ((4,5),),((1,2,3),),((1,2,3),(4,5),),((1,2,3),(4,5),(7,8)),((1, 2 ,6),(3, 5),)]
for t in tuplesL :
    print('permutation tuples= ',t)
    try :
        test=permutation.from_cycles(len(L),t)
        print('Max Alekseyev solution OK : ',[L[test[i] - 1] for i in range(len(L))])
    except :
        print('error from Max Alekseyev solution solution')

is it possible to transform Max Alekseyev solution as THE solution of this question ?

Just edit your own answer.

I wanted to copy Max Alekseyev's solution into the incomplete solution I gave.So first, I tried to transform my answer into a comment using the menu --> more --> repost as a question comment, but nothing happens.