Optimization over Young Diagrams
Optimization and Control
2021-10-28 v1 Discrete Mathematics
Data Structures and Algorithms
Combinatorics
Abstract
We consider the problem of finding a Young diagram minimizing the sum of evaluations of a given pair of functions on the parts of the associated pair of conjugate partitions. While there are exponentially many diagrams, we show it is polynomial time solvable.
Cite
@article{arxiv.2009.05953,
title = {Optimization over Young Diagrams},
author = {Shmuel Onn},
journal= {arXiv preprint arXiv:2009.05953},
year = {2021}
}