Related papers: Simple polynomial equations over (mxm)-matrices

In this work, we generalize the probability simplex constraint to matrices, i.e., $\mathbf{X}_1 + \mathbf{X}_2 + \ldots + \mathbf{X}_K = \mathbf{I}$, where $\mathbf{X}_i \succeq 0$ is a symmetric positive semidefinite matrix of size…

We define tensors, corresponding to cubic polynomials, which have the same exponent $\omega$ as the matrix multiplication tensor. In particular, we study the symmetrized matrix multiplication tensor $sM_n$ defined on an $n\times n$ matrix…

In this paper we study a family of polynomials $$S_n^{(m)}(x):=\sum_{i,j=0}^n\binom ni^m\binom nj^m\binom{i+j}ix^{i+j}\ \ (m,n=0,1,2,\ldots).$$ For example, we show that $$\sum_{k=0}^{p-1}S_k^{(0)}(x)\equiv\frac…

Let us extend the pair of operations (max,+) over real numbers to matrices in the same way as in conventional linear algebra. We study integer images of max-plus linear mappings. The question whether Ax (in the max-plus algebra) is an…

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…

This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…

For each $n$, let $M_n$ be an $n\times n$ random matrix with independent $\pm 1$ entries. We show that ${\mathbb P}\{\mbox{$M_n$ is singular}\}=(1/2+o_n(1))^n$, which settles an old problem. Some generalizations are considered.

Three polynomials are defined for given sets $S$ of $n$ points in general position in the plane: The Voronoi polynomial with coefficients the numbers of vertices of the order-$k$ Voronoi diagrams of $S$, the circle polynomial with…

We consider two sequences of orthogonal polynomials $(P_n)_{n\geq 0}$ and $(Q_n)_{n\geq 0}$ such that $$ \sum_{j=1} ^{M} a_{j,n}\mathrm{S}_x\mathrm{D}_x ^k P_{k+n-j} (z)=\sum_{j=1} ^{N} b_{j,n}\mathrm{D}_x ^{m} Q_{m+n-j} (z)\;, $$ with…

This paper presents an innovative set of tools developed to support a methodology to find the left eigenvalues of $m$ order quaternion square matrix. It is solving four real polynomial equations of order not greater than $4m-3$ in four…

We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \sum_{i\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while…

An $m \times (n+1)$ multiplicity matrix is a matrix $M = ( \mu_{i,j} )$ with rows enumerated by $i \in \{ 1,\ 2, \ldots, m \}$ and columns enumerated by $j \in \{ 0,1,\ldots, n \}$ whose coordinates are nonnegative integers satisfying the…

The Deligne-Simpson problem in the multiplicative version is formulated like this: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\in SL(n,{\bf C})$ so that there exist irreducible $(p+1)$-tuples…

We present a simple proof of the fact that the base (and independence) polytope of a rank $n$ regular matroid over $m$ elements has an extension complexity $O(mn)$.

Let M be an archimedean quadratic module of real t-by-t matrix polynomials in n variables, and let S be the set of all real n-tuples where each element of M is positive semidefinite. Our key finding is a natural bijection between the set of…

We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an $n\times n$ matrix over a finite field that requires $O(n^3)$ field operations and O(n) random vectors, and is well suited for successful practical…

Consider a $m \times n$ matrix $A$, whose elements are arbitrary integers. Consider, for each square window of size $2 \times 2$, the sum of the corresponding elements of $A$. These sums form a $(m - 1) \times (n-1)$ matrix $S$. Can we…

Let $I_{n,m} = (x_1\cdots x_{m},x_2 \cdots x_{m+1},\ldots,x_{n+1}x_{n+2}\cdots x_{n+m})$ be the $m$-path ideal of a path of length $n + m-1$ over a polynomial ring $S = \mathrm{k}[x_1,\ldots,x_{n+m}]$. We compute all the graded Betti…

We consider positive solutions to parametrized systems of generalized polynomial equations (with real exponents and positive parameters). By a fundamental result obtained in parallel work, polynomial systems are determined by geometric…

In this work we consider a given root of a family of n-degree polynomials as a one-variable function that depends only on the independent term. Then we prove that this function satisfies several ordinary differential equations (ODE). More…