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 条
  • [21] DECENTRALIZED LOW-RANK MATRIX COMPLETION
    Ling, Qing
    Xu, Yangyang
    Yin, Wotao
    Wen, Zaiwen
    2012 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2012, : 2925 - 2928
  • [22] Adaptive Low-Rank Matrix Completion
    Tripathi, Ruchi
    Mohan, Boda
    Rajawat, Ketan
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2017, 65 (14) : 3603 - 3616
  • [23] Completion of matrix pencils with a single rank restriction
    Dodig, Marija
    Stosic, Marko
    LINEAR & MULTILINEAR ALGEBRA, 2022, 70 (21): : 7027 - 7048
  • [24] A Gradient System for Low Rank Matrix Completion
    Scalone, Carmela
    Guglielmi, Nicola
    AXIOMS, 2018, 7 (03)
  • [25] Matrix completion via minimizing an approximate rank
    Zeng, Xueying
    Shen, Lixin
    Xu, Yuesheng
    Lu, Jian
    ANALYSIS AND APPLICATIONS, 2019, 17 (05) : 689 - 713
  • [26] A gradual rank increasing process for matrix completion
    Achiya Dax
    Numerical Algorithms, 2017, 76 : 959 - 976
  • [27] Accelerated low rank matrix approximate algorithms for matrix completion
    Wang, Jin
    Wang, Yan-Ping
    Xu, Zhi
    Wang, Chuan-Long
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2019, 77 (02) : 334 - 341
  • [28] On the equivalence between low-rank matrix completion and tensor rank
    Derksen, Harm
    LINEAR & MULTILINEAR ALGEBRA, 2018, 66 (04): : 645 - 667
  • [29] Estimating α-Rank from A Few Entries with Low Rank Matrix Completion
    Du, Yali
    Yan, Xue
    Chen, Xu
    Wang, Jun
    Zhang, Haifeng
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [30] MINIMUM-RANK POSITIVE SEMIDEFINITE MATRIX COMPLETION WITH CHORDAL PATTERNS AND APPLICATIONS TO SEMIDEFINITE RELAXATIONS
    Jiang X.
    Sun Y.
    Andersen M.S.
    Vandenberghe L.
    Applied Set-Valued Analysis and Optimization, 2023, 5 (02): : 265 - 283