Related papers: Adjacency preserving mappings on real symmetric ma…
Semipositive matrices (matrices that map at least one nonnegative vector to a positive vector) and minimally semipositive matrices (semipositive matrices whose no column-deleted submatrix is semipositive) are well studied in matrix theory.…
Let $\mathcal{S}_n$ be the set of all $n$-by-$n$ symmetric real matrices, and let $\mathcal{C}_n$ be the copositive cone, that is, the set of all matrices $a\in\mathcal{S}_n$ that fulfill the condition $u^\top a u\geqslant0$ for all…
We study the restriction to the symmetric group, $\mc{S}_n$ of the adjoint representation of $\mt{GL}_n(\C)$. We determine the irreducible constituents of the space of symmetric as well as the space of skew-symmetric $n\times n$ matrices as…
Accurate estimation of camera matrices is an important step in structure from motion algorithms. In this paper we introduce a novel rank constraint on collections of fundamental matrices in multi-view settings. We show that in general, with…
In this paper we expose our main results about rank problems concerning persymmetric matrices over F_2 associated to some exponential sums.
A function $f$ from $\mathbb{Z}$ to the symmetric matrices over an arbitrary field $K$ of characteristic $0$ is a $1$-quasihomomorphism if the matrix $f(x+y) - f(x) - f(y)$ has rank at most $1$ for all $x,y \in \mathbb{Z}$. We show that any…
Let \phi((x_1,...,x_n),(y_1,...,y_n))=(x_1-y_1)^2+...+(x_n-y_n)^2. We say that f:R^n -> C^n preserves distance d>=0 if for each x,y \in R^n \phi(x,y)=d^2 implies \phi(f(x),f(y))=d^2. We prove that if x,y \in R^n (n>=3) and…
The problem of finding the maximal dimension of linear or affine subspaces of matrices whose rank is constant, or bounded below, or bounded above, has attracted many mathematicians from the sixties to the present day. The problem has caught…
Let $\mathcal A:U\to V$ be a linear mapping between vector spaces $U$ and $V$ over a field or skew field $\mathbb F$ with symmetric, or skew-symmetric, or Hermitian forms $\mathcal B:U\times U\to\mathbb F$ and $\mathcal C:V\times…
We propose an algorithm that approximates a given matrix polynomial of degree $d$ by another skew-symmetric matrix polynomial of a specified rank and degree at most $d$. The algorithm is built on recent advances in the theory of generic…
Many classes of maps are characterized as (possibly multi-valued) maps preserving particular types of compact filters.
Isometries of metric spaces $(X,d)$ preserve all level sets of $d$. We formulate and prove cases of a conjecture asserting if $X$ is a complete Riemannian manifold, then a function $f:X \rightarrow X$ preserving at least one level set…
An element of the algebra $M_n(\mathbb{F})$ of $n \times n$ matrices over a field $\mathbb{F}$ is called an involution if its square equals the identity matrix. Gustafson, Halmos, and Radjavi proved that any product of involutions in…
Over the finite field with two elements, we present a method for obtaining explicit expressions for the number of rank i matrices of the form A above B, where A is persymmetric (A matrix [a(i,j)] is persymmetric if a(i,j) = a(r,s) for i+j =…
A partial matrix is a matrix where only some of the entries are given. We determine the maximum rank of the symmetric completions of a symmetric partial matrix where only the diagonal blocks are given and the minimum rank and the maximum…
Let $n\geq2$ be a natural number. Let $M_n(\mathbb{K})$ be the ring of all $n \times n$ matrices over a field $\mathbb{K}$. Fix natural number $k$ satisfying $1<k\leq n$. Under a mild technical assumption over $\mathbb{K}$ we will show that…
We consider equivalence relations among smooth map germs with respect to geometry of G-structures on the target space germ. These equivalence relations are natural generalization of right-left equivalence (i.e., A-equivalence) in the sense…
An $n \times n$ matrix $A$ with real entries is said to be Schur stable if all the eigenvalues of $A$ are inside the open unit disc. We investigate the structure of linear maps on $M_n(\mathbb{R})$ that preserve the collection $\mathcal{S}$…
The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of…
In order to generalize the results of Mazur-Ulam and Vogt, we shall prove that any map T which preserves equality of distance with T(0)=0 between two F-spaces without surjective condition is linear. Then, as a special case linear isometries…