Related papers: Matrix Representations for Symmetric and Antisymme…

This paper compares skew-linear and multilinear matroid representations. These are matroids that are representable over division rings and (roughly speaking) invertible matrices, respectively. The main tool is the von Staudt construction,…

We prove that when assuming suitable non-degeneracy conditions equivariant harmonic maps into symmetric spaces of non-compact type depend in a real analytic fashion on the representation they are associated to. The main tool in the proof is…

A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…

Numerical data structures for positive dimensional solution sets of polynomial systems are sets of generic points cut out by random planes of complimentary dimension. We may represent the linear spaces defined by those planes either by…

We describe a map-based model which reproduces many of the behaviors seen in partial differential equations (PDE's). Like PDE's, we show that this model can support an infinite number of stationary solutions, traveling solutions, breathing…

For piecewise-linear maps the stable and unstable manifolds of hyperbolic periodic solutions are themselves piecewise-linear. Hence compact subsets of these manifolds can be represented using polytopes (i.e. polygons, in the case of…

We describe all linear operators which maps $n-1$-dimensional simplex of idempotent measures to itself. Such operators divided to two classes: the first class contains all $n\times n$-matrices with non-negative entries which has at least…

It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…

In this paper we study polynomial maps of vector spaces and their eigenvectors and eigenvalues. The new quantity called complanart is defined. Complanarts determine complanarity of solution vectors of systems of polynomial equations.…

In 2007, the first author gave an alternative proof of the refined alternating sign matrix theorem by introducing a linear equation system that determines the refined ASM numbers uniquely. Computer experiments suggest that the numbers…

We translate inequalities and conjectures for immanants and generalized matrix functions into inequalities in the L\"owner order. These have the form of trace polynomials and generalize the inequalities from [FH, J. Math. Phys. 62 (2021),…

For a representation of a Lie algebra, one can construct a diagram of the representation, i. e. a directed graph with edges labeled by matrix elements of the representation. This article explains how to use these diagrams to describe normal…

This is an introductory note concerning the distribution vectors in a unitary representation of a Lie group. We discuss the definition of matrix coefficients associated with a pair of distributions and how one can compute them. Most of the…

For arbitrary F-algebra, in which the operation of addition is defined, I explore biring of matrices of mappings. The sum of matrices is determined by the sum in F-algebra, and the product of matrices is determined by the product of…

We present a new distributed representation in deep neural nets wherein the information is represented in native form as a matrix. This differs from current neural architectures that rely on vector representations. We consider matrices as…

Some comments are made on the matrices which serve as the basis of a quaternionic algebra. We show that these matrices are related with the quaternionic action of the imaginary units from the left and from the right.

We study multivariate normal models that are described by linear constraints on the inverse of the covariance matrix. Maximum likelihood estimation for such models leads to the problem of maximizing the determinant function over a…

Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a…

We present a detailed study of the combinatorial interpretation of matrix integrals, including the examples of tessellations of arbitrary genera, and loop models on random surfaces. After reviewing their methods of solution, we apply these…

In a recent paper, a new method was proposed to find the common invariant subspaces of a set of matrices. This paper invstigates the more general problem of putting a set of matrices into block triangular or block-diagonal form…