1990
DOI: 10.1080/03081089008818015
|View full text |Cite
|
Sign up to set email alerts
|

Matrix realizations of littlewood—richardson sequences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
22
0

Year Published

1993
1993
2005
2005

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 14 publications
(22 citation statements)
references
References 6 publications
0
22
0
Order By: Relevance
“…. , m t ) is by decreasing order, T is a Littlewood-Richardson tableau [1][2][3]. Now, for each partition a and n × n unimodular matrix U , let T (a,M) (U ) be the set of all sequences of matrices, as above, with (m 1 , .…”
Section: Introductionmentioning
confidence: 99%
“…. , m t ) is by decreasing order, T is a Littlewood-Richardson tableau [1][2][3]. Now, for each partition a and n × n unimodular matrix U , let T (a,M) (U ) be the set of all sequences of matrices, as above, with (m 1 , .…”
Section: Introductionmentioning
confidence: 99%
“…For the matrix product problem, say, this means that, if we solve the problem when A and B are viewed as matrices over R p , i.e., if we characterize the power-of-p elementary divisors of a matrix product, for each individual prime p, then we get a solution to the general problem, by just merging together chains of prime power elementary divisors. This is done by R. Thompson in [25] (see also [3], for products of possibly singular matrices). Localization and primary decompositions are well-understood techniques both in abstract commutative algebra and module theory (e.g.…”
Section: Invariant Factorsmentioning
confidence: 99%
“…Suppose T is a nilpotent operator on H. Obviously the number λ 1 = max{h(x, {0}) : x ∈ H} can be attained for some v 1 …”
Section: Lemma 11 Let T ∈ L(h) Be Of Type λ Thenmentioning
confidence: 99%
“…w + e c,δ 1 . In both cases v ∈ N (T δ 1 ) and T e c,δ 1 ∈ M. This and the induction assumption implies (5) and statements (1)- (4) for j = 2, .…”
Section: Definition 21 Let T ∈ L(h) T ∈ L(h )mentioning
confidence: 99%
See 1 more Smart Citation