THE DIMENSION OF CENTRALISERS OF MATRICES OF ORDER n | |
Zhang, Dong ; Zhao, Hancong | |
2016 | |
关键词 | centraliser asymptotic enumeration partition commutator |
英文摘要 | In this paper, we study the integer sequence (E-n)(n >= 1), where En counts the number of possible dimensions for centralisers of n x n matrices. We give an example to show another combinatorial interpretation of E-n and present an implicit recurrence formula for E-n, which may provide a fast algorithm for computing E-n. Based on the recurrence, we obtain the asymptotic formula E-n = 1/2 n(2) - 2/3 root 2n(3/2) + O(n(5/4)).; SCI(E); ARTICLE; dongzhang@pku.edu.cn; hancongzh@163.com; 3; 353-361; 94 |
语种 | 英语 |
出处 | SCI |
出版者 | BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY |
内容类型 | 其他 |
源URL | [http://hdl.handle.net/20.500.11897/458327] |
专题 | 数学科学学院 |
推荐引用方式 GB/T 7714 | Zhang, Dong,Zhao, Hancong. THE DIMENSION OF CENTRALISERS OF MATRICES OF ORDER n. 2016-01-01. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论