A new solution to square matrix completion problem
Combinatorics
2020-02-26 v1
Abstract
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.
Cite
@article{arxiv.2002.10925,
title = {A new solution to square matrix completion problem},
author = {Marija Dodig and Marko Stosic},
journal= {arXiv preprint arXiv:2002.10925},
year = {2020}
}
Comments
9 pages