Related papers: Characterization of the matrix whose norm is deter…
We establish an identity for E f (Y) -E f (X), when X and Y both have matrix variateskew-normal distributions and the function f fulfills some weak conditions. Thecharacteristic function of matrix variate skew normal distribution is then…
Let $\|A\|_{p,q}$ be the norm induced on the matrix $A$ with $n$ rows and $m$ columns by the H\"older $\ell_p$ and $\ell_q$ norms on $R^n$ and $R^m$ (or $C^n$ and $C^m$), respectively. It is easy to find an upper bound for the ratio…
We consider $n\times n$ real-valued matrices $A = (a_{ij})$ satisfying $a_{ii} \geq a_{i,i+1} \geq \dots \geq a_{in} \geq a_{i1} \geq \dots \geq a_{i,i-1}$ for $i = 1,\dots,n$. With such a matrix $A$ we associate a directed graph $G(A)$. We…
This note considers linear recurrences (also called linear difference equations) in unknowns indexed by the integers. We characterize a unique \emph{reduced} linear recurrence with the same solutions as a given linear recurrence, and…
We determine approximations to the decomposition matrices for unipotent $\ell$-blocks of several series of finite reductive groups of classical and exceptional type over $\FF_q$ of low rank in non-defining good characteristic~$\ell$.
For a fixed arbitrary matrix depending on $n$ variables, one may ask whether a Prenex Normal Form (PNF) implies another. A RAM algorithm running in linear time is presented and shown to be asymptotically optimal.
We characterize orthonormal bases, Riesz bases and frames which arise from the action of a countable discrete group $\Gamma$ on a single element $\psi$ of a given Hilbert space $\mathcal{H}$. As $\Gamma$ might not be abelian, this is done…
In this short article, some properties of matrices of moving least-squares approximation have been proven.The used technique is based on singular-value decomposition and inequalities for singular-values. Some inequalities for the norm of…
Let $\mathbf{A}_{n,m;k}$ be a random $n \times m$ matrix with entries from some field $\mathbb{F}$ where there are exactly $k$ non-zero entries in each column, whose locations are chosen independently and uniformly at random from the set of…
We propose a novel linear discriminant analysis approach for the classification of high-dimensional matrix-valued data that commonly arises from imaging studies. Motivated by the equivalence of the conventional linear discriminant analysis…
We give sufficient conditions on a matrix A ensuring the existence of a partition of this matrix into two submatrices with extremely small norm of the image of any vector. Under some weak conditions on a matrix A we obtain a partition of A…
The basic sequence of a homogeneous ideal $I\sset R=k[\seq{x}{1}{r}]$ defining an Artinian graded ring $A=R/I$ not having the weak Lefschetz property has the property that the first term of the last part is less than the last term of the…
In this note, we consider matrices similar to $X$-form matrices, which are the matrices for which only the diagonal and the anti-diagonal elements can be different from zero. First, we give a characterization of these matrices using the…
We pose the approximation problem for scalar nonnegative input-output systems via impulse response convolutions of finite order, i.e. finite order moving averages, based on repeated observations of input/output signal pairs. The problem is…
We give necessary and sufficient conditions for a subfamily of regularly spaced translates of a function to form a frame (resp. a Riesz basis) for its span. One consequence is that ifthetranslates are taken only from a subset of the natural…
Let $A$ be a square complex matrix and $z$ a complex number. The distance, with respect to the spectral norm, from $A$ to the set of matrices which have $z$ as an eigenvalue is less than or equal to the distance from $z$ to the spectrum of…
Let $(x_n)$ be a sequence in a Banach space $X$ which does not converge in norm, and let $E$ be an isomorphically precisely norming set for $X$ such that \[ \sum_n |x^*(x_{n+1}-x_n)|< \infty, \; \forall x^* \in E. \qquad (*) \] Then there…
Necessary and sufficient conditions are given on matrices $A$, $B$ and $S$, having entries in some field $\mathbb F$ and suitable dimensions, such that the linear span of the terms $A^iSB^j$ over $\mathbb F$ is equal to the whole matrix…
Trace norm regularization is a widely used approach for learning low rank matrices. A standard optimization strategy is based on formulating the problem as one of low rank matrix factorization which, however, leads to a non-convex problem.…
Some subadditivity results involving symmetric (unitarily invariant) norms are obtained. For instance, if $g(t)=\sum_{k=0}^m a_kt^k$ is a polynomial of degree $m$ with non-negative coefficients, then, for all positive operators $A,\,B$ and…