Displaying similar documents to “Completely positive matrices over Boolean algebras and their CP-rank”

Linear operators preserving maximal column ranks of nonbinary boolean matrices

Seok-Zun Song, Sung-Dae Yang, Sung-Min Hong, Young-Bae Jun, Seon-Jeong Kim (2000)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

The maximal column rank of an m by n matrix is the maximal number of the columns of A which are linearly independent. We compare the maximal column rank with rank of matrices over a nonbinary Boolean algebra. We also characterize the linear operators which preserve the maximal column ranks of matrices over nonbinary Boolean algebra.

Boolean matrices ... neither Boolean nor matrices

Gabriele Ricci (2000)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

Boolean matrices, the incidence matrices of a graph, are known not to be the (universal) matrices of a Boolean algebra. Here, we also show that their usual composition cannot make them the matrices of any algebra. Yet, later on, we "show" that it can. This seeming paradox comes from the hidden intrusion of a widespread set-theoretical (mis) definition and notation and denies its harmlessness. A minor modification of this standard definition might fix it.

Power indices of trace zero symmetric Boolean matrices

Bo Zhou (2004)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

The power index of a square Boolean matrix A is the least integer d such that Ad is a linear combination of previous nonnegative powers of A. We determine the maximum power indices for the class of n×n primitive symmetric Boolean matrices of trace zero, the class of n×n irreducible nonprimitive symmetric Boolean matrices, and the class of n×n reducible symmetric Boolean matrices of trace zero, and characterize the extreme matrices respectively.

Elementary triangular matrices and inverses of k-Hessenberg and triangular matrices

Luis Verde-Star (2015)

Special Matrices

Similarity:

We use elementary triangular matrices to obtain some factorization, multiplication, and inversion properties of triangular matrices. We also obtain explicit expressions for the inverses of strict k-Hessenberg matrices and banded matrices. Our results can be extended to the cases of block triangular and block Hessenberg matrices. An n × n lower triangular matrix is called elementary if it is of the form I + C, where I is the identity matrix and C is lower triangular and has all of its...

Pentadiagonal Companion Matrices

Brydon Eastman, Kevin N. Vander Meulen (2016)

Special Matrices

Similarity:

The class of sparse companion matrices was recently characterized in terms of unit Hessenberg matrices. We determine which sparse companion matrices have the lowest bandwidth, that is, we characterize which sparse companion matrices are permutationally similar to a pentadiagonal matrix and describe how to find the permutation involved. In the process, we determine which of the Fiedler companion matrices are permutationally similar to a pentadiagonal matrix. We also describe how to find...

An Inferentially Many-Valued Two-Dimensional Notion of Entailment

Carolina Blasio, João Marcos, Heinrich Wansing (2017)

Bulletin of the Section of Logic

Similarity:

Starting from the notions of q-entailment and p-entailment, a two-dimensional notion of entailment is developed with respect to certain generalized q-matrices referred to as B-matrices. After showing that every purely monotonic singleconclusion consequence relation is characterized by a class of B-matrices with respect to q-entailment as well as with respect to p-entailment, it is observed that, as a result, every such consequence relation has an inferentially four-valued characterization....