通过Keith-Nath变换和Young图分析最大不可细分划分的几何特征
A Geometric Characterization of Maximal Unrefinable Partitions via the Keith-Nath Transformation and Young Diagrams
AI总结：
本文通过Keith-Nath变换和Young图分析，提出了一种几何方法来表征最大不可细分划分的结构特性。
摘要：
我们通过数值集和Young图之间的对应关系，研究不可细分划分的组合结构。基于Keith和Nath引入的双射，我们应用一个通用的几何准则，将划分的不可细分性直接与关联的Young图的钩长联系起来。该准则提供了一种结构化的方法来表征任何不可细分划分。利用这一通用框架，我们重新审视了最大不可细分划分与由不同部分构成的划分之间的对应关系，此前已通过枚举方法建立。我们提供了替代的、纯粹组合学的证明，重点在于Young图的刚性对称结构。在三角权值情况下，我们证明相应的图是准对称的，即在单列额外的情况下对称。我们将此分析扩展到非三角情况，显示图要么表现出相同的准对称结构，要么根据最大部分是完美自共轭的。
英文摘要：
We investigate the combinatorial structure of unrefinable partitions through their correspondence with numerical sets and Young diagrams. Building on the bijection introduced by Keith and Nath, we apply a general geometric criterion that links the unrefinability of a partition directly to the hook lengths of its associated Young diagram. This criterion provides a structural method for the characterization of any unrefinable partition. Using this general framework, we revisit the correspondence results between maximal unrefinable partitions and partitions into distinct parts, previously established using enumerative methods. We provide alternative and purely combinatorial proofs of these bijections, focusing on the rigid symmetry structures of the Young diagrams. In the triangular weight case, we show that the corresponding diagrams are quasi-symmetric, i.e. symmetric up to a single extra column. We extend this analysis to the nontriangular case, showing that the diagrams either exhibit this same quasi-symmetric structure or are perfectly self-conjugate, depending on the maximal part.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
