Related papers: Tensor Permutation Matrices in Finite Dimensions

Tensor contraction (TC) is an important computational kernel widely used in numerous applications. It is a multi-dimensional generalization of matrix multiplication (GEMM). While Strassen's algorithm for GEMM is well studied in theory and…

A matrix (and any associated linear system) will be referred to as structured if it has a small displacement rank. It is known that the inverse of a structured matrix is structured, which allows fast inversion (or solution), and reduced…

We consider the notion of the matrix (tensor) distribution of a measurable function of several variables. On the one hand, it is an invariant of this function with respect to a certain group of transformations of variables; on the other…

We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first charac- terize some functions having linear translators, based on which several families of…

This paper is concentrated on the classification of permutation matrix with the permutation similarity relation, mainly about the canonical form of a permutational similar equivalence class, the cycle matrix decomposition of a permutation…

We present identities for permutations with fixed points. The formulas are based on successive derivations or integrations of the determinant of a particular matrix.

Tensor distributions and their derivatives are described without assuming the presence of a metric. This provides a natural framework for discussing tensor distributions on manifolds with degenerate metrics, including in particular metrics…

Tensor decompositions have become essential tools for feature extraction and compression of multiway data. Recent advances in tensor operators have enabled desirable properties of standard matrix algebra to be retained for multilinear…

An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…

A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…

Tensor networks are a compressed format for multi-dimensional data. One-dimensional tensor networks -- often referred to as tensor trains (TT) or matrix product states (MPS) -- are increasingly being used as a numerical ansatz for continuum…

Conjugate partial-symmetric (CPS) tensor is a generalization of Hermitian matrices. For the CPS tensor decomposition some properties are presented. For real CPS tensors in particular, we note the subtle difference from the complex case of…

A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…

A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…

Higher order tensor inversion is possible for even order. We have shown that a tensor group endowed with the Einstein (contracted) product is isomorphic to the general linear group of degree $n$. With the isomorphic group structures, we…

We propose a novel matrix regularization for tensor fields. In this regularization, tensor fields are described as rectangular matrices and both area-preserving diffeomorphisms and local rotations of the orthonormal frame are realized as…

We show that the matrix (or more generally tensor) product states in a finite translation invariant system can be accurately constructed from the same set of local matrices (or tensors) that are determined from an infinite lattice system in…

We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…

We use a Riemannian (or pseudo-Riemannian) geometric framework to formulate the theory of the classical r-matrix for integrable systems. In this picture the r-matrix is related to a fourth rank tensor, named the r-tensor, on the…

Modular tensor categories are generalizations of the representation categories of quantum groups at roots of unity axiomatizing the properties necessary to produce 3-dimensional TQFTs. Although other constructions have since been found,…