Related papers: Generic skew-symmetric matrix polynomials with fix…
We introduce an operation on skew-symmetric matrices over $\mathbb{Z}/\ell\mathbb{Z}$ called switching, and also define a class of skew-symmetric matrices over $\mathbb{Z}/\ell\mathbb{Z}$ referred to as modular Eulerian matrices. We then…
A characterization of the structure of a regular matrix pencil obtained by a bounded rank perturbation of another regular matrix pencil has been recently obtained. The result generalizes the solution for the bounded rank perturbation…
The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…
We investigate convexity properties of the set of eigenvalue tuples of $n\times n$ real symmetric matrices, whose all $k\times k$ (where $k\leq n$ is fixed) minors are positive semidefinite. It is proven that the set…
In this paper we illustrate by some examples the connection between the number of solutions of polynomial equations satisfying degree conditions and the number of rank I matrices related to persymmetric matrices.
In 2003, Fomin and Zelevinsky obtained Cartan-Killing type classification of all cluster algebras of finite type, i.e. cluster algebras having only finitely many distinct cluster variables. A wider class of cluster algebras is formed by…
We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…
Denote by $A$ the adjacency matrix of an Erdos-Renyi graph with bounded average degree. We consider the problem of maximizing $\langle A-E\{A\},X\rangle$ over the set of positive semidefinite matrices $X$ with diagonal entries $X_{ii}=1$.…
Let $G^\sigma$ be an orientation of a simple graph $G$. In this paper, the permanental polynomial of an oriented graph $G^\sigma$ is introduced. The coefficients of the permanental polynomial of $G^\sigma$ are interpreted in terms of the…
Let M be a p-by-q matrix with nonnegative entries. The positive semidefinite rank (psd rank) of M is the smallest integer k for which there exist positive semidefinite matrices $A_i, B_j$ of size $k \times k$ such that $M_{ij} =…
In this paper, we introduce the notion of (strictly) semimonotone matrices of exact order $k$, where $0\leq k\leq n$, and explore their properties. We fully characterize the $3 \times 3$ (strictly) semimonotone matrices of exact order $2$,…
Dual complex numbers can represent rigid body motion in 2D spaces. Dual complex matrices are linked with screw theory, and have potential applications in various areas. In this paper, we study low rank approximation of dual complex…
Let $\mathcal{H}_{n,d} := \mathbb{R}[x_1$,$\ldots$, $x_n]_d$ be the set of all the homogeneous polynomials of degree $d$, and let $\mathcal{H}_{n,d}^s := \mathcal{H}_{n,d}^{\mathfrak{S}_n}$ be the subset of all the symmetric polynomials.…
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…
We present an analysis of sets of matrices with rank less than or equal to a specified number $s$. We provide a simple formula for the normal cone to such sets, and use this to show that these sets are prox-regular at all points with rank…
The main result of the paper is a classification of singularities of complex skew-symmetric matrix families of even size which are simple under a natural equivalence relation. The classification is obtained by appropriate suspensions of…
The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the…
We construct, for every even dimensional sphere $S^n$, $n >1$, and every odd integer $k$, a homogeneous polynomial map $f: S^{n}\to S^{n}$ of Brouwer degree $k$ and algebraic degree $2|k|-1$.
The adjacency matrices of graphs form a special subset of the set of all integer symmetric matrices. The description of which graphs have all their eigenvalues in the interval [-2,2] (i.e., those having spectral radius at most 2) has been…
A regular matrix pencil sE-A and its rank one perturbations are considered. We determine the sets in the extended complex plane which are the eigenvalues of the perturbed pencil. We show that the largest Jordan chains at each eigenvalue of…