A New Algorithm for Decomposing Modular Tensor Products
Persistent URL
Author(s)
Barry, Michael J.
Date Issued
January 11, 2021
Abstract
Let p be a prime and let Jr denote a full r×r Jordan block matrix with eigenvalue 1 over a field F of characteristic p. For positive integers r and s with r≤s , the Jordan canonical form of the rs×rs matrix Jr⊗Js has the form Jλ1⊕Jλ2⊕⋯⊕Jλr . This decomposition determines a partition λ(r,s,p)=(λ1,λ2,…,λr) of rs . Let n1,…,nk be the multiplicities of the distinct parts of the partition and set c(r,s,p)=(n1,…,nk) . Then c(r,s,p) is a composition of r. We present a new bottom-up algorithm for computing c(r,s,p) and λ(r,s,p) directly from the base-p expansions for r and s.
Journal
Bulletin of the Australian Mathematical Society
Department
Mathematics
Citation
BARRY, M. (2021). A NEW ALGORITHM FOR DECOMPOSING MODULAR TENSOR PRODUCTS. Bulletin of the Australian Mathematical Society, 104(1), 94-107. doi:10.1017/S0004972720001379
Publisher
Cambridge University Press
Embargo
This version of the article is available for viewing to the public after July 11, 2021.
DOI
10.1017/S0004972720001379
ISSN
0004-9727
1755-1633
Rights
Accepted for Publication. CC BY-NC-ND
© 2020 Australian Mathematical Publishing Association Inc.
File(s)![Thumbnail Image]()
Name
2021-01-11_Barry_New.pdf
Description
Postprint
Size
378.28 KB
Format
Adobe PDF
Checksum (MD5)
67865b8862e52cedb830d6b248d3ab89