We use the Hopf algebra structure of the algebra of symmetric functions to study the Adams operators of the complex representation rings of symmetric groups, and we give new proofs of all of Littlewood's formulas for inner plethysm. We also study the Adams operations for orthogonal and symplectic gr
A combinatorial approach to matrix algebra
โ Scribed by Doron Zeilberger
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 480 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
The theory of correspondence reaches far deeper than that of mere numerical congruity with which it is associated as the substance with the shadow"
๐ SIMILAR VOLUMES
The k-MAXCUT problem for undirected graphs C = (V, E ) consists of finding a partition V = V , U . . . U V, such that the number of edges with endpoints in two different sets V, is maximized. We offer a new approach to this problem by showing that the combinatorial notion of block designs can be use
In de novo protein design one attempts to create artificial proteins with defined structure and function from first principles, usually with the help of trial-and-error procedures [\*] A.