Related papers: Decompositions of linear spaces induced by $n$-lin…
This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…
Denote by $\lambda K_v$ the complete graph of order $v$ with multiplicity $\lambda$. Let $\lambda K_v-\lambda K_w-\lambda K_u$ be the graph obtained from $\lambda K_v$ by the removal of the edges of two vertex disjoint complete…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
In this paper we introduce a new kind of topological space, called 'structured space', which locally resembles various kinds of algebraic structures. This can be useful, for instance, to locally study a space that cannot be globally endowed…
Given a family F of subsets of a ground set V, its orthogonal is defined to be the family of subsets that do not overlap any element of F. Using this tool we revisit the problem of designing a simple linear time algorithm for undirected…
A basic problem in machine learning is to find a mapping $f$ from a low dimensional latent space $\mathcal{Y}$ to a high dimensional observation space $\mathcal{X}$. Modern tools such as deep neural networks are capable to represent general…
This book is a continuation of the book n-linear algebra of type I and its applications. Most of the properties that could not be derived or defined for n-linear algebra of type I is made possible in this new structure: n-linear algebra of…
We characterize the diagonalizable subalgebras of End(V), the full ring of linear operators on a vector space V over a field, in a manner that directly generalizes the classical theory of diagonalizable algebras of operators on a…
We describe two constructions of (very) dense graphs which are edge disjoint unions of large {\em induced} matchings. The first construction exhibits graphs on $N$ vertices with ${N \choose 2}-o(N^2)$ edges, which can be decomposed into…
Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…
We introduce the notion of decomposition space as a general framework for incidence algebras and M\"obius inversion: it is a simplicial infinity-groupoid satisfying an exactness condition weaker than the Segal condition, which expresses…
For any field $K$ and for a completely arbitrary graph $E$, we characterize the Leavitt path algebras $L_K(E)$ that are indecomposable (as a direct sum of two-sided ideals) in terms of the underlying graph. When the algebra decomposes, it…
It is known that the volume functional $\,\phi\mapsto\int e^{-\phi}\,$ satisfies certain concavity or convexity inequalities with respect to three of the four linear structures induced by the order isomorphisms acting on…
If $E=\{e_i\}$ and $F=\{f_i\}$ are two 1-unconditional basic sequences in $L_1$ with $E$ $r$-concave and $F$ $p$-convex, for some $1\le r<p\le 2$, then the space of matrices $\{a_{i,j}\}$ with norm $\|\{a_{i,j}\}\|_{E(F)}=\big\|\sum_k…
Let $A$ be an associative algebra over an algebraically closed field $K$ of characteristic 0. A decomposition $A=A_1\oplus\cdots \oplus A_r$ of $A$ into a direct sum of $r$ vector subspaces is called a \textsl{regular decomposition} if, for…
We prove that for every finitely generated subgroup of a virtually connected Lie group which admits a finite dimensional model for the classifying space for proper actions the assembly map in algebraic K-theory is split injective. We also…
Let $G$ be a finite group and $N$ be a normal subgroup of $G$. Let $J=J(F[N])$ denote the Jacboson radical of $F[N]$ and $I={\rm Ann}(J)=\{\alpha \in F[G]|J\alpha =0\}$. We have another algebra $F[G]/I$. We study the decomposition of Cartan…
Decomposition techniques for linear programming are difficult to extend to conic optimization problems with general non-polyhedral convex cones because the conic inequalities introduce an additional nonlinear coupling between the variables.…
If a function $f:\mathbb{R}\to\mathbb{R}$ can be represented as the sum of $n$ periodic functions as $f=f_1+\dots+f_n$ with $f(x+\alpha_j)=f(x)$ ($j=1,\dots,n$), then it also satisfies a corresponding $n$-order difference equation…
We present certain existence criteria and parameterisations for an interpolation problem for completely positive maps that take given matrices from a finite set into prescribed matrices. Our approach uses density matrices associated to…