Related papers: On decomposable and reducible integer matrices
We introduce the notion of Universally Decodable Matrices of Genus g (UDMG), which for g=0 reduces to the notion of Universally Decodable Matrices (UDM) introduced in [8]. A UDMG is a set of L matrices over a finite field, each with K rows,…
A hollow matrix is a square matrix whose diagonal entries are all equal to zero. Define $\lambda^* = \rho^{1/2} + \rho^{-1/2} \approx 2.01980$, where $\rho$ is the unique real root of $x^3 = x + 1$. We show that for every $\lambda <…
A real symmetric matrix (resp., tensor) is said to be copositive if the associated quadratic (resp., homogeneous) form is greater than or equal to zero over the nonnegative orthant. The problem of detecting their copositivity is NP-hard.…
For a given selection of rows and columns from a Fourier matrix, we give a number of tests for whether the resulting submatrix is Hadamard based on the primitive sets of those rows and columns. In particular, we demonstrate that whether a…
We define lower triangular tensors, and show that all diagonal entries of such a tensor are eigenvalues of that tensor. We then define lower triangular sub-symmetric tensors, and show that the number of independent entries of a lower…
All indecomposable unimodular hermitian lattices in dimensions 14 and 15 over the ring of integers in $\mathbb{Q}(\sqrt{-3})$ are determined. Precisely one lattice in dimension 14 and two lattices in dimension 15 have minimal norm 3.
Hermitian tensors are natural generalizations of Hermitian matrices, while possessing rather different properties. A Hermitian tensor is separable if it has a Hermitian decomposition with only positive coefficients, i.e., it is a sum of…
Some skew-symmetrizable integer exchange matrices are associated to ideal (tagged) triangulations of marked bordered surfaces. These exchange matrices admits unfoldings to skew-symmetric matrices. We develop an combinatorial algorithm that…
In order to find a suitable expression of an arbitrary square matrix over an arbitrary finite commutative ring, we prove that every such a matrix is always representable as a sum of a potent matrix and a nilpotent matrix of order at most…
Every m by n matrix A with rank r has exactly r independent rows and r independent columns. The fact has become the most fundamental theorem in linear algebra such that we may favor it in an unconscious way. The sole aim of this paper is to…
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…
When a matrix A with n columns is known to be well approximated by a linear combination of basis matrices B_1,..., B_p, we can apply A to a random vector and solve a linear system to recover this linear combination. The same technique can…
Monadic decomposability is a notion of variable independence, which asks whether a given formula in a first-order theory is expressible as a Boolean combination of monadic predicates in the theory. Recently, Veanes et al. showed the…
When a monomial ideal has linear quotients with respect to an admissible order of increasing support-degree, we provide two proofs of different flavors to show that it is componentwise support-linear. We also introduce the variable…
Quantum states that remain separable (i.e., not entangled) under any global unitary transformation are known as absolutely separable and form a convex set. Despite extensive efforts, the complete characterization of this set remains largely…
We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are (commutative unital) reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with…
We classify all the decomposition matrices of the generic Hecke algebras on 3 strands in characteristic 0. These are the generic Hecke algebras associated to the exceptional complex reflection groups $G_4$, $G_8$ and $G_{16}$. We prove that…
We obtain minimal dimension matrix representations for each indecomposable five-dimensional Lie algebra over $\R$ and justify in each case that they are minimal. In each case a matrix Lie group is given whose matrix Lie algebra provides the…
The (matricial) solution set of a Linear Matrix Inequality (LMI) is a convex basic non-commutative semi-algebraic set. The main theorem of this paper is a converse, a result which has implications for both semidefinite programming and…
The set of mxn singular matrix pencils with normal rank at most r is an algebraic set with r+1 irreducible components. These components are the closure of the orbits (under strict equivalence) of r+1 matrix pencils which are in Kronecker…