Related papers: Matrix Representations for Symmetric and Antisymme…
By viewing non-commutative polynomials, that is, elements in free associative algebras, in terms of linear representations, we generalize Horner's rule to the non-commutative (multivariate) setting. We introduce the concept of Horner…
The connection between symmetries and linearizations of discrete-time dynamical systems is being inverstigated. It is shown, that existence of semigroup structures related to the vector field and having linear representations enables…
We give a canonical form of matrices of a cycle of linear or semilinear mapping V_1 --- V_2 --- ... --- V_t --- V_1 in which all V_i are complex vector spaces, each line is an arrow ---> or <---, and each arrow denotes a linear or…
Some inequalities for positive linear maps on matrix algebras are given, especially asymmetric extensions of Kadison's inequality and several operator versions of Chebyshev's inequality. We also discuss well-known results around the matrix…
We propose to take a look at a new approach to the study of integral polyhedra. The main idea is to give an integral representation, or matrix model representation, for the key combinatorial characteristics of integral polytopes. Based on…
A matrix-compression algorithm is derived from a novel isogenic block decomposition for square matrices. The resulting compression and inflation operations possess strong functorial and spectral-permanence properties. The basic observation…
In the previous article we introduced the new concept of mixed representations of quivers and described the generators of their algebras of invariants. In this article we describe the defining relations of these algebras. Some applications…
Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinitely representable sets. Both kinds of sets are of practical use in polynomial optimization, since they occur as feasible sets in…
We consider certain scalar product of symmetric functions which is parameterized by a function $r$ and an integer $n$. One the one hand we have a fermionic representation of this scalar product. On the other hand we get a representation of…
The equivalence of multidimensional systems is closely related to the reduction of multivariate polynomial matrices, with the Smith normal form of matrices playing a key role. So far, the problem of reducing multivariate polynomial matrices…
Random matrices now play a role in many parts of computational mathematics. To advance these applications, it is desirable to have tools that are flexible, easy to use, and powerful. Over the last 25 years, researchers have developed a…
In this paper we introduce and investigate a one-parameter family of polynomials. They are semisymmetric, i.e. symmetric in the variables with odd and even index separately. In fact, the family forms a basis of the space of semisymmetric…
The number of non-negative integer matrices with given row and column sums appears in a variety of problems in mathematics and statistics but no closed-form expression for it is known, so we rely on approximations of various kinds. Here we…
We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, has recently received new attention from the…
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
We present the algebraic representation and basic algorithms for MultiAspect Graphs (MAGs). A MAG is a structure capable of representing multilayer and time-varying networks, as well as higher-order networks, while also having the property…
The representation of graphs is commonly based on the adjacency matrix concept. This formulation is the foundation of most algebraic and computational approaches to graph processing. The advent of deep learning language models offers a wide…
In this paper, we present and analyze methods for solving a system of linear equations over idempotent semifields. The first method is based on the pseudo-inverse of the system matrix. We then present a specific version of Cramer's rule…
The use of complex networks as a modern approach to understanding the world and its dynamics is well-established in literature. The adjacency matrix, which provides a one-to-one representation of a complex network, can also yield several…
We introduce the concept of reflexive moment functional in two variables and the definition of reflexive orthogonal polynomial system. Also reverse matrices and their interesting algebraic properties are studied. Reverse matrices and…