Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/0107023

The Structure of The Group of Polynomial Matrices Unitary in The Indefinite Metric of Index 1

Boris D. Lubachevsky
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the group M of all polynomial matrices U(z) = U0 + U1*z + U2*z*z +...+Uk*z*...*z, k=0,1,... that satisfy equation U(z)*D*U(z)" = D with the diagonal n*n matrix D=diag{-1,1,1,...1}. Here n > 1, U(z)" = U0" + U1"*z + U2"*z*z + ..., and symbol A" for a constant matrix A denotes the Hermitiean conjugate of A. We show that the subgroup M0 of those U(z) in M, that are normalized by the condition U(0)=I, is the free product of certain groups. The matrices in each group-multiples are explicitly and uniquely parametrized so that every U=U(z) in M0 can be represented in the form U = G1 * G2 * ... * Gs with n*n polynomial matrix multiples G1, G2, ..., each of which belong to its group-multiple, and so that any two consecutive Gi and G(i+1) belong to two different group-multiples. The uniqueness of such parametrization for a given U includes the number of multiples s, their particular sequence G1,G2,... and the multiples themselves with their respective parametrization; all these items can be defined in only one way once the U is given.

Explore related subjects

math.GRmath.RA

Keep this discovery

BibTeXRIS

Boris D. Lubachevsky. 2001-07-04. The Structure of The Group of Polynomial Matrices Unitary in The Indefinite Metric of Index 1. https://arxiv.org/abs/math/0107023

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR↗
arXiv2026

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR↗
arXiv2026

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR↗