翻訳と辞書 |
Superpermutation : ウィキペディア英語版 | Superpermutation 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 . For all ''n'', there is a superpermutation of length 1! + 2! + … + ''n''!, which is minimal only for ''n'' < 6. ==See also==
*Superpattern, a permutation that contains each permutation of ''n'' symbols as a permutation pattern
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Superpermutation」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|