Orthogonal tableaux and an insertion algorithm for SO(2n + 1)
dc.contributor.author | Sundaram, Sheila | en_US |
dc.date.accessioned | 2006-04-10T13:49:33Z | |
dc.date.available | 2006-04-10T13:49:33Z | |
dc.date.issued | 1990-03 | en_US |
dc.identifier.citation | Sundaram, Sheila (1990/03)."Orthogonal tableaux and an insertion algorithm for SO(2n + 1)." Journal of Combinatorial Theory, Series A 53(2): 239-256. <http://hdl.handle.net/2027.42/28709> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6WHS-4CX05PX-1X/2/5453c479794bc3222063d34dbce7e74a | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/28709 | |
dc.description.abstract | A new set of tableaux indexing the weights of the irreducible representations of SO(2n + 1) is presented. These tableaux are used to produce an insertion scheme which gives a combinatorial description of the decomposition of the kth tensor power of the natural action of SO(2n + 1) into irreducibles. In particular, the multiplicities in this decomposition are described explicitly. | en_US |
dc.format.extent | 866037 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Orthogonal tableaux and an insertion algorithm for SO(2n + 1) | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, University of Michigan, Ann Arbor, Michigan 48109, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/28709/1/0000529.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0097-3165(90)90059-6 | en_US |
dc.identifier.source | Journal of Combinatorial Theory, Series A | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.