Please use this identifier to cite or link to this item:
http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/4501
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | SHARMA, UDAY BHASKAR | en_US |
dc.contributor.author | SINGH, ANUPAM KUMAR | en_US |
dc.date.accessioned | 2020-03-20T11:22:22Z | |
dc.date.available | 2020-03-20T11:22:22Z | |
dc.date.issued | 2020-03 | en_US |
dc.identifier.citation | Communications in Algebra, 48(7). | en_US |
dc.identifier.issn | 0092-7872 | en_US |
dc.identifier.uri | http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/4501 | |
dc.identifier.uri | https://doi.org/10.1080/00927872.2020.1726366 | en_US |
dc.description.abstract | This paper concerns the enumeration of simultaneous conjugacy classes of tuples of commuting unitary matrices and of commuting symplectic matrices over a finite field Fq of odd size. For any given conjugacy class, the orbits for the action of its centralizer group on itself by conjugation (that is, the conjugacy classes within the centralizer group) are called branches. We determine the branching rules for the unitary groups U2(Fq),U3(Fq), and for the symplectic groups Sp2(Fq),Sp4(Fq). | en_US |
dc.language.iso | en | en_US |
dc.publisher | Taylor & Francis | en_US |
dc.subject | Branching rules | en_US |
dc.subject | Commuting tuples of matrices | en_US |
dc.subject | Generating functions | en_US |
dc.subject | Similarity classes | en_US |
dc.subject | Symplectic group | en_US |
dc.subject | Unitary group | en_US |
dc.subject | TOC-MAR-2020 | en_US |
dc.subject | 2020 | en_US |
dc.subject | 2020-MAR-WEEK3 | en_US |
dc.title | Branching rules for unitary and symplectic matrices | en_US |
dc.type | Article | en_US |
dc.contributor.department | Dept. of Mathematics | en_US |
dc.identifier.sourcetitle | Communications in Algebra | en_US |
dc.publication.originofpublisher | Foreign | en_US |
Appears in Collections: | JOURNAL ARTICLES |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.