Forgot password?
 Create new account
View 220|Reply 0

[组合] 最多的可交换的n阶矩阵

[Copy link]

3147

Threads

8493

Posts

610K

Credits

Credits
66163
QQ

Show all posts

hbghlyj Posted at 2022-3-26 21:26:07 |Read mode
REU12的第56题:

(Miklós Abért) Let $A_{1}, \ldots, A_{m}, B_{1}, \ldots, B_{m} \in M_{n}(F)$ be $n \times n$ matrices. Suppose that $A_{i} B_{j}=B_{j} A_{i}$ if and only if $i \neq j$. Prove: $m \leq n^{2}$.

手机版Mobile version|Leisure Math Forum

2025-4-20 22:14 GMT+8

Powered by Discuz!

× Quick Reply To Top Return to the list