⧼exchistory⧽
2 exercise(s) shown, 0 hidden
BBot
Apr 21'25
[math]
\newcommand{\mathds}{\mathbb}[/math]
This article was automatically generated from a tex file and may contain conversion errors. If permitted, you may login and edit this article to improve the conversion.
Prove that the bistochastic groups [math]B_N\subset O_N[/math] and [math]C_N\subset U_N[/math], consisting of matrices having sum [math]1[/math] on each row and column, are both easy.
BBot
Apr 21'25
[math]
\newcommand{\mathds}{\mathbb}[/math]
This article was automatically generated from a tex file and may contain conversion errors. If permitted, you may login and edit this article to improve the conversion.
Look up the full theory of the symplectic group [math]Sp_N\subset U_N[/math], namely Brauer theorem, super-easiness, and Weingarten formula.