Displaying similar documents to “Factorization of CP-rank- 3 completely positive matrices”

Possible isolation number of a matrix over nonnegative integers

LeRoy B. Beasley, Young Bae Jun, Seok-Zun Song (2018)

Czechoslovak Mathematical Journal

Similarity:

Let + be the semiring of all nonnegative integers and A an m × n matrix over + . The rank of A is the smallest k such that A can be factored as an m × k matrix times a k × n matrix. The isolation number of A is the maximum number of nonzero entries in A such that no two are in any row or any column, and no two are in a 2 × 2 submatrix of all nonzero entries. We have that the isolation number of A is a lower bound of the rank of A . For A with isolation number k , we investigate the possible values of the...

On the real X -ranks of points of n ( ) with respect to a real variety X n

Edoardo Ballico (2010)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

Let  X n be an integral and non-degenerate m -dimensional variety defined over . For any P n ( ) the real X -rank r X , ( P ) is the minimal cardinality of S X ( ) such that P S . Here we extend to the real case an upper bound for the X -rank due to Landsberg and Teitler.

Cardinalities of DCCC normal spaces with a rank 2-diagonal

Wei-Feng Xuan, Wei-Xue Shi (2016)

Mathematica Bohemica

Similarity:

A topological space X has a rank 2-diagonal if there exists a diagonal sequence on X of rank 2 , that is, there is a countable family { 𝒰 n : n ω } of open covers of X such that for each x X , { x } = { St 2 ( x , 𝒰 n ) : n ω } . We say that a space X satisfies the Discrete Countable Chain Condition (DCCC for short) if every discrete family of nonempty open subsets of X is countable. We mainly prove that if X is a DCCC normal space with a rank 2-diagonal, then the cardinality of X is at most 𝔠 . Moreover, we prove that if X is a first...

Computing the greatest 𝐗 -eigenvector of a matrix in max-min algebra

Ján Plavka (2016)

Kybernetika

Similarity:

A vector x is said to be an eigenvector of a square max-min matrix A if A x = x . An eigenvector x of A is called the greatest 𝐗 -eigenvector of A if x 𝐗 = { x ; x ̲ x x ¯ } and y x for each eigenvector y 𝐗 . A max-min matrix A is called strongly 𝐗 -robust if the orbit x , A x , A 2 x , reaches the greatest 𝐗 -eigenvector with any starting vector of 𝐗 . We suggest an O ( n 3 ) algorithm for computing the greatest 𝐗 -eigenvector of A and study the strong 𝐗 -robustness. The necessary and sufficient conditions for strong 𝐗 -robustness are introduced...

( 0 , 1 ) -matrices, discrepancy and preservers

LeRoy B. Beasley (2019)

Czechoslovak Mathematical Journal

Similarity:

Let m and n be positive integers, and let R = ( r 1 , ... , r m ) and S = ( s 1 , ... , s n ) be nonnegative integral vectors. Let A ( R , S ) be the set of all m × n ( 0 , 1 ) -matrices with row sum vector R and column vector S . Let R and S be nonincreasing, and let F ( R ) be the m × n ( 0 , 1 ) -matrix, where for each i , the i th row of F ( R , S ) consists of r i 1’s followed by ( n - r i ) 0’s. Let A A ( R , S ) . The discrepancy of A, disc ( A ) , is the number of positions in which F ( R ) has a 1 and A has a 0. In this paper we investigate linear operators mapping m × n matrices over...

On soluble groups of module automorphisms of finite rank

Bertram A. F. Wehrfritz (2017)

Czechoslovak Mathematical Journal

Similarity:

Let R be a commutative ring, M an R -module and G a group of R -automorphisms of M , usually with some sort of rank restriction on G . We study the transfer of hypotheses between M / C M ( G ) and [ M , G ] such as Noetherian or having finite composition length. In this we extend recent work of Dixon, Kurdachenko and Otal and of Kurdachenko, Subbotin and Chupordia. For example, suppose [ M , G ] is R -Noetherian. If G has finite rank, then M / C M ( G ) also is R -Noetherian. Further, if [ M , G ] is R -Noetherian and if only certain abelian...

On row-sum majorization

Farzaneh Akbarzadeh, Ali Armandnejad (2019)

Czechoslovak Mathematical Journal

Similarity:

Let 𝕄 n , m be the set of all n × m real or complex matrices. For A , B 𝕄 n , m , we say that A is row-sum majorized by B (written as A rs B ) if R ( A ) R ( B ) , where R ( A ) is the row sum vector of A and is the classical majorization on n . In the present paper, the structure of all linear operators T : 𝕄 n , m 𝕄 n , m preserving or strongly preserving row-sum majorization is characterized. Also we consider the concepts of even and circulant majorization on n and then find the linear preservers of row-sum majorization of these relations on 𝕄 n , m . ...

On the combinatorial structure of 0 / 1 -matrices representing nonobtuse simplices

Jan Brandts, Abdullah Cihangir (2019)

Applications of Mathematics

Similarity:

A 0 / 1 -simplex is the convex hull of n + 1 affinely independent vertices of the unit n -cube I n . It is nonobtuse if none of its dihedral angles is obtuse, and acute if additionally none of them is right. Acute 0 / 1 -simplices in I n can be represented by 0 / 1 -matrices P of size n × n whose Gramians G = P P have an inverse that is strictly diagonally dominant, with negative off-diagonal entries. In this paper, we will prove that the positive part D of the transposed inverse P - of P is doubly stochastic and has the...

The real symmetric matrices of odd order with a P-set of maximum size

Zhibin Du, Carlos Martins da Fonseca (2016)

Czechoslovak Mathematical Journal

Similarity:

Suppose that A is a real symmetric matrix of order n . Denote by m A ( 0 ) the nullity of A . For a nonempty subset α of { 1 , 2 , ... , n } , let A ( α ) be the principal submatrix of A obtained from A by deleting the rows and columns indexed by α . When m A ( α ) ( 0 ) = m A ( 0 ) + | α | , we call α a P-set of A . It is known that every P-set of A contains at most n / 2 elements. The graphs of even order for which one can find a matrix attaining this bound are now completely characterized. However, the odd case turned out to be more difficult to tackle. As...

Distance matrices perturbed by Laplacians

Balaji Ramamurthy, Ravindra Bhalchandra Bapat, Shivani Goel (2020)

Applications of Mathematics

Similarity:

Let T be a tree with n vertices. To each edge of T we assign a weight which is a positive definite matrix of some fixed order, say, s . Let D i j denote the sum of all the weights lying in the path connecting the vertices i and j of T . We now say that D i j is the distance between i and j . Define D : = [ D i j ] , where D i i is the s × s null matrix and for i j , D i j is the distance between i and j . Let G be an arbitrary connected weighted graph with n vertices, where each weight is a positive definite matrix of order...

On linear preservers of two-sided gut-majorization on 𝐌 n , m

Asma Ilkhanizadeh Manesh, Ahmad Mohammadhasani (2018)

Czechoslovak Mathematical Journal

Similarity:

For X , Y 𝐌 n , m it is said that X is gut-majorized by Y , and we write X gut Y , if there exists an n -by- n upper triangular g-row stochastic matrix R such that X = R Y . Define the relation gut as follows. X gut Y if X is gut-majorized by Y and Y is gut-majorized by X . The (strong) linear preservers of gut on n and strong linear preservers of this relation on 𝐌 n , m have been characterized before. This paper characterizes all (strong) linear preservers and strong linear preservers of gut on n and 𝐌 n , m .

Row Hadamard majorization on 𝐌 m , n

Abbas Askarizadeh, Ali Armandnejad (2021)

Czechoslovak Mathematical Journal

Similarity:

An m × n matrix R with nonnegative entries is called row stochastic if the sum of entries on every row of R is 1. Let 𝐌 m , n be the set of all m × n real matrices. For A , B 𝐌 m , n , we say that A is row Hadamard majorized by B (denoted by A R H B ) if there exists an m × n row stochastic matrix R such that A = R B , where X Y is the Hadamard product (entrywise product) of matrices X , Y 𝐌 m , n . In this paper, we consider the concept of row Hadamard majorization as a relation on 𝐌 m , n and characterize the structure of all linear operators T : 𝐌 m , n 𝐌 m , n preserving...

Linear preservers of rc-majorization on matrices

Mohammad Soleymani (2024)

Czechoslovak Mathematical Journal

Similarity:

Let A , B be n × m matrices. The concept of matrix majorization means the j th column of A is majorized by the j th column of B and this is done for all j by a doubly stochastic matrix D . We define rc-majorization that extended matrix majorization to columns and rows of matrices. Also, the linear preservers of rc-majorization will be characterized.

𝒞 k -regularity for the ¯ -equation with a support condition

Shaban Khidr, Osama Abdelkader (2017)

Czechoslovak Mathematical Journal

Similarity:

Let D be a 𝒞 d q -convex intersection, d 2 , 0 q n - 1 , in a complex manifold X of complex dimension n , n 2 , and let E be a holomorphic vector bundle of rank N over X . In this paper, 𝒞 k -estimates, k = 2 , 3 , , , for solutions to the ¯ -equation with small loss of smoothness are obtained for E -valued ( 0 , s ) -forms on D when n - q s n . In addition, we solve the ¯ -equation with a support condition in 𝒞 k -spaces. More precisely, we prove that for a ¯ -closed form f in 𝒞 0 , q k ( X D , E ) , 1 q n - 2 , n 3 , with compact support and for ε with 0 < ε < 1 there...