Defines superpermutation matrices, reduces their row/column minimization to a universal word problem for quotient classes in S_n, and proves the ratio of the resulting upper and lower bounds tends to 2 as n grows.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Superpermutation matrices
Defines superpermutation matrices, reduces their row/column minimization to a universal word problem for quotient classes in S_n, and proves the ratio of the resulting upper and lower bounds tends to 2 as n grows.