Strongly stable rank and applications to matrix completion

被引:3
|
作者
Juett, Jason Robert [1 ]
Williams, Jessica Lynn [2 ]
机构
[1] Texas State Univ, Dept Math, San Marcos, TX USA
[2] Converse Coll, Dept Math & Comp Sci, Spartanburg, SC 29302 USA
关键词
Completable matrix; outer product; stable rank; strongly n-generated ideal; RINGS; IDEALS; THEOREM;
D O I
10.1080/00927872.2016.1251939
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We perform an in-depth study of strongly stable ranks of modules over a commutative ring. Here we define the strongly stable rank of a module to be the supremum of the stable ranks of its finitely generated submodules. As an application, we give non-Noetherian generalizations of known facts about outer products and matrix completions over PIRs and Dedekind domains. We construct Noetherian and non-Noetherian domains of arbitrary strongly stable rank. We also consider strongly n-generated ideals, and we characterize the rings in which every ideal is strongly 2-generated and the domains in which every ideal is strongly 3-generated.
引用
收藏
页码:3967 / 3985
页数:19
相关论文
共 50 条
  • [1] Maximum rank matrix completion
    Geelen, JF
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1999, 288 (1-3) : 211 - 217
  • [2] Matrix completion and tensor rank
    Derksen, Harm
    LINEAR & MULTILINEAR ALGEBRA, 2016, 64 (04): : 680 - 685
  • [3] Decomposition Approach for Low-Rank Matrix Completion and Its Applications
    Ma, Rick
    Barzigar, Nafise
    Roozgard, Aminmohammad
    Cheng, Samuel
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2014, 62 (07) : 1671 - 1683
  • [4] Low-Rank Solutions of Matrix Inequalities With Applications to Polynomial Optimization and Matrix Completion Problems
    Madani, Ramtin
    Fazelnia, Ghazal
    Sojoudi, Somayeh
    Lavaei, Javad
    2014 IEEE 53RD ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2014, : 4328 - 4335
  • [5] Low-Rank Matrix Completion
    Chi, Yuejie
    IEEE SIGNAL PROCESSING MAGAZINE, 2018, 35 (05) : 178 - 181
  • [6] Online high rank matrix completion
    Fan, Jicong
    Udell, Madeleine
    2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, : 8682 - 8690
  • [7] Stable Rank-One Matrix Completion is Solved by the Level 2 Lasserre Relaxation
    Cosse, Augustin
    Demanet, Laurent
    FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2021, 21 (04) : 891 - 940
  • [8] Stable Rank-One Matrix Completion is Solved by the Level 2 Lasserre Relaxation
    Augustin Cosse
    Laurent Demanet
    Foundations of Computational Mathematics, 2021, 21 : 891 - 940
  • [9] ORTHOGONAL RANK-ONE MATRIX PURSUIT FOR LOW RANK MATRIX COMPLETION
    Wang, Zheng
    Lai, Ming-Jun
    Lu, Zhaosong
    Fan, Wei
    Davulcu, Hasan
    Ye, Jieping
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2015, 37 (01): : A488 - A514
  • [10] Rank-One Matrix Pursuit for Matrix Completion
    Wang, Zheng
    Lai, Ming-Jun
    Lu, Zhaosong
    Fan, Wei
    Davulcu, Hasan
    Ye, Jieping
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 32 (CYCLE 2), 2014, 32 : 91 - 99