Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re: How to get the translation seed?

by jethro (Monsignor)
on Aug 31, 2011 at 14:53 UTC ( #923444=note: print w/ replies, xml ) Need Help??


in reply to How to get the translation seed?

Lets talk some more basics: perm(x,y) simply permutes y with the permutation x, right? And the regex in the first post of the original thread (lets call it origperm()) does a few different(!) but fixed (if I didn't read the code wrong) permutations.

Now you could just find out the permutation that is the sum of all permutations done on the string. That would be quite fast but not very exiting. Instead you want to calculate each single permutation done by each single invocation of the origperm regex, so that y=perm(yourcalculatedperm_n,y) is equivalent to the n-th invocation of y=origperm_n(y) ?

If Ithis is not the case (and I suspect I'm wrong somewhere), please enlighten me/us.

PS: I have not tried to decipher comp(). I assume that it would be a lot faster if you just tell us what it does in mathematical terms. This might be true for your whole question. A math question is best asked in math language


Comment on Re: How to get the translation seed?
Re^2: How to get the translation seed?
by emilbarton (Scribe) on Aug 31, 2011 at 15:13 UTC

    This question has not much to see with what you call origperm(), nor with comp(). Besides I don't know much about maths and I don't know how to say what I've said in a better way, sorry. I hope this will not impede you and others to think about the meaning of what I've asked.

How could it look like?
by emilbarton (Scribe) on Aug 31, 2011 at 15:34 UTC

    If you want a clue about what I expect, consider this. We have seen that the well ordered suite can be obtained by means of perm() after a certain amount of iterations. This is because permutations are cyclic. Now each permutation then has a certain cyclic value. I can imagine that a particular means of obtaining "n012.." could make use of this cyclic value and thus the rule might look like:

    For any permutations x and y, if x has a cyclic value of (max cyclic value for the base) and y (medium cyclic value for the base) then "n012.." can be obtained by the following composition of perm()...

    But this is just imagination about what I would like to know.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://923444]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (5)
As of 2014-07-26 17:12 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (178 votes), past polls