Displaying similar documents to “ ( 0 , 1 ) -matrices, discrepancy and preservers”

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 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 .

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...

Sum-product theorems and incidence geometry

Mei-Chu Chang, Jozsef Solymosi (2007)

Journal of the European Mathematical Society

Similarity:

In this paper we prove the following theorems in incidence geometry. 1. There is δ > 0 such that for any P 1 , , P 4 , and Q 1 , , Q n 2 , if there are n ( 1 + δ ) / 2 many distinct lines between P i and Q j for all i , j , then P 1 , , P 4 are collinear. If the number of the distinct lines is < c n 1 / 2 then the cross ratio of the four points is algebraic. 2. Given c > 0 , there is δ > 0 such that for any P 1 , P 2 , P 3 2 noncollinear, and Q 1 , , Q n 2 , if there are c n 1 / 2 many distinct lines between P i and Q j for all i , j , then for any P 2 { P 1 , P 2 , P 3 } , we have δ n distinct lines between P and Q j . 3. Given...

𝒞 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...

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...

Selectors of discrete coarse spaces

Igor Protasov (2022)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Given a coarse space ( X , ) with the bornology of bounded subsets, we extend the coarse structure from X × X to the natural coarse structure on ( { } ) × ( { } ) and say that a macro-uniform mapping f : ( { } ) X (or f : [ X ] 2 X ) is a selector (or 2-selector) of ( X , ) if f ( A ) A for each A { } ( A [ X ] 2 , respectively). We prove that a discrete coarse space ( X , ) admits a selector if and only if ( X , ) admits a 2-selector if and only if there exists a linear order “ " on X such that the family of intervals { [ a , b ] : a , b X , a b } is a base for the bornology .