On the reduction $U_n\supset O_n$
Teoretičeskaâ i matematičeskaâ fizika, Tome 9 (1971) no. 1, pp. 86-90

Voir la notice de l'article provenant de la source Math-Net.Ru

The reduction $U_n$ $(n>3)$ is performed for the two-line representations of the group $U_n\supset O_n$. The algorithm of constructing the polinomials with highest weight with the respect to $O_n$ is given.
@article{TMF_1971_9_1_a5,
     author = {M. S. Kil'dyushov},
     title = {On the reduction $U_n\supset O_n$},
     journal = {Teoreti\v{c}eska\^a i matemati\v{c}eska\^a fizika},
     pages = {86--90},
     publisher = {mathdoc},
     volume = {9},
     number = {1},
     year = {1971},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TMF_1971_9_1_a5/}
}
TY  - JOUR
AU  - M. S. Kil'dyushov
TI  - On the reduction $U_n\supset O_n$
JO  - Teoretičeskaâ i matematičeskaâ fizika
PY  - 1971
SP  - 86
EP  - 90
VL  - 9
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TMF_1971_9_1_a5/
LA  - ru
ID  - TMF_1971_9_1_a5
ER  - 
%0 Journal Article
%A M. S. Kil'dyushov
%T On the reduction $U_n\supset O_n$
%J Teoretičeskaâ i matematičeskaâ fizika
%D 1971
%P 86-90
%V 9
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TMF_1971_9_1_a5/
%G ru
%F TMF_1971_9_1_a5
M. S. Kil'dyushov. On the reduction $U_n\supset O_n$. Teoretičeskaâ i matematičeskaâ fizika, Tome 9 (1971) no. 1, pp. 86-90. http://geodesic.mathdoc.fr/item/TMF_1971_9_1_a5/