• Title of article

    Graphs of relations and Hilbert series

  • Author/Authors

    Peter Cameron، نويسنده , , Natalia Iyudu، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2007
  • Pages
    13
  • From page
    1066
  • To page
    1078
  • Abstract
    We are discussing certain combinatorial and counting problems related to quadratic algebras. First we give examples which confirm the Anick conjecture on the minimal Hilbert series for algebras given by n generators and relations for n 7. Then we investigate combinatorial structure of colored graph associated with relations of RIT algebra. Precise descriptions of graphs (maps) corresponding to algebras with maximal Hilbert series are given in certain cases. As a consequence it turns out, for example, that RIT algebra may have a maximal Hilbert series only if components of the graph associated with each color are pairwise 2-isomorphic.
  • Keywords
    Quadratic algebras , Gr¨obner basis , Colored graph , Hilbert series
  • Journal title
    Journal of Symbolic Computation
  • Serial Year
    2007
  • Journal title
    Journal of Symbolic Computation
  • Record number

    806034