Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"Multiplicity-free"”.

  1. Multiplicity-free permutation representations of the alternating groups

    … representation of a finite group G is said to be multiplicity-free if each irreducible constituent of the associated permutation character of G occurs with multiplicity one. If H is a subgroup of G, then G acts naturally on the set of cosets of H. This action is transitive and the associated …

    uiuc Repository record for Multiplicity-free permutation representations of the alternating groups (opens in a new tab)

  2. Coxeter systems, multiplicity free representations, and twisted Kazhdan-Lusztig Theory

    This thesis considers three topics related to the representations of Coxeter systems, their Hecke algebras, and related groups. The first topic concerns the construction of generalized involution models, as defined by Bump and Ginzburg. We compute the automorphism groups of all complex reflection …

    mit Repository record for Coxeter systems, multiplicity free representations, and twisted Kazhdan-Lusztig Theory (opens in a new tab)

  3. Multiplicity-free Hamiltonian actions and existence of invariant Kähler structure

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1996.

    mit Repository record for Multiplicity-free Hamiltonian actions and existence of invariant Kähler structure (opens in a new tab)

  4. Weil Representations of Unitary Groups

    … we show that this Weil representation is multiplicity free. Furthermore, restriction to the special unitary group SU2n(A) preserves irreducibility and multiplicity freeness, provided n > 1. On the other hand, a Cli ord theory description of all irreducible constituents of the Weil module …

    regina Repository record for Weil Representations of Unitary Groups (opens in a new tab)

  5. Enumeration, algorithms, and complexity in algebraic combinatorics

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms

    uiuc Repository record for Enumeration, algorithms, and complexity in algebraic combinatorics (opens in a new tab)

  6. Fusions of association schemes

    … ≤ 20. In addition, we classify almost all of the multiplicity-free subgroups of the symmetric group based on their nontrivial fusions. The Hamming scheme, H(n, q) is an important example in coding theory [10]. The fusionprimitivity of the Hamming scheme has been discussed before (see [28]). In …

    regina Repository record for Fusions of association schemes (opens in a new tab)