论文标题
方形矩阵完成问题的新解决方案
A new solution to square matrix completion problem
论文作者
论文摘要
在本文中，我们为方形矩阵的经典完成问题提供了一种新颖的解决方案。随着时间的流逝，许多作者都研究了这个问题，并且在[2，3]中得到了完全解决。在本文中，我们将这个经典问题与纯粹的组合问题联系起来，该问题涉及整数及其在[4]中研究的大量化。我们在这些方法中表现出令人惊讶的关系，作为推论，我们在整数分区中获得了新的组合结果。
In this paper we give a novel solution to a classical completion problem for square matrices. This problem was studied by many authors through time, and it is completely solved in [2, 3]. In this paper we relate this classical problem to a purely combinatorial question involving partitions of integers and their majorizations studied in [4]. We show surprising relations in these approaches and as a corollary, we obtain a new combinatorial result on partitions of integers.
