Search for dissertations about: "Irreducible polynomials"

Found 3 swedish dissertations containing the words Irreducible polynomials.

  1. 1. VLSI aspects on inversion in finite fields

    Author : Mikael Olofsson; Christof Paar; Linköpings universitet; []
    Keywords : VLSI; Inversion; Finite Fields; Area; Delay; Power dissipation; Irreducible polynomials; Polynomial basis; Triangular basis; Normal basis; Dual basis; Tower fields.; TECHNOLOGY; TEKNIKVETENSKAP;

    Abstract : Different algorithms and architectures for inversion in finite extension fields are studied. The investigation is restricted to fields of characteristic two. Based on a simple transistor model, various architectures are compared with respect to delay, area requirement, and energy consumption. READ MORE

  2. 2. Dualities, affine vertex operator algebras, and geometry of complex polynomials

    Author : Julius Borcea; Matematik (naturvetenskapliga fakulteten); []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Sendov s conjecture; annihilating fields; relative vertex operators; twisted modules; vertex operator algebras; Affine Lie algebras; standard modules; geometry of polynomials.; Mathematics; Matematik;

    Abstract : This thesis consists of two parts which deal with different subjects. In the first part we study certain aspects of the representation theory of affine Kac-Moody Lie algebras and related structures. READ MORE

  3. 3. Tensor Products of Highest Weight Representations and Skew-Symmetric Matrix Equations A+B+C=0

    Author : Ida Säfström; Göteborgs universitet; Göteborgs universitet; Gothenburg University; []
    Keywords : Highest weight respresentation; tensor product decomposition; orthogonal algebra; skew-symmetric matrix; Horn’s conjecture; moment map; coadjoint orbit; flag manifold; general linear algebra; infinite dimensional unitary representation; general linear algebra;

    Abstract : The question of characterizing the eigenvalues for the sum of two Hermitian matrices, was solved in 1999, after almost a century of efforts. The saturation conjecture for GL_C(n) was proven by Knutson and Tao, filling in the last gap in Horn’s conjecture. READ MORE