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.

• 05E10 - Combinatorial aspects of representation theory