For a (row) diagonally dominant matrix, if all of its off-diagonal entries and its diagonally dominant parts (which are defined for each row as the absolute value of the diagonal entry subtracted by the sum of the absolute values of off-diagonal entries in that row) are accurately known, we develop an algorithm that computes all the singular values, including zero ones if any, with relative err...

Motivated both by the work of Anstee, Griggs, and Sali on forbidden submatrices and also by the extremal sat-function for graphs, we introduce sat-type problems for matrices. Let F be a family of k-row matrices. A matrix M is called F-admissible if M contains no submatrix F ∈ F (as a row and column permutation of F ). A matrix M without repeated columns is F-saturated if M is F-admissible but t...

Results are proven on an inequality in max algebra and applied to theorems on the diagonal similarity scaling of matrices. Thus the set of all solutions to several scaling problems is obtained. Also introduced is the “full term rank” scaling of a matrix to a matrix with prescribed row and column maxima with the additional requirement that all the maxima are attained at entries each from a diffe...

permutation which maps 1; : : :; n into that order in which these nodes occur in a breadth rst traversal of t 0. If i is encountered before j, there can be no edge from j into i unless i is the root since all indegrees are one. Therefore, since the edge into k is ignored by the corresponding matrix in the left side of (6) { the k th row and column are there deleted { permuting rows and columns ...

We present results regarding row and column spaces of matrices whose entries are elements of residuated lattices. In particular, we define the notions of a row and column space for matrices over residuated lattices, provide connections to concept lattices and other structures associated to such matrices, and show several properties of the row and column spaces, including properties that relate ...

The kappa SQ software package is designed to assist researchers working on randomized row sampling. The package contains a collection of Matlab functions along with a GUI that ties them all together and provides a platform for the user to perform experiments. In particular, kappa SQ is designed to do experiments related to the two-norm condition number of a sampled matrix, κ(SQ), where S is a r...

In a constraint satisfaction problem (CSP), symmetry involves the variables, values in the domains, or both, and maps each search state into an equivalent one. When searching for solutions, symmetrically equivalent (partial) assignments can dramatically increase the search space. Hence, elimination of symmetry is essential to avoid exploring equivalent branches in a search tree. An important cl...

Algebraic structure of codes over Fq , closed under arbitrary abelian group G of permutations with exponent relatively prime to q, called G-invariant codes, is investigated using a transform domain approach. In particular, this general approach unveils algebraic structure of quasicyclic codes, abelian codes, cyclic codes, and quasi-abelian codes with restriction on G to appropriate special case...

the cyclic products of matrices and diagonal similarity. In this paper we consider diagonal similarity for matrices, which may be infinite, and whose elements lie in a (possible non-commutative) group G with O. Let H be a subgroup of a group G and let A be an irreducible square matrix with entries in GO. In Theorem 3.4, we give necessary and sufficient conditions for the existence of a matrix B...