Optimization over Young diagrams

Shmuel Onn

doi:10.1007/s10801-020-00982-z

Optimization over Young diagrams

Shmuel Onn

Data and Decision Sciences

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	689-692
Number of pages	4
Journal	Journal of Algebraic Combinatorics
Volume	54
Issue number	3
DOIs	https://doi.org/10.1007/s10801-020-00982-z
State	Published - Nov 2021

Keywords

Discrete optimization
Number partition
Young diagram

All Science Journal Classification (ASJC) codes

Algebra and Number Theory
Discrete Mathematics and Combinatorics

Access to Document

10.1007/s10801-020-00982-z

Cite this

@article{1d2a3d7cad5a4c988568dccf91cbaac4,

title = "Optimization over Young diagrams",

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.",

keywords = "Discrete optimization, Number partition, Young diagram",

author = "Shmuel Onn",

note = "Publisher Copyright: {\textcopyright} 2020, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2021",

month = nov,

doi = "10.1007/s10801-020-00982-z",

language = "الإنجليزيّة",

volume = "54",

pages = "689--692",

journal = "Journal of Algebraic Combinatorics",

issn = "0925-9899",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - Optimization over Young diagrams

AU - Onn, Shmuel

PY - 2021/11

Y1 - 2021/11

N2 - 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.

AB - 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.

KW - Discrete optimization

KW - Number partition

KW - Young diagram

UR - http://www.scopus.com/inward/record.url?scp=85092785702&partnerID=8YFLogxK

U2 - 10.1007/s10801-020-00982-z

DO - 10.1007/s10801-020-00982-z

M3 - مقالة

SN - 0925-9899

VL - 54

SP - 689

EP - 692

JO - Journal of Algebraic Combinatorics

JF - Journal of Algebraic Combinatorics

IS - 3

ER -

Optimization over Young diagrams

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this