1995
DOI: 10.1080/03081089508818371
|View full text |Cite
|
Sign up to set email alerts
|

On the jordan form of the tensor product over fields of prime characteristic

Abstract: L-et 4. B denote the companion matrice\ of the polynomials rm. u" ovcr a field r ofprime order r, and let i. p be 11011-~efo elements oidn extension field K of F. The Jordan torm of the tensor product ( I ! t A ) @ (pi t B) of in\ertibleJordan matrices ovcr K is determmed vla an equivalent study oithe niipotent transformation 5 of rn x n matricer X over F, where (X)S = A T X I-XB. Ubing mod~de-theoretic concepts a Jordan bas18 for S 18 spccificd recursively ~n terms of the representations of m and n in the sca… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
24
0

Year Published

2002
2002
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 22 publications
(24 citation statements)
references
References 10 publications
0
24
0
Order By: Relevance
“…, r 0 }. See p. 354 of [11] for the proof of Lemma 4. Notice that ¼ (m, n) as in Lemma 4 is non-increasing if and only if lðm, nÞ ¼ ðl 1 , l 2 , .…”
Section: General Properties Of S(m N)mentioning
confidence: 97%
See 1 more Smart Citation
“…, r 0 }. See p. 354 of [11] for the proof of Lemma 4. Notice that ¼ (m, n) as in Lemma 4 is non-increasing if and only if lðm, nÞ ¼ ðl 1 , l 2 , .…”
Section: General Properties Of S(m N)mentioning
confidence: 97%
“…It is convenient to concentrate exclusively on S(m, n) which we regard as a linear mapping of V ¼ Vðm, nÞ ¼ m F n since c is a basis of V and (1.5) is a matrix over the prime field F. We recall some terminology from [11]. Write V r ¼ hEði, jÞ : i þ j ¼ r þ 1i ð 3:1Þ…”
Section: Graded Jordan Bases For S(m N)mentioning
confidence: 99%
“…, V q } be a set of representatives of these isomorphism classes with dim V i = i. Many authors have investigated the decomposition of the KG-module V n ⊗ V m , where n ≥ m, into a direct sum of indecomposable KG-modules-for example, in order of publication, see [3][4][5][6][7][8][9][10]. From the works of these authors, it is well-known that V n ⊗ V m decomposes into a direct sum of m indecomposable KG-modules, but that the dimensions of the components depend on the characteristic p. However, in the special case of p ≥ n + m − 1 that we consider in this paper,…”
Section: Introductionmentioning
confidence: 99%
“…In describing Norman's algorithm, we follow Hou's account [3, Theorem 2.2]. In the notation of [6] and [3], iðmÞ is the identity permutation of f1; . .…”
Section: Introductionmentioning
confidence: 99%
“…Many authors have investigated the decomposition of V m n V n into a direct sum of indecomposable KG-modules. See [2], [3], [5], [6], [7], and [8].…”
Section: Introductionmentioning
confidence: 99%