Related papers: Structured strong linearizations of structured rat…

We present a new algorithm for solving an eigenvalue problem for a real symmetric matrix which is a rank-one modification of a diagonal matrix. The algorithm computes each eigenvalue and all components of the corresponding eigenvector with…

We find a remarkable family of $\mathrm{G}_2$ structures defined on certain principal $\mathrm{SO}(3)$-bundles $P_\pm\longrightarrow M$ associated with any given oriented Riemannian 4-manifold $M$. Such structures are always cocalibrated.…

Polynomial minimal bases of rational vector subspaces are a classical concept that plays an important role in control theory, linear systems theory, and coding theory. It is a common practice to arrange the vectors of any minimal basis as…

We prove rigidity results describing contextually-constrained maps defined on Grassmannians and manifolds of ordered independent line tuples in finite-dimensional vector or Hilbert spaces. One statement in the spirit of the Fundamental…

Many real world datasets subsume a linear or non-linear low-rank structure in a very low-dimensional space. Unfortunately, one often has very little or no information about the geometry of the space, resulting in a highly under-determined…

We show that the set of $n \times n$ complex symmetric matrix pencils of rank at most $r$ is the union of the closures of $\lfloor r/2\rfloor +1$ sets of matrix pencils with some, explicitly described, complete eigenstructures. As a…

We devise a method that reduces the problem of classifying systems of forms and linear mappings to the problem of classifying systems of linear mappings. Canonical matrices of (i) bilinear or sesquilinear forms, (ii) pairs of symmetric,…

We construct a convenient basis for all real semisimple Lie algebras by means of an adapted Chevalley basis of the complexification. It determines rational and in fact half-integer structure constants which we express only in terms of the…

The generic change of the Weierstrass Canonical Form of regular complex structured matrix pencils under generic structure-preserving additive low-rank perturbations is studied. Several different symmetry structures are considered and it is…

Zeros of rational transfer function matrices $R(\lambda)$ are the eigenvalues of associated polynomial system matrices $P(\lambda)$, under minimality conditions. In this paper we define a structured condition number for a simple eigenvalue…

The objective of this manuscript is to understand the structure of an invertible linear map on the space of real symmetric matrices $\mathcal{S}^n$ that leaves invariant the closed convex cones of copositive and completely positive matrices…

In the paper, we first study more general models, where $F$ has constant rank and is based on weak metric structures (introduced by the first author and R. Wolak), which generalize almost complex and almost contact metric $f$-contact…

In [Rank-Width and Well-Quasi-Ordering of Skew-Symmetric or Symmetric Matrices, arXiv:1007.3807v1] Oum proved that, for a fixed finite field $\mathbf{F}$, any infinite sequence $M_1,M_2,...$ of (skew) symmetric matrices over $\mathbf{F}$ of…

1-flat irreducible G-structures, equivalently, irreducible G-structures admitting torsion-free affine connections, have been studied extensively in differential geometry, especially in connection with the theory of affine holonomy groups.…

Analytical tools to $K$-theory; namely, self-stabilization of rapidly decreasing matrices, linearization of cyclic loops, and the contractibility of the pointed stable Toeplitz algebra are discussed in terms of concrete formulas. Adaptation…

We propose a new random sketching approach for embedding high-dimensional Hilbert-Schmidt operators, using random input-output pairs. Such operator can then be approximated in a low-dimensional subspace of operators by solving a small…

A discrete group which admits a faithful, finite dimensional, linear representation over a field $\mathbb F$ of characteristic zero is called linear. This note combines the natural structure of semi-direct products with work of A. Lubotzky…

A framework of monomial codes is considered, which includes linear codes generated by the evaluation of certain monomials. Polar and Reed-Muller codes are the two best-known representatives of such codes and can be considered as two extreme…

Let $A(x)=A\_0+x\_1A\_1+...+x\_nA\_n$ be a linear matrix, or pencil, generated by given symmetric matrices $A\_0,A\_1,...,A\_n$ of size $m$ with rational entries. The set of real vectors x such that the pencil is positive semidefinite is a…

Matrix-vector multiplication is one of the most fundamental computing primitives. Given a matrix $A\in\mathbb{F}^{N\times N}$ and a vector $b$, it is known that in the worst case $\Theta(N^2)$ operations over $\mathbb{F}$ are needed to…