Need help with my paper on Superpermutations

[Math lo]

I've been working on an idea that might be used to prove the minimal superpermutation. I've written up my ideas in a pdf. Can anyone take a look at it and give me some feedback? I am not a trained mathematician so I apologize if I do not communicate my ideas properly.

[Miles Gould]

Hi!

It looks like you've rediscovered the recursive algorithm for constructing superpermutations, described in the section "The Recursive Algorithm" at https://www.gregegan.net/SCIENCE/Superpermutations/Superpermutations.html (which is a great guide in general to what's currently known about superpermutations). The output of the recursive algorithm is minimal for n <= 5, and was conjectured to be minimal for all n, but we now have examples of shorter superpermutations for n >= 6. See https://docs.google.com/spreadsheets/d/1m8mHizDHoDpT-9ohCiqmfKyQI6gmhuyuzb7TC7362Ko/edit#gid=0 for what I think is still the current state of the art.

Hope that helps,

Miles

On Sun, 1 Aug 2021 at 13:58, Math lo <mahlo...@gmail.com> wrote:

I've been working on an idea that might be used to prove the minimal superpermutation. I've written up my ideas in a pdf. Can anyone take a look at it and give me some feedback? I am not a trained mathematician so I apologize if I do not communicate my ideas properly.

--
You received this message because you are subscribed to the Google Groups "Superpermutators" group.
To unsubscribe from this group and stop receiving emails from it, send an email to superpermutato...@googlegroups.com.
To view this discussion on the web, visit https://groups.google.com/d/msgid/superpermutators/c1e4adff-2941-4b6a-b042-a55357135612n%40googlegroups.com.