A Graph Theoretic Method for Determining Generating Sets of Prime Ideals in Quantum Matrices
Quantum Algebra
2010-09-15 v2 Combinatorics
Abstract
We take a graph theoretic approach to the problem of finding generators for those prime ideals of which are invariant under the torus action (. Launois \cite{launois3} has shown that the generators consist of certain quantum minors of the matrix of canonical generators of and in \cite{launois2} gives an algorithm to find them. In this paper we modify a classic result of Lindstr\"{o}m \cite{lind} and Gessel-Viennot~\cite{gv} to show that a quantum minor is in the generating set for a particular ideal if and only if we can find a particular set of vertex-disjoint directed paths in an associated directed graph.
Keywords
Cite
@article{arxiv.0907.1617,
title = {A Graph Theoretic Method for Determining Generating Sets of Prime Ideals in Quantum Matrices},
author = {Karel Casteels},
journal= {arXiv preprint arXiv:0907.1617},
year = {2010}
}
Comments
29 pages, 9 figures