Related papers: Tensor Permutation Matrices in Finite Dimensions
The term fractal describes a class of complex structures exhibiting self-similarity across different scales. Fractal patterns can be created by using various techniques such as finite subdivision rules and iterated function systems. In this…
The proposed article aims at offering a comprehensive tutorial for the computational aspects of structured matrix and tensor factorization. Unlike existing tutorials that mainly focus on {\it algorithmic procedures} for a small set of…
This paper presents a method to analyze the powers of a given trilinear form (a special kind of algebraic constructions also called a tensor) and obtain upper bounds on the asymptotic complexity of matrix multiplication. Compared with…
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,…
Matrices are very popular and widely used in mathematics and other fields of science. Every mathematician has known the properties of finite-sized matrices since the time of study. In this paper, we consider the basic theory of infnite…
Toeplitz matrices are characterized by their constant diagonals, have been extensively studied in various settings, including over real and complex numbers. However, their study over quaternions is quite sparse. In this paper, we…
We study the problem when every matrix over a division ring is representable as either the product of traceless matrices or the product of semi-traceless matrices, and also give some applications of such decompositions. Specifically, we…
This paper establishes that every positive-definite matrix can be written as a positive linear combination of outer products of integer-valued vectors whose entries are bounded by the geometric mean of the condition number and the dimension…
Using the frame formalism we determine some possible metrics and metric-compatible connections on the noncommutative differential geometry of the real quantum plane. By definition a metric maps the tensor product of two 1-forms into a…
A permutative matrix is a square matrix such that every row is a permutation of the first row. A constructive version of a result attributed to Suleimanova is given via permutative matrices. In addition, we strengthen a well-known result by…
Let G be a finite group. Given a finite G-set X and a modular tensor category C, we construct a weak G-equivariant fusion category, called the permutation equivariant tensor category. The construction is geometric and uses the formalism of…
We describe some configurations of conjugate permutations which may be used as a mathematical model of some genetical processes and crystal growth.
To any complex Hadamard matrix we associate a quantum permutation group. The correspondence is not one-to-one, but the quantum group encapsulates a number of subtle properties of the matrix. We investigate various aspects of the…
In a quaternion order of class number one, an element can be factored in multiple ways depending on the order of the factorization of its reduced norm. The fact that multiplication is not commutative causes an element to induce a…
Many critical EDA problems suffer from the curse of dimensionality, i.e. the very fast-scaling computational burden produced by large number of parameters and/or unknown variables. This phenomenon may be caused by multiple spatial or…
For any finite group G with a finite G-set X and a modular tensor category C we construct a part of the algebraic structure of an associated G-equivariant monoidal category: For any group element g in G we exhibit the module category…
We introduce a general framework to deterministically construct binary measurement matrices for compressed sensing. The proposed matrices are composed of (circulant) permutation submatrix blocks and zero submatrix blocks, thus making their…
A simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results include a straightforward relationship between the ordinary…
We interpret tensors on a smooth manifold M as differential forms over a graded commutative algebra called the algebra of iterated differential forms over M. This allows us to put standard tensor calculus in a new differentially closed…
It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…