Related papers: Matrix multiplication is determined by orthogonali…
We study multiplicative nested sums, which are generalizations of harmonic sums, and provide a calculation through multiplication of index matrices. Special cases interpret the index matrices as stochastic transition matrices of random…
A univariate trace polynomial is a polynomial in a variable x and formal trace symbols Tr(x^j). Such an expression can be naturally evaluated on matrices, where the trace symbols are evaluated as normalized traces. This paper addresses…
A catalogue of all non-isomorphic simple connected regular matroids ${\cal M}$ of cardinality $n \leq 15$ is provided on the net. These matroids are given as binary matrix matroids and are sieved from the large pool of all non-isomorphic…
We give a canonical form of m-by-2-by-2 spatial matrices for equivalence over any field.
We generalize Baker-Bowler's theory of matroids over tracts to orthogonal matroids, define orthogonal matroids with coefficients in tracts in terms of Wick functions, orthogonal signatures, circuit sets, and orthogonal vector sets, and…
Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic…
We adapt (over $\mathbb{F}_2$) the general notions of multiplicative function, Dirichlet convolution and Inverse. We get some interesting results, namely necessary conditions for an odd binary polynomial to be perfect. Note that we are…
Main result: If a C*-algebra is simple, $\sigma$-unital, has finitely many extremal traces, and has strict comparison of positive elements by traces, then its multiplier also has strict comparison of positive elements by traces. The same…
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…
The dimensions of sets of matrices of various types, with specified eigenvalue multiplicities, are determined. The dimensions of the sets of matrices with given Jordan form and with given singular value multiplicities are also found. Each…
We give conditions for when the tensor product of two positive maps between matrix algebras is a positive map. This happens when one map belongs to a symmetric mapping cone and the other to the dual cone. Necessary and sufficient conditions…
Factorization of an $n\times n$ unitary matrix as a product of $n$ diagonal matrices containing only phases interlaced with $n-1$ orthogonal matrices each one generated by a real vector as well as an explicit form for the Weyl factorization…
Let L be a restricted Lie superalgebra with its restricted enveloping algebra u(L) over a field F of characteristic p>2. A polynomial identity is called non-matrix if it is not satisfied by the algebra of 2\times 2 matrices over F. We…
We study partially and totally associative ternary algebras of first and second kind. Assuming the vector space underlying a ternary algebra to be a topological space and a triple product to be continuous mapping we consider the trivial…
Let $M_n$ denote the algebra of $n \times n$ complex matrices and let $\mathcal{A}\subseteq M_n$ be an arbitrary structural matrix algebra, i.e. a subalgebra of $M_n$ that contains all diagonal matrices. We consider injective maps $\phi :…
A few years ago, Peter Larcombe discovered an amazing property regarding two by two matrices. For any such 2 by 2 matrix A, the ratios of the two anti-diagonal entries is the same for all powers of A. We discuss extensions to higher…
Recently there has been several works estimating the number of $n\times n$ matrices with elements from some finite sets $\mathcal X$ of arithmetic interest and of a given determinant. Typically such results are compared with the trivial…
A nonstandard application of bivariate polynomial interpolation is discussed: the implicitization of a rational algebraic curve given by its parametric equations. Three different approaches using the same interpolation space are considered,…
To each associative unitary finite-dimensional algebra over a normal base, we associative a canonical multiplicative function called its determinant. We give various properties of this construction, as well as applications to the topology…
Matrix multiplication consumes a large fraction of the time taken in many machine-learning algorithms. Thus, accelerator chips that perform matrix multiplication faster than conventional processors or even GPU's are of increasing interest.…