Graphs of relations and Hilbert series


Autoria(s): Cameron, P.; Iyudu, Natalia
Data(s)

01/11/2007

Resumo

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 $\frac {n(n-1)}{2}$ relations for $n \leq 7$. Then we investigate combinatorial structure of colored graph associated to 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 to each color are pairwise 2-isomorphic.

Identificador

http://pure.qub.ac.uk/portal/en/publications/graphs-of-relations-and-hilbert-series(b2c09c1f-6642-4c40-90c7-ac23b41c1e35).html

http://dx.doi.org/10.1016/j.jsc.2007.07.006

http://www.scopus.com/inward/record.url?scp=35848930149&partnerID=8YFLogxK

Idioma(s)

eng

Direitos

info:eu-repo/semantics/restrictedAccess

Fonte

Cameron , P & Iyudu , N 2007 , ' Graphs of relations and Hilbert series ' Journal of Symbolic Computation , vol 42 , no. 11-12 , pp. 1066-1078 . DOI: 10.1016/j.jsc.2007.07.006

Palavras-Chave #/dk/atira/pure/subjectarea/asjc/2600/2602 #Algebra and Number Theory #/dk/atira/pure/subjectarea/asjc/2600/2605 #Computational Mathematics
Tipo

article