Related papers: On semimonotone matrices of exact order two
The class of quasiseparable matrices is defined by the property that any submatrix entirely below or above the main diagonal has small rank, namely below a bound called the order of quasiseparability. These matrices arise naturally in…
We classify all cyclotomic matrices over real quadratic integer rings and we show that this classification is the same as classifying cyclotomic matrices over the compositum all real quadratic integer rings. Moreover, we enumerate a related…
We explore the asymptotic convergence and nonasymptotic maximal inequalities of supermartingales and backward submartingales in the space of positive semidefinite matrices. These are natural matrix analogs of scalar nonnegative…
When solving systems of banded Toeplitz equations or calculating their inverses, it is necessary to determine the invertibility of the matrices beforehand. In this paper, we equate the invertibility of an $n$-order banded Toeplitz matrix…
We give an almost-complete description of orthogonal matrices $M$ of order $n$ that "rotate a non-negligible fraction of the Boolean hypercube $C_n=\{-1,1\}^n$ onto itself," in the sense that $$P_{x\in C_n}(Mx\in C_n) \ge n^{-C},\mbox{ for…
Let $S$ be an additively idempotent semiring and $\mathbf{M}_n(S)$ be the semiring of all $n\times n$ matrices over $S$. We characterize the conditions of when the semiring $\mathbf{M}_n(S)$ is congruence-simple provided that the semiring…
A classical (or quantum) superintegrable system on an n-dimensional Riemannian manifold is an integrable Hamiltonian system with potential that admits 2n-1 functionally independent constants of the motion that are polynomial in the momenta,…
The set of idempotents of a regular semigroup is given an abstract characterization as a regular biordered set in [2], and in [4] it is shown how a biordered set can be associated with a complemented modular lattice. Von Neumann has shown…
In recent years several classes of structured matrices are extended to classes of tensors in the context of tensor complementarity problem. The tensor complementarity problem is a class of nonlinear complementarity problem where the…
The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions,…
We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value…
We obtain the first polynomial-time algorithm for exact tensor completion that improves over the bound implied by reduction to matrix completion. The algorithm recovers an unknown 3-tensor with $r$ incoherent, orthogonal components in…
In this article we compute the number of invertible $2\times 2$ matrices with integer entries modulo $n$ whose permanents are congruent modulo $n$ to a given integer $x$.
We define and study "semimatroids", a class of objects which abstracts the dependence properties of an affine hyperplane arrangement. We show that geometric semilattices are precisely the posets of flats of semimatroids. We define and…
We prove that, in both real and complex cases, there exists a pair of matrices that generates a dense subsemigroup of the set of $n\times n$ matrices.
Let $M_n(K)$ be the algebra of $n \times n$ matrix over an infinite integral domain $K$. Let $gl_n(K)$ be the Lie algebra of $n \times n$ matrix with the usual Lie product over $K$. Let $G = \{g_1,\ldots,g_n\}$ be a group of order $n$. We…
We establish necessary and sufficient conditions for invertibility of symmetric three-by-three block matrices having a double saddle-point structure \fb{that guarantee the unique solvability of double saddle-point systems}. We consider…
We study the structure of nilpotent subsemigroups in the semigroup $M(n,\mathbb{F})$ of all $n\times n$ matrices over a field, $\mathbb{F}$, with respect to the operation of the usual matrix multiplication. We describe the maximal…
A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…
In this paper, we introduce almost (strictly) semi-positive tensors, which extend the concept of almost (strictly) semimonotone matrices. Furthermore, we provide insights into the characteristics of the entries within these almost…