Questions tagged [superpermutation]

Use this tag only for superpermutations which are a string containing all of the permutations as a substring of the superpermutation. In other words, the one string (superpermutation) has all of the permutations included in the string as a substring; the substrings can overlap each other which reduces the size of the string.

References

  1. Wikipedia
  2. YouTube by Matt Parker
  3. Superpermutations by Greg Egan
4 questions
11
votes
5 answers

generate sequence with all permutations

How can I generate the shortest sequence with contains all possible permutations? Example: For length 2 the answer is 121, because this list contains 12 and 21, which are all possible permutations. For length 3 the answer is 123121321, because this…
compie
  • 10,135
  • 15
  • 54
  • 78
3
votes
2 answers

Superpermutation in Prolog

I want to watch 6 episodes of "friends" in all possible permutations. How can I arrange the episodes in one string so that the substrings of length 6 cover all permutations? What are the shortest such strings? What would be the Prolog code for that?…
user502187
-1
votes
1 answer

Roman Transliteration: multiple alternates of single English letter, permutation and combination

i need help in super permutation i have 3 letters long string "fhd" i want to write each ones alternate in sindhi language but problem is that sindhi language has multiple alternates of each of above letter so i have 3 list boxes one for each…
-2
votes
1 answer

Expand the following dictionary into following list

how to generate the following list from the following dictionary d = {2: 4, 3: 1, 5: 3} f = [ 2**1,2**2, 2**3, 2**4, 3**1, 5**1, 5**2, 5**3, 2**1 * 3, 2**2 * 3, 2**3 * 3, 2**4 * 3, 5**1 * 3, 5**2 * 3, 5**3 * 3, 2**1 * 5, 2**2 * 5,…
ishandutta2007
  • 16,676
  • 16
  • 93
  • 129