skip to main content

SciTech ConnectSciTech Connect

Title: On Boolean matrices with full factor rank

It is demonstrated that every (0,1)-matrix of size n×m having Boolean rank n contains a column with at least √n/2−1 zero entries. This bound is shown to be asymptotically optimal. As a corollary, it is established that the size of a full-rank Boolean matrix is bounded from above by a function of its tropical and determinantal ranks. Bibliography: 16 titles.
Authors:
 [1]
  1. National Research University "Higher School of Economics", Moscow (Russian Federation)
Publication Date:
OSTI Identifier:
22365881
Resource Type:
Journal Article
Resource Relation:
Journal Name: Sbornik. Mathematics; Journal Volume: 204; Journal Issue: 11; Other Information: Country of input: International Atomic Energy Agency (IAEA)
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICAL METHODS AND COMPUTING; ASYMPTOTIC SOLUTIONS; CALCULATION METHODS; FUNCTIONS; MATRICES