On Supmodular Matrices
Combinatorics
2024-09-13 v1 Discrete Mathematics
Data Structures and Algorithms
Optimization and Control
Abstract
We consider the problem of determining which matrices are permutable to be supmodular. We show that for small dimensions any matrix is permutable by a universal permutation or by a pair of permutations, while for higher dimensions no universal permutation exists. We raise several questions including to determine the dimensions in which every matrix is permutable.
Cite
@article{arxiv.2309.07700,
title = {On Supmodular Matrices},
author = {Shmuel Onn},
journal= {arXiv preprint arXiv:2309.07700},
year = {2024}
}