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 条
  • [31] Matrix Completion via Successive Low-rank Matrix Approximation
    Wang, Jin
    Mo, Zeyao
    EAI ENDORSED TRANSACTIONS ON SCALABLE INFORMATION SYSTEMS, 2023, 10 (03)
  • [32] Quaternion Matrix Factorization for Low-Rank Quaternion Matrix Completion
    Chen, Jiang-Feng
    Wang, Qing-Wen
    Song, Guang-Jing
    Li, Tao
    MATHEMATICS, 2023, 11 (09)
  • [33] Low-Rank Matrix Completion: A Contemporary Survey
    Luong Trung Nguyen
    Kim, Junhan
    Shim, Byonghyo
    IEEE ACCESS, 2019, 7 : 94215 - 94237
  • [34] Realizability of Polytopes as a Low Rank Matrix Completion Problem
    Dobbins, Michael Gene
    DISCRETE & COMPUTATIONAL GEOMETRY, 2014, 51 (04) : 761 - 778
  • [35] SRF: MATRIX COMPLETION BASED ON SMOOTHED RANK FUNCTION
    Ghasemi, Hooshang
    Malek-Mohammadi, Mohmmadreza
    Babaie-Zadeh, Massoud
    Jutten, Christian
    2011 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2011, : 3672 - 3675
  • [36] Low-rank approximation pursuit for matrix completion
    Xu, An-Bao
    Xie, Dongxiu
    MECHANICAL SYSTEMS AND SIGNAL PROCESSING, 2017, 95 : 77 - 89
  • [37] MATRIX COMPLETION FOR MATRICES WITH LOW-RANK DISPLACEMENT
    Lazzaro, Damiana
    Morigi, Serena
    ELECTRONIC TRANSACTIONS ON NUMERICAL ANALYSIS, 2020, 53 : 481 - 499
  • [38] Low-Rank and Sparse Matrix Completion for Recommendation
    Zhao, Zhi-Lin
    Huang, Ling
    Wang, Chang-Dong
    Lai, Jian-Huang
    Yu, Philip S.
    NEURAL INFORMATION PROCESSING, ICONIP 2017, PT V, 2017, 10638 : 3 - 13
  • [39] Realizability of Polytopes as a Low Rank Matrix Completion Problem
    Michael Gene Dobbins
    Discrete & Computational Geometry, 2014, 51 : 761 - 778
  • [40] A Geometric Approach to Low-Rank Matrix Completion
    Dai, Wei
    Kerman, Ely
    Milenkovic, Olgica
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (01) : 237 - 247