Related papers: Linear Algebra in the vector space of intervals
In this paper, we introduce novel characterizations of the classical concept of majorization in terms of upper triangular (resp., lower triangular) row-stochastic matrices, and in terms of sequences of linear transforms on vectors. We used…
This paper provides an introduction to trace diagrams at a level suitable for advanced undergraduates. Trace diagrams are a non-traditional notation for linear algebra. Vectors are represented by edges in a diagram, and matrices by markings…
We develop the theory of frames and Parseval frames for finite-dimensional vector spaces over the binary numbers. This includes characterizations which are similar to frames and Parseval frames for real or complex Hilbert spaces, and the…
We describe a notion of categorical model for unitless fragments of (multiplicative) linear logic. The basic definition uses promonoidal categories, and we also give an equivalent elementary axiomatisation.
This work revisits operator learning from a spectral perspective by introducing Polar Linear Algebra, a structured framework based on polar geometry that combines a linear radial component with a periodic angular component. Starting from…
We study simple Lie algebras generated by extremal elements, over arbitrary fields of arbitrary characteristic. We show: (1) If the extremal geometry contains lines, then the Lie algebra admits a $5 \times 5$-grading that can be…
We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on toric varieties and basic linear algebra; eigenvalues, eigenvectors and coefficient matrices. We adapt Eigenvalue theorem and Eigenvector…
The article presents an algebra to represent two dimensional patterns using reciprocals of polynomials. Such a representation will be useful in neural network training and it provides a method of training patterns that is much more…
Parametric linear systems are linear systems of equations in which some symbolic parameters, that is, symbols that are not considered to be candidates for elimination or solution in the course of analyzing the problem, appear in the…
A method of classification of integrable equations on quad-graphs is discussed based on algebraic ideas. We assign a Lie ring to the equation and study the function describing the dimensions of linear spaces spanned by multiple commutators…
To study orthogonal arrays and signed orthogonal arrays, Ray-Chaudhuri and Singhi (1988 and 1994) considered some module spaces. Here, using a linear algebraic approach we define an inclusion matrix and find its rank. In the special case of…
We formulate a refined theory of linear systems, using the methods of a previous paper, "A Theory of Branches for Algebraic Curves", and use it to give a geometric interpretation of the genus of an algebraic curve. Using principles of…
The notion of inner linear Hopf algebra is a generalization of the notion of discrete linear group. In this paper, we prove two general results that enable us to enlarge the class of Hopf algebras that are known to be inner linear: the…
Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…
We give an $O(n)$ time and space algorithm for constructing a diagonal matrix congruent to A+xI, where A is the adjacency matrix of a cograph and $x\in \mathbb{R}$. Applications include determining the number of eigenvalues of a cograph's…
Interested in formalizing the generation of fast running code for linear algebra applications, the authors show how an index-free, calculational approach to matrix algebra can be developed by regarding matrices as morphisms of a category…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
We consider two classes of computations which admit taking linear combinations of execution runs: probabilistic sampling and generalized animation. We argue that the task of program learning should be more tractable for these architectures…
We study the space of linear difference equations with periodic coefficients and (anti)periodic solutions. We show that this space is isomorphic to the space of tame frieze patterns and closely related to the moduli space of configurations…