Generic symmetric matrix polynomials with bounded rank and fixed odd grade

11/04/2019
by   Fernando De Terán, et al.
0

We determine the generic complete eigenstructures for n × n complex symmetric matrix polynomials of odd grade d and rank at most r. More precisely, we show that the set of n × n complex symmetric matrix polynomials of odd grade d, i.e., of degree at most d, and rank at most r is the union of the closures of the rd/2+1 sets of symmetric matrix polynomials having certain, explicitly described, complete eigenstructures. Then, we prove that these sets are open in the set of n × n complex symmetric matrix polynomials of odd grade d and rank at most r. In order to prove the previous results, we need to derive necessary and sufficient conditions for the existence of symmetric matrix polynomials with prescribed grade, rank, and complete eigenstructure, in the case where all their elementary divisors are different from each other and of degree 1. An important remark on the results of this paper is that the generic eigenstructures identified in this work are completely different from the ones identified in previous works for unstructured and skew-symmetric matrix polynomials with bounded rank and fixed grade larger than one, because the symmetric ones include eigenvalues while the others not. This difference requires to use new techniques.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/10/2022

Some Extremal Symmetric Inequalities

Let ℋ_n,d^s := ℝ[x_1,…, x_n]_d^𝔖_n be the set of symmetric polynomials o...
research
10/12/2020

Structured strong ℓ-ifications for structured matrix polynomials in the monomial basis

In the framework of Polynomial Eigenvalue Problems, most of the matrix p...
research
03/12/2023

Higher-degree symmetric rank-metric codes

Over fields of characteristic unequal to 2, we can identify symmetric ma...
research
09/21/2022

Generic eigenstructures of Hermitian pencils

We obtain the generic complete eigenstructures of complex Hermitian n× n...
research
11/14/2022

Border complexity via elementary symmetric polynomials

In (ToCT'20) Kumar surprisingly proved that every polynomial can be appr...
research
07/21/2014

Certifying the Existence of Epipolar Matrices

Given a set of point correspondences in two images, the existence of a f...
research
05/22/2020

Polynomial traces and elementary symmetric functions in the latent roots of a non-central Wishart matrix

Hypergeometric functions and zonal polynomials are the tools usually add...

Please sign up or login with your details

Forgot password? Click here to reset