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 7 of 7 for “"Matrix groups"”.

  1. Finite symplectic matrix groups

    The finite subgroups of GL(m, Q) are those subgroups that fix a full lattice in Q^m together with some positive definite symmetric form. A subgroup of GL(m, Q) is called symplectic, if it fixes a nondegenerate skewsymmetric form. Such groups only exist if m is even. A symplectic subgroup of GL(2n, …

    aachen Repository record for Finite symplectic matrix groups (opens in a new tab)

  2. Hecke Groups and Free-Products of Two Cyclic Matrix-Groups

    Made available in DSpace on 2014-12-11T18:24:09Z (GMT). No. of bitstreams: 1 7414529.pdf: 2568704 bytes, checksum: 4f575cbdcd5d76e75b00b8e18f6630de (MD5) Previous issue date: 1974

    uiuc Repository record for Hecke Groups and Free-Products of Two Cyclic Matrix-Groups (opens in a new tab)

  3. Hecke-Algebren zu unimodularen und unitären Matrixgruppen über Dedekind-Ringen

    … of the Hecke algebras related to unimodular matrix groups over Dedekind domains and to unitary matrix groups over the ring of integers of an imaginary quadratic number field is being analysed. The first main result of the analysis of the unimodular groups over a Dedekind domain o is a measure …

    aachen Repository record for Hecke-Algebren zu unimodularen und unitären Matrixgruppen über Dedekind-Ringen (opens in a new tab)

  4. Invariant proper holomorphic maps between balls

    … that are invariant under the action of finite groups of unitary matrices. We are primarily interested in actions of groups that are fixed-point-free; for purposes of comparison we will briefly consider matrix groups that act with fixed points (that is, groups that have at least one nontrivial …

    uiuc Repository record for Invariant proper holomorphic maps between balls (opens in a new tab)

  5. Three complexity classification questions at the quantum/classical boundary

    … of computing the permanent over various matrix groups. In particular, this will show that computing the permanent of a unitary matrix is #P-hard. The theorem statement is classical, and yet, the proof is almost entirely the result of exploiting well-known theorems in quantum linear …

    mit Repository record for Three complexity classification questions at the quantum/classical boundary (opens in a new tab)

  6. Q-systems and generalizations in representation theory

    We study tau-functions given as matrix elements for the action of loop groups, $\widehat{GL_n}$ on $n$-component fermionic Fock space. In the simplest case, $n=2$, the tau-functions are equal to Hankel determinants and applying the famous Desnanot-Jacobi identity, one can see that they satisfy a …

    uiuc Repository record for Q-systems and generalizations in representation theory (opens in a new tab)

  7. The game of Lights out

    <p>"The game of Lights Out is a game with simple rules but an intriguing mathematical structure. The goal of this paper is to first introduce a basic overview of the classic game including game rules and methods for finding solutions, and then extend these concepts using many different mathematical …

    eastern-wash Repository record for The game of Lights out (opens in a new tab)