SearcharxivSearch

arXiv · 1601.00564

Three dimensional Sklyanin algebras and Groebner bases

Abstract

We consider a Sklyanin algebra S with 3 generators, which is the quadratic algebra over a field k with three generators x,y,z given by three relations pxy+qyx+rzz=0, pyz+qzy+rxx=0 and pzx+qxz+ryy=0, where p,q,r are parameters from the fileld k. This class of algebras enjoyed much of attention, in particular, using tools from algebraic geometry, Feigin & Odesskii, and Artin, Tate & Van den Berg, showed that if at least two of the parameters p, q and r are non-zero and at least two of three numbers p^3,q^3 and r^3 are distinct, then S is Koszul and has the same Hilbert series as the algebra of commutative polynomials in three variables. It became commonly accepted, that it is impossible to achieve the same objective by purely algebraic and combinatorial means, like the Groebner basis technique. The main purpose of this paper is to trace combinatorial meaning of the properties of Sklyanin algebras, such as Koszulity, PBW, PHS, Calabi-Yau, and to give a new constructive proof of the above facts due to Artin, Tate and Van den Bergh. Further, we study a wider class of Sklyanin algebras, namely the situation when all parameters of relations could be different. This class called generalized Sklyanin algebras. We classify up to isomorphism genralized Sklyanin algebras with polynomial Hilbert series. We show that generalized Slyanin algebras in general position have the Golod-Shafarevich Hilbert series (with exception of the case of the field with two elements).

Explore related subjects

Keep this discovery

BibTeXRIS

Natalia Iyudu, Stanislav Shkarin. 2016-08-27. Three dimensional Sklyanin algebras and Groebner bases. https://arxiv.org/abs/1601.00564

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA