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 $\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.
Original language | English |
---|---|
Pages (from-to) | 1066-1078 |
Number of pages | 13 |
Journal | Journal of Symbolic Computation |
Volume | 42 |
Issue number | 11-12 |
DOIs | |
Publication status | Published - Nov 2007 |
ASJC Scopus subject areas
- Algebra and Number Theory
- Computational Mathematics