Sökning: "K Snellman"

Hittade 3 avhandlingar innehållade orden K Snellman.

  1. 1. The k-assignment polytope, phylogenetic trees, and permutation patterns

    Författare :Jonna Gill; Jan Snellman; Axel Hultman; Bruce Sagan; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : In this thesis three combinatorial problems are studied in four papers.In Paper 1 we study the structure of the k-assignment polytope, whose vertices are the mxn (0,1)-matrices with exactly k 1:s and at most one 1 in each row and each column. LÄS MER

  3. 2. A graded subring of an inverse limit of polynomial rings

    Författare :Jan Snellman; Jörgen Backelin; Guillermo Moreno Socias; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Gröbner bases; generic forms; inverse limit; Algebra and geometry; Algebra och geometri;

    Sammanfattning : We study the power series ring R= K[[x1,x2,x3,...]]on countably infinitely many variables, over a field K, and two particular K-subalgebras of it: the ring S, which is isomorphic to an inverse limit of the polynomial rings in finitely many variables over K, and the ring R', which is the largest graded subalgebra of R. LÄS MER

  4. 3. Centra of Quiver Algebras

    Författare :Elin Gawell; Christian Gottlieb; Qimh Xantcha; Jan Snellman; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; quiver; algebra; commutativity ideal; anti-commutativity ideal; non-commutative; partly commutative; partly anti-commutative; center; Koszul algebra; finitely generated; graded center; Hochschild cohomology; support variety; associative algebra; Mathematics; matematik;

    Sammanfattning : A partly (anti-)commutative quiver algebra is a quiver algebra bound by an (anti-)commutativity ideal, that is, a quadratic ideal generated by monomials and (anti-)commutativity relations. We give a combinatorial description of the ideals and the associated generator graphs, from which one can quickly determine if the ideal is admissible or not. LÄS MER