相关论文: Reducibility of Matrix Weights
The weighted low-rank approximation problem is a fundamental numerical linear algebra problem and has many applications in machine learning. Given a $n \times n$ weight matrix $W$ and a $n \times n$ matrix $A$, the goal is to find two…
We study the computational content of the Radon-Nokodym theorem from measure theory in the framework of the representation approach to computable analysis. We define computable measurable spaces and canonical representations of the measures…
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…
The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors needed to reconstruct it exactly. The problem of determining this rank and computing the corresponding nonnegative factors is difficult;…
We introduce an algorithm to decompose orthogonal matrix representations of the symmetric group over the reals into irreducible representations, which as a by-product also computes the multiplicities of the irreducible representations. The…
A subalgebra $\mathcal{A}$ of $\mathbb{M}_n(\mathbb{C})$ is said to be projection compressible if $P\mathcal{A}P$ is an algebra for all orthogonal projections $P\in\mathbb{M}_n(\mathbb{C})$. Likewise, $\mathcal{A}$ is said to be idempotent…
A unimodular $2\times 2$ matrix $A$ with entries in a commutative ring $R$ is called weakly determinant liftable if there exists a matrix $B$ congruent to $A$ modulo $R\det(A)$ and $\det(B)=0$; if we can choose $B$ to be unimodular, then…
A new optimization design is proposed for matrix completion by weighting the measurements and deriving the corresponding error bound. Accordingly, the Haplotype reconstruction using nuclear norm minimization with Weighted Constraint…
Many well-known theorems establish sufficient criteria for linearizability of a vector field in terms of the eigenvalues of its linear approximation. By attaching weights to coordinates so that some directions are considered "linear",…
In this paper, several versions of the Kolmogorov-Riesz compactness theorem in weighted Lebesgue spaces with matrix weights are obtained. In particular, when the matrix weight $W$ is in the known $A_p$ class, a characterization of totally…
The goal of this paper is to generalize the theory of triangularizing matrices to linear transformations of an arbitrary vector space, without placing any restrictions on the dimension of the space or on the base field. We define a…
Matrix properties are a type of property of categories which includes the ones of being Mal'tsev, arithmetical, majority, unital, strongly unital and subtractive. Recently, an algorithm has been developed to determine implications…
We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…
The structure of orthogonal polynomials on $\mathbb{R}^{2}$ with the weight function $| x_{1}^{2}-x_{2}^{2}|^{2k_{0}}| x_{1}x_{2}|^{2k_{1}}e^{-(x_{1}^{2}+x_{2}^{2})/2}$ is based on the Dunkl operators of type $B_{2}$. This refers to the…
We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and $q$-Weyl algebra, which are both viewed as a $\mathbb{Z}$-graded rings. We show, that factorization of homogeneous polynomials can be…
We study bounded weighted shifts on directed trees. We show that the set of multiplication operators associated with an injective weighted shift on a rooted directed tree coincides with the WOT/SOT closure of the set of polynomials of the…
This set of notes re-proves known results on weighted automata (over a field, also known as multiplicity automata). The text offers a unified view on theorems and proofs that have appeared in the literature over decades and were written in…
Let $\mathcal M$ be a separable factor. An operator $T$ in $\mathcal{M}$ is said to be irreducible in $\mathcal{M}$ if the von Neumann algebra $W^*(T)$ generated by $T$ is an irreducible subfactor of $\mathcal{M}$, i.e.,…
In this paper, we make a contribution to the computation of Gr\"obner bases. For polynomial reduction, instead of choosing the leading monomial of a polynomial as the monomial with respect to which the reduction process is carried out, we…
We provide a general description of realisations of W--algebras in terms of smaller W--algebras and free fields. This is based on the definition of the W--algebra as the commutant of a set of screening charges. This is conjectured to be…