Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Superpermutation> ?p ?o. }
Showing items 1 to 14 of
14
with 100 items per page.
- Superpermutation abstract "In combinatorial mathematics, a superpermutation on n symbols is a string that contains each permutation of n symbols as a substring. The smallest superpermutations for n < 5 are 1, 121, 123121321, and 123412314231243121342132413214321, having lengths of 1, 3, 9, and 33 (sequence A180632 in OEIS). For all n, there is a superpermutation of length 1! + 2! + … + n!, which is conjectured to be minimal.".
- Superpermutation wikiPageExternalLink the-minimal-superpermutation-problem.
- Superpermutation wikiPageExternalLink non-uniqueness-of-minimal-superpermutations.
- Superpermutation wikiPageID "42223508".
- Superpermutation wikiPageRevisionID "600936023".
- Superpermutation subject Category:Combinatorics_on_words.
- Superpermutation subject Category:Enumerative_combinatorics.
- Superpermutation comment "In combinatorial mathematics, a superpermutation on n symbols is a string that contains each permutation of n symbols as a substring. The smallest superpermutations for n < 5 are 1, 121, 123121321, and 123412314231243121342132413214321, having lengths of 1, 3, 9, and 33 (sequence A180632 in OEIS). For all n, there is a superpermutation of length 1! + 2! + … + n!, which is conjectured to be minimal.".
- Superpermutation label "Superpermutation".
- Superpermutation sameAs m.0100pp9t.
- Superpermutation sameAs Q17048413.
- Superpermutation sameAs Q17048413.
- Superpermutation wasDerivedFrom Superpermutation?oldid=600936023.
- Superpermutation isPrimaryTopicOf Superpermutation.