Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantum Matrices by Paths

Published 23 Oct 2012 in math.QA and math.CO | (1210.6399v3)

Abstract: We study, from a combinatorial viewpoint, the quantized coordinate ring of mxn matrices over an infinite field K (also called quantum matrices) and its torus-invariant prime ideals. The first part of this paper shows that this algebra, traditionally defined by generators and relations, can be seen as subalgebra of a quantum torus by using paths in a certain directed graph. Roughly speaking, we view each generator of quantum matrices as a sum over paths in the graph, each path being assigned an element of the quantum torus. The quantum matrices relations then arise naturally by considering intersecting paths. This viewpoint is closely related to Cauchon's deleting-derivations algorithm. The second part of this paper is to apply the paths viewpoint to the theory of torus-invariant prime ideals of quantum matrices. We prove a conjecture of Goodearl and Lenagan that all such prime ideals, when the quantum parameter q is a non-root of unity, have generating sets consisting of quantum minors. Previously, this result was known to hold only for char(K)=0 and q transcendental over Q. Our strategy is to show that the quantum minors in a given torus-invariant ideal form a Grobner basis.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.