Concretization Noematics of Instanced Regimentation Pluriform Refigurization Phalanx

Prijzen vanaf
29,99

Uitgelicht

VERGELIJK ALLE AANBIEDERS (2)

Beschrijving

Bol The generalized symmetric groups are the wreath product groups of the cyclic group with the symmetric group, a natural group-theoretic construction with many interesting applications. Some interesting special cases of these groups are the symmetric group and the hyperoctahedral group. We denote the wreath product groups (Z/rZ) ¿ Sn with G(n, r) throughout this thesis. The problem of counting the number of irreducible representations of a given group whose determinant is non-trivial gains interest for re- searchers recently. In the case of symmetric groups, they call such representations to be chiral if the composition of ¿ with the determinant map is non-trivial. The problem of counting the non-trivial determinants in [7] and [13] have their genesis in [28]. In [28], Macdonald developed combinatorics for partitions and gave a closed formula to count the number of odd-dimensional Specht modules for the symmetric groups. This number happened to be the product of the powers of 2 in the binary expansion of n and was obtained by characterizing the 2-core tower of the odd partitions.

Vergelijk aanbieders (2)

Sorteren op:

€ 29,99 Gratis verzending

€ 52,56 € 9,99 verzendkosten Totaal € 62,55

Beschrijving (1)

The generalized symmetric groups are the wreath product groups of the cyclic group with the symmetric group, a natural group-theoretic construction with many interesting applications. Some interesting special cases of these groups are the symmetric group and the hyperoctahedral group. We denote the wreath product groups (Z/rZ) ¿ Sn with G(n, r) throughout this thesis. The problem of counting the number of irreducible representations of a given group whose determinant is non-trivial gains interest for re- searchers recently. In the case of symmetric groups, they call such representations to be chiral if the composition of ¿ with the determinant map is non-trivial. The problem of counting the non-trivial determinants in [7] and [13] have their genesis in [28]. In [28], Macdonald developed combinatorics for partitions and gave a closed formula to count the number of odd-dimensional Specht modules for the symmetric groups. This number happened to be the product of the powers of 2 in the binary expansion of n and was obtained by characterizing the 2-core tower of the odd partitions.


Productspecificaties

Merk Independent Publisher
EAN
  • 9798232912161
Maat


Prijshistorie

* Prijshistorie bevat geen data van Amazon.

Prijzen voor het laatst bijgewerkt op:

Uitgelichte Keuze
29,99
Naar shop