Polynomial Properties in Unitriangular Matrices
✍ Scribed by Antonio Vera-López; J.M Arregi
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 92 KB
- Volume
- 244
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
✦ Synopsis
Let n = n q be the group of the upper unitriangular matrices of size n over q , the finite field of q = p t elements. G. Higman has conjectured that, for each n, the number of conjugacy classes of elements of n is a polynomial expression in q. In this paper we prove that the number of conjugacy classes of n of cardinality q s , with s ≤ n -3, is a polynomial in q -1, with non-negative integral coefficients, f s q -1 , of degree less than or equal to the integer part of √ 2s + 1. In addition, f s q -1 depends only on s and not on n. We determine these polynomials arguing with the methods we gave previously (1995, J. Algebra 177, 899-925). In fact, the coefficients of these polynomials are obtained by certain generating functions.
📜 SIMILAR VOLUMES
## Banach's fixed point theorem Reciprocal of a quadratic polynomial Riordan matrices Changes of variables We iterate contractive one-degree polynomials with coefficients in the ring K[[x]] of formal power series to calculate the reciprocal in K[[x]] of a quadratic polynomial. Doing this we meet t
A systematic procedure to construct the (symmetric) static-stiffness, damping and mass matrices representing the unbounded medium is presented addressing the unit-impulse response matrix corresponding to the degrees of freedom on the structure-medium interface. The unit-impulse response matrix is fi