Related papers: Decompositions of linear operators on pre-euclidea…

Let $\mathbb V$ be an arbitrary linear space and $f:\mathbb V \times \ldots \times \mathbb V \to \mathbb V$ an $n$-linear map. It is proved that, for each choice of a basis ${\mathcal B}$ of $\mathbb V$, the $n$-linear map $f$ induces a…

We consider the decomposition of bounded linear operators on Hilbert spaces in terms of functions forming frames. Similar to the singular-value decomposition, the resulting frame decompositions encode information on the structure and…

Let $A$ be a, not necessarily closed, linear relation in a Hilbert space $\sH$ with a multivalued part $\mul A$. An operator $B$ in $\sH$ with $\ran B\perp\mul A^{**}$ is said to be an operator part of $A$ when $A=B \hplus (\{0\}\times \mul…

For linear operators which factor with suitable assumptions concerning commutativity of the factors, we introduce several notions of a decomposition. When any of these hold then questions of null space and range are subordinated to the same…

In this paper, we study the ideas of composition and decomposition in the context of vector spaces, graphs and matroids. For vector spaces $\V_{AB},$ treated as collection of row vectors, with specified column set $A\uplus B,$ we define…

Let $\mathbb{F}_q$ be a finite field with $q$ elements, $n\geq2$ a positive integer, $\mathbb{V}_0$ a $n$-dimensional vector space over $\mathbb{F}_q$ and $\mathbb{T}_0$ the set of all linear functionals from $\mathbb{V}_0$ to…

Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in $d$-space into constant-complexity subcells. In this paper, we settle in the affirmative a few long-standing open…

We study the Laplacian on family preserving metric graphs. These are graphs that have a certain symmetry that, as we show, allows for a decomposition into a direct sum of one-dimensional operators whose properties are explicitly related to…

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…

We prove the decomposition of arbitrary diagonal operators into tensor and matrix products of smaller matrices, focusing on the analytic structure of the resulting formulas and their inherent symmetries. Diagrammatic representations are…

The main result of the present theoretical paper is an original decomposition formula for the proximal operator of the sum of two proper, lower semicontinuous and convex functions $f$ and $g$. For this purpose, we introduce a new operator,…

We study the structure of certain modules $V$ over linear spaces $W$ with restrictions neither on the dimensions nor on the base field $\mathbb F$. A basis $\mathfrak B = \{v_i\}_{i\in I}$ of $V$ is called multiplicative respect to the…

Let us denote ${\cal V}$, the finite dimensional vector spaces of functions of the form $\psi(x) = p_n(x) + f(x) p_m(x)$ where $p_n(x)$ and $p_m(x)$ are arbitrary polynomials of degree at most $n$ and $m$ in the variable $x$ while $f(x)$…

Fundamental to many applications in data analysis are the decompositions of a graph, i.e. partitions of the node set into component-inducing subsets. One way of encoding decompositions is by multicuts, the subsets of those edges that…

In the computation of the normal form of a colored network vector field, following the semigroup(oid) approach in [19], one would like to be able to say something about the structure of the Lie algebra of linear colored network vector…

Let $V$ be a vector space over a field $F$, $V^*$ its dual space and $L(V)$ the algebra of all linear operators on $V$. For an operator $a\in L(V)$ let $a*$ be its adjoint acting on $V*$, and for a subset $R$ of $L(V)$ let $R"$ be its…

Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in ${{\mathbb R}}^d$ into constant-complexity subcells. In this paper, we settle in the affirmative a few…

We propose a functional view of matrix decomposition problems on graphs such as geometric matrix completion and graph regularized dimensionality reduction. Our unifying framework is based on the key idea that using a reduced basis to…

In this paper we discuss the problem of decomposition for unbounded $2\times 2$ operator matrices by a pair of complementary invariant graph subspaces. Under mild additional assumptions, we show that such a pair of subspaces decomposes the…

Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension. We consider an ordered pair of linear transformations $A:V\to V$ and $A^*:V\to V$ that satisfy conditions (i), (ii) below. (i) There exists a…