相关论文: Lonesum decomposable matrices

The M-matrix is an important concept in matrix theory, and has many applications. Recently, this concept has been extended to higher order tensors [18]. In this paper, we establish some important properties of M-tensors and nonsingular…

This short note, in part of expository nature, points out several new or recent consequences of a quite nice decomposition for positive semi-definite matrices.

Let K, K' be convex cones residing in finite-dimensional real vector spaces E, E'. An element in the tensor product E \otimes E' is K \otimes K'-separable if it can be represented as finite sum \sum_l x_l \otimes x'_l with x_l \in K and…

We define the row product of K matrices of size d by n as a matrix of size d^K by n, whose row are entry-wise products of rows of these matrices. This construction arises in certain computer science problems. We study the question, to which…

We study the time complexity of computing the $(\min,+)$ matrix product of two $n\times n$ integer matrices in terms of $n$ and the number of monotone subsequences the rows of the first matrix and the columns of the second matrix can be…

In this paper, we present an algorithm of simple exponential growth called COPOMATRIX for determining the copositivity of a real symmetric matrix. The core of this algorithm is a decomposition theorem, which is used to deal with simplicial…

There are various definitions of right and left polar decompositions of an $m\times n$ matrix $F \in \mathbb{K}^{m\times n}$ (where $\mathbb{K}=\mathbb{C}$ or $\mathbb{R}$) with respect to bilinear or sesquilinear products defined by…

A list decoding algorithm for matrix-product codes is provided when $C_1,..., C_s$ are nested linear codes and $A$ is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as output when the…

Finite dimensional linear spaces (both complex and real) with indefinite scalar product [.,.] are considered. Upper and lower bounds are given for the size of an indecomposable matrix that is normal with respect to this scalar product in…

We study the Gram matrix determinants for the groups $S_n,O_n,B_n,H_n$, for their free versions $S_n^+,O_n^+,B_n^+,H_n^+$, and for the half-liberated versions $O_n^*,H_n^*$. We first collect all the known computations of such determinants,…

In this short note we prove a lemma about the dimension of certain algebraic sets of matrices. This result is needed in our paper arXiv:1201.1672. The result presented here has also applications in other situations and so it should appear…

We provide examples of groups which are indecomposable by direct product, and more generally which are uniquely decomposable in direct products of indecomposable groups. Examples include Coxeter groups, for which we give an alternative…

Let K be a subfield of the complex numbers, and let D be the Weyl algebra of K-linear differential operators on K[x_1,...,x_n]. If M and N are holonomic left D-modules we present an algorithm that computes explicit generators for the finite…

Let K be a field and let M_n(K) denote the space of n x n matrices with entries in K. Let M be a subspace of M_n(K) of dimension d with the property that there are elements in M with non-zero determinant. Given a basis of M, we define the…

Let $m,n>1$ be integers and $\mathbb{P}_{n,m}$ be the point set of the projective $(n-1)$-space (defined by [2]) over the ring $\mathbb{Z}_m$of integers modulo $m$. Let $A_{n,m}=(a_{uv})$ be the matrix with rows and columns being labeled by…

A cycle system of order $n$ is a decomposition of the edges of the complete graph $K_n$ into cycles of a fixed length. A cycle system is said to be $k$-colourable if we can assign $k$ colours to its vertices so that no cycle is…

For certain negative rational numbers k, called singular values, and associated with the symmetric group S_N on N objects, there exist homogeneous polynomials annihilated by each Dunkl operator when the parameter equals k. It was shown by…

A distributive lattice $L$ with minimum element $0$ is called decomposable lattice if $a$ and $b$ are not comparable elements in $L$ there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b),…

We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…

Let $A$ be a finite-dimensional algebra over an algebraically closed field $\Bbbk$. For any finite-dimensional $A$-module $M$ we give a general formula that computes the indecomposable decomposition of $M$ without decomposing it, for which…