A LATTICE GENERATED BY (0,1)-MATRICES

被引:0
|
作者
BRUALDI, RA
LIU, B
机构
[1] UNIV WISCONSIN,DEPT MATH,MADISON,WI 53706
[2] S CHINA NORMAL UNIV,DEPT MATH,GUANGZHOU,PEOPLES R CHINA
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We study the lattice generated by the class of m by n matrices of 0's and 1's with a fixed row sum vector and a fixed column sum vector.
引用
收藏
页码:183 / 190
页数:8
相关论文
共 50 条
  • [1] (0,1)-MATRICES
    KHOMENKO, NP
    VYVROT, TM
    DOPOVIDI AKADEMII NAUK UKRAINSKOI RSR SERIYA A-FIZIKO-MATEMATICHNI TA TECHNICHNI NAUKI, 1976, (10): : 887 - 889
  • [2] (0,1)-MATRICES
    JAGERS, AA
    AMERICAN MATHEMATICAL MONTHLY, 1979, 86 (06): : 505 - 506
  • [3] Packing of (0,1)-matrices
    Vialette, Stephane
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2006, 40 (04): : 519 - 535
  • [4] On the energy of (0,1)-matrices
    Kharaghani, H.
    Tayfeh-Rezaie, B.
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2008, 429 (8-9) : 2046 - 2051
  • [5] Majorization for (0,1)-matrices
    Dahl, Geir
    Guterman, Alexander
    Shteyner, Pavel
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2020, 585 : 147 - 163
  • [6] DECOMPOSITION OF (0,1)-MATRICES
    SWAMINATHAN, R
    VEERAMANI, D
    IEEE TRANSACTIONS ON COMPUTERS, 1994, 43 (05) : 629 - 633
  • [7] (0,1)-MATRICES AND DISCREPANCY
    Beasley, Leroy B.
    ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2021, 37 : 692 - 697
  • [8] COMPLEXITY OF THE CLOSEST VECTOR PROBLEM IN A LATTICE GENERATED BY (0,1)-MATRIX
    SZYMANSKI, BK
    SINHAROY, B
    INFORMATION PROCESSING LETTERS, 1992, 42 (03) : 121 - 126
  • [9] (0,1)-MATRICES AND GENERALIZED ULTRAMETRIC MATRICES
    XIANG Shuhuang(Department of Mathematics
    Journal of Systems Science & Complexity, 1999, (02) : 154 - 158
  • [10] GEOMETRIC MATRICES AND AN INEQUALITY FOR (0,1)-MATRICES
    VARGA, LE
    DISCRETE MATHEMATICS, 1990, 82 (03) : 303 - 315