Lower bounds on zero–one matrices
Copyright policy )Lower bounds on zero–one matrices
Let \(R\) , \(U\) denote two zero-one matrices whose product \(T = R \times U\) is the full upper triangular zero-one matrix, i.e. each element is \(1\) if it is not under the main diagonal. By means of elementary tools of linear algebra the author establishes a lower bound for the sum of all entries of both \(R\) and \(U\) and proves that this lower bound is really reached.
Zero–one matrices, zero-one matrices, Numerical Analysis, Algebra and Number Theory, Matrix equations and identities, Lower bounds, Matrices of integers, lower bounds, matrix equations, Discrete Mathematics and Combinatorics, Matrix equations, Geometry and Topology, Combinatorial aspects of matrices (incidence, Hadamard, etc.)
Zero–one matrices, zero-one matrices, Numerical Analysis, Algebra and Number Theory, Matrix equations and identities, Lower bounds, Matrices of integers, lower bounds, matrix equations, Discrete Mathematics and Combinatorics, Matrix equations, Geometry and Topology, Combinatorial aspects of matrices (incidence, Hadamard, etc.)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!