The shape of a Young diagram Y (I Y[ = n) can be specified in terms of the set of symmetric power sums over its contents, at = ~(i,j)~r(/"-i)t; ~ = 1,2 .... , n. It is remarkable that the set of power sums try, a2 .... , ak is sufficient to characterize the Young diagrams possessing up to n(k) boxes
โฆ LIBER โฆ
Problem of appointments and minimization of the sums of linear forms on a symmetric group
โ Scribed by D. A. Suprunenko; N. N. Metel'skii
- Publisher
- Springer US
- Year
- 1975
- Tongue
- English
- Weight
- 345 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1573-8337
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Minimal set of class-sums characterizing
โ
Jacob Katriel
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 276 KB
Minimum of a linear form on the set of a
โ
V. S. Aizenshtat; D. N. Kravchuk
๐
Article
๐
1972
๐
Springer US
๐
English
โ 166 KB
Problems of combinatorial optimization,
โ
A. I. Barvinok
๐
Article
๐
1991
๐
SP MAIK Nauka/Interperiodica
๐
English
โ 436 KB
On the representation of a binary quadra
โ
L. J. Mordell
๐
Article
๐
1932
๐
Springer-Verlag
๐
French
โ 574 KB
Discriminant of symmetric matrices as a
โ
Mรกtyรกs Domokos
๐
Article
๐
2010
๐
John Wiley and Sons
๐
English
โ 228 KB
Minimal Factorizations of a Cycle and Ce
โ
Philippe Biane
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 508 KB
We show that the number of factorizations \_=/ 1 } } } / r of a cycle of length n into a product of cycles of lengths a 1 , ..., a r , with r j=1 (a j &1)=n&1, is equal to n r&1 . This generalizes a well known result of J. Denes, concerning factorizations into a product of transpositions. We investi