Sökning: "Samuel Lundqvist"

Hittade 2 avhandlingar innehållade orden Samuel Lundqvist.

  1. 1. Computational algorithms for algebras

    Författare :Samuel Lundqvist; Clas Löfwall; Ralf Fröberg; H. Michael Möller; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Hilbert function; Gröbner basis; zero-dimensional ideal; affine variety; projective variety; run-time complexity; Algebra and geometry; Algebra och geometri; Mathematics; matematik;

    Sammanfattning : This thesis consists of six papers. In Paper I, we give an algorithm for merging sorted lists of monomials and together with a projection technique, we obtain a new complexity bound for the Buchberger-Möller algorithm and the FGLM algorithm. LÄS MER

  3. 2. Around minimal Hilbert series problems for graded algebras

    Författare :Lisa Nicklasson; Samuel Lundqvist; Christian Gottlieb; Uwe Nagel; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Graded algebras; Hilbert series; Lefschetz properties; Exterior algebra; Linear resolution; Mathematics; matematik;

    Sammanfattning : The Hilbert series of a graded algebra is an invariant that encodes the dimension of the algebra's graded compontents. It can be seen as a tool for measuring the size of a graded algebra. This gives rise to the idea of algebras with a "minimal Hilbert series", among the algebras within a certain family. LÄS MER