Related papers: Rational Orthogonal versus Real Orthogonal
We prove that any polyhedron of genus zero or genus one built out of rectangular faces must be an orthogonal polyhedron, but that there are nonorthogonal polyhedra of genus seven all of whose faces are rectangles. This leads to a resolution…
The algorithm for finding the optimal consistent approximation of an inconsistent pairwise comparisons matrix is based on a logarithmic transformation of a pairwise comparisons matrix into a vector space with the Euclidean metric.…
We show that a formal power series in $2N$ non-commuting indeterminates is a positive non-commutative kernel if and only if the kernel on $N$-tuples of matrices of any size obtained from this series by matrix substitution is positive. We…
Yang-Baxter R operators symmetric with respect to the orthogonal and symplectic algebras are considered in an uniform way. Explicit forms for the spinorial and metaplectic R operators are obtained. L operators, obeying the RLL relation with…
Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues…
Random matrix theory is a well-developed area of probability theory that has numerous connections with other areas of mathematics and its applications. Much of the literature in this area is concerned with matrices that possess many exact…
The condition number of a diagonally scaled matrix, for appropriately chosen scaling matrices, is often less than that of the original. Equilibration scales a matrix so that the scaled matrix's row and column norms are equal. Scaling can be…
Orthogonal sets of idempotents are used to design sets of unitary matrices, known as constellations, such that the modulus of the determinant of the difference of any two distinct elements is greater than $0$. It is shown that unitary…
In many mathematical models for pattern formation, a regular hexagonal pattern is stable in an infinite region. However, laboratory and numerical experiments are carried out in finite domains, and this imposes certain constraints on the…
Working over an algebraically closed base field $k$ of characteristic 2, the ring of invariants $R^G$ is studied, where $G$ is the orthogonal group O(n) or the special orthogonal group SO(n), acting naturally on the coordinate ring $R$ of…
We study a class of square matrices with non-negative elements which have cyclically monotone rows in the sense that each row of a matrix from the class consists of a cyclically non-increasing sequence of numbers starting from a maximal…
Using elementary linear algebra, we develop a technique that leads to solutions of two widely known problems on nonnegative matrices. First, we give a short proof of the result by Vavasis stating that the nonnegative rank of a matrix is…
For integer $n>0$, let $f(n)$ be the number of rows of the largest all-0 or all-1 square submatrix of $M$, minimized over all $n\times n$ $0/1$-matrices $M$. Thus $f(n)= O(\log n)$. But let us fix a matrix $H$, and define $f_H(n)$ to be the…
A sign pattern is an array with entries in $\{+,-,0\}$. A matrix $Q$ is row orthogonal if $QQ^T = I$. The Strong Inner Product Property (SIPP), introduced in [B.A.~Curtis and B.L.~Shader, Sign patterns of orthogonal matrices and the strong…
The paper is devoted to representation theoretic and algebraic geometric aspects of the theory of orthogonal decompositions of Lie algebra sl(n) into Cartan subalgebras orthogonal with respect to Killing form and the relevant theory of…
A perfect cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. The existence of such cuboids is neither proved, nor disproved. A rational perfect cuboid is a natural…
We use representation theory to construct spaces of matrices of constant rank. These spaces are parametrized by the natural representation of the general linear group or the symplectic group. We present variants of this idea, with more…
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…
The least square solution of minimum norm of a rectangular linear system of equations can be found out iteratively by using matrix splittings. However, the convergence of such an iteration scheme arising out of a matrix splitting is…
Let $r \leqslant n$ be nonnegative integers, and let $N = \binom{n}{r} - 1$. For a matroid $M$ of rank $r$ on the finite set $E = [n]$ and a partial field $k$ in the sense of Semple--Whittle, it is known that the following are equivalent:…