Saved in:
Bibliographic Details
Main Authors: Duzhin, Vasilii, Smirnov-Maltsev, Egor
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2311.15199
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917588574928896
author Duzhin, Vasilii
Smirnov-Maltsev, Egor
author_facet Duzhin, Vasilii
Smirnov-Maltsev, Egor
contents We study the problem of finding Young diagrams of maximum dimension, i. e. those with the largest number of Young tableaux of their shapes. Consider a class of Young diagrams that differ from a symmetric diagram by no more than one box $(i,j)$ in each row and column. It is proven that when moving boxes $(i,j), i>j$ to symmetric positions $(j,i)$, the original diagram is transformed into another diagram of the same size, but with a greater or equal dimension. A conjecture is formulated that generalizes the above fact to the case of arbitrary Young diagrams. Based on this conjecture, we developed an algorithm applied to obtain new Young diagrams of sizes up to 42 thousand boxes with large and maximum dimensions.
format Preprint
id arxiv_https___arxiv_org_abs_2311_15199
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle On Young diagrams of maximum dimension
Duzhin, Vasilii
Smirnov-Maltsev, Egor
Combinatorics
We study the problem of finding Young diagrams of maximum dimension, i. e. those with the largest number of Young tableaux of their shapes. Consider a class of Young diagrams that differ from a symmetric diagram by no more than one box $(i,j)$ in each row and column. It is proven that when moving boxes $(i,j), i>j$ to symmetric positions $(j,i)$, the original diagram is transformed into another diagram of the same size, but with a greater or equal dimension. A conjecture is formulated that generalizes the above fact to the case of arbitrary Young diagrams. Based on this conjecture, we developed an algorithm applied to obtain new Young diagrams of sizes up to 42 thousand boxes with large and maximum dimensions.
title On Young diagrams of maximum dimension
topic Combinatorics
url https://arxiv.org/abs/2311.15199