Graphs of relations and Hilbert series

Simple item page
dc.creatorCameron, Peter
dc.creatorIyudu, Natalia
dc.date2008-01-19
dc.date.accessioned2026-07-07T08:55:30Z
dc.date.available2026-07-07T08:55:30Z
dc.descriptionWe 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 n(n-1)/2 relations for n less or equal then 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.
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/0801.3013
dc.identifierhttp://arxiv.org/abs/0801.3013
dc.identifierJournal of Symbolic Computation, V42, no.11-12(2007), 1066-1078
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/146291
dc.subjectRings and Algebras
dc.subjectCombinatorics
dc.subject16S37; 16S15; 05C20
dc.titleGraphs of relations and Hilbert series
dc.typetext

Files

Collections

arXiv