✦ LIBER ✦

Congruence of polynomial matrices

✍ Scribed by Stephen Pierce

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 85 KB
Volume: 294
Category: Article
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(99)00029-4

No coin nor oath required. For personal study only.

✦ Synopsis

Let Ct be the ring of all polynomials in the real variable t with complex coef-®cients. We show that if A is an n-square hermitian matrix with entries in R, then A is congruent to the direct sum of a zero matrix and a diagonally dominant matrix. Here, diagonally dominant means that the degree of any main diagonal entry is greater than the degree of any other entry in the same row and column.

📜 SIMILAR VOLUMES

Congruence of Hermitian matrices by Herm

Congruence of Hermitian matrices by Hermitian matrices

✍ M.I. Bueno; S. Furtado; C.R. Johnson 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Congruence of symmetric matrices over lo

Congruence of symmetric matrices over local rings

✍ Yonglin Cao; Fernando Szechtman 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 97 KB

Congruence classes of matrices in GL2(Fq

Congruence classes of matrices in GL2(Fq)

✍ Priscilla S. Bremser 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 315 KB

Given two matrices A and B in GL, ( F,), where q is a power of a prime and Fq is the finite field with q elements, we say that A and B are congruent if there is a matrix C in GL2( F,) such that A = CTBC. We show that there are q + 3 congruence classes in GL,(F,) for odd q and q + 1 classes for even

On the congruence transformation of a pe

On the congruence transformation of a pencil of real symmetric matrices to a pencil with identical characteristic polynomial

✍ Olga Taussky 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 273 KB

The Polynomial Method and Restricted Sum

The Polynomial Method and Restricted Sums of Congruence Classes

✍ Noga Alon; Melvyn B. Nathanson; Imre Ruzsa 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 432 KB

We present a simple and general algebraic technique for obtaining results in Additive Number Theory, and apply it to derive various new extensions of the Cauchy Davenport Theorem. In particular we obtain, for subsets A 0 , A 1 , ..., A k of the finite field Z p , a tight lower bound on the minimum p

Congruence arithmetic algorithms for pol

Congruence arithmetic algorithms for polynomial real zero determination

✍ Lee E. Heindel 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 903 KB

This paper describes a set of algorithms for isolating the real zeros of a univariate polynomial with integer coefficients. The algorithms employ congruence (modular, finite field) arithmetic and are analogous to a set of integer arithmetic algorithms described by the author in a recent paper. The a