EQUIVALENT FORMULATION OF INVARIANT SUBSPACE CONJECTURE

被引：21
|
作者：
DYER, JA
PEDERSEN, EA
PORCELLI, P
机构：
[1] SO UNIV,DEPT MATH,BATON ROUGE,LA 70813
[2] UNIV UTAH,DEPT MATH,SALT LAKE CITY,UT 84112
[3] LOUISIANA STATE UNIV,DEPT MATH,BATON ROUGE,LA 70803
来源：
BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY | 1972年 / 78卷 / 06期
关键词：
D O I：
10.1090/S0002-9904-1972-13090-8
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：1020 / 1023
页数：4
相关论文
共 50 条
  • [31] An Equivalent of Graceful Tree Conjecture
    Wang, Hongyu
    Yao, Bing
    PROCEEDINGS OF 2020 IEEE 5TH INFORMATION TECHNOLOGY AND MECHATRONICS ENGINEERING CONFERENCE (ITOEC 2020), 2020, : 1227 - 1231
  • [32] DETECTING LOCALIZATION IN AN INVARIANT SUBSPACE
    Voemel, Christof
    Parlett, Beresford N.
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2011, 33 (06) : 3447 - 3467
  • [33] THE SPECTRUM OF THE RESTRICTION TO AN INVARIANT SUBSPACE
    Drivaliaris, Dimosthenis
    Yannakakis, Nikos
    OPERATORS AND MATRICES, 2020, 14 (01): : 261 - 264
  • [34] THE α-INVARIANT AND THOMPSON'S CONJECTURE
    Tiep, Pham Huu
    FORUM OF MATHEMATICS PI, 2016, 4
  • [35] EQUIVALENT INVARIANT MEASURES
    ROSENBLATT, JM
    ISRAEL JOURNAL OF MATHEMATICS, 1974, 17 (03) : 261 - 270
  • [36] The Subspace Flatness Conjecture and Faster Integer Programming
    Reis, Victor
    Rothvoss, Thomas
    2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS, 2023, : 974 - 988
  • [37] On the discrete Conley index in the invariant subspace
    Szymczak, A
    Wojcik, K
    Zgliczynski, P
    TOPOLOGY AND ITS APPLICATIONS, 1998, 87 (02) : 105 - 115
  • [38] INVARIANT SUBSPACE THEOREMS ON OPEN SURFACES
    NEVILLE, CW
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (01): : A111 - A112
  • [39] INVARIANT SUBSPACE THEOREM - PRELIMINARY REPORT
    SALINAS, N
    PEARCY, CM
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1971, 18 (06): : 950 - &
  • [40] Some Resits on Invariant Subspace Problem
    侯晋川
    Acta Mathematica Sinica,English Series, 1986, (03) : 221 - 232
12345