Universal layered permutations

被引：0
|
作者：
Albert, Michael [1 ]
Engen, Michael [2 ]
Pantone, Jay [3 ]
Vatter, Vincent [2 ]
机构：
[1] Univ Otago, Dept Comp Sci, Dunedin, New Zealand
[2] Univ Florida, Dept Math, Gainesville, FL 32611 USA
[3] Dartmouth Coll, Dept Math, Hanover, NH 03755 USA
来源：
ELECTRONIC JOURNAL OF COMBINATORICS | 2018年 / 25卷 / 03期
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We establish an exact formula for the length of the shortest permutation containing all layered permutations of length n, proving a conjecture of Gray.
引用
收藏
页数：5
相关论文
共 50 条
  • [1] UNIVERSAL GRAPHS AND UNIVERSAL PERMUTATIONS
    Atminas, Aistis
    Lozin, Vadim V.
    Kitaev, Sergey
    Valyuzhenich, Alexandr
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2013, 5 (04)
  • [2] Universal cycles for permutations
    Johnson, J. Robert
    [J]. DISCRETE MATHEMATICS, 2009, 309 (17) : 5264 - 5270
  • [3] Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations
    Bastos, Josefran de Oliveira
    Coregliano, Leonardo Nagami
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2016, 18 (02):
  • [4] A New Universal Cycle for Permutations
    Dennis Wong
    [J]. Graphs and Combinatorics, 2017, 33 : 1393 - 1399
  • [5] Shortened universal cycles for permutations
    Kirsch, Rachel
    Lidicky, Bernard
    Sibley, Clare
    Sprangel, Elizabeth
    [J]. DISCRETE APPLIED MATHEMATICS, 2023, 324 : 219 - 228
  • [6] A New Universal Cycle for Permutations
    Wong, Dennis
    [J]. GRAPHS AND COMBINATORICS, 2017, 33 (06) : 1393 - 1399
  • [7] Shorthand Universal Cycles for Permutations
    Holroyd, Alexander E.
    Ruskey, Frank
    Williams, Aaron
    [J]. ALGORITHMICA, 2012, 64 (02) : 215 - 245
  • [8] Shorthand Universal Cycles for Permutations
    Alexander E. Holroyd
    Frank Ruskey
    Aaron Williams
    [J]. Algorithmica, 2012, 64 : 215 - 245
  • [9] Density Maximizers of Layered Permutations
    Kabela, Adam
    Kral, Daniel
    Noel, Jonathan A.
    Pierron, Theo
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2022, 29 (03):
  • [10] Hamiltonicity of digraphs for universal cycles of permutations
    Isaak, G
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2006, 27 (06) : 801 - 805
12345