اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Graph Theoretic Method for Determining Generating Sets of Prime Ideals in Quantum Matrices
219
0
0.0
(
0
)
تأليف
Karel Casteels
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We take a graph theoretic approach to the problem of finding generators for those prime ideals of $mathcal{O}_q(mathcal{M}_{m,n}(mathbb{K}))$ which are invariant under the torus action ($mathbb{K}^*)^{m+n}$. Launois cite{launois3} has shown that the generators consist of certain quantum minors of the matrix of canonical generators of $mathcal{O}_q(mathcal{M}_{m,n}(mathbb{K}))$ 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.
قيم البحث
اقرأ أيضاً
Let $Lsubset mathbb{Z}^n$ be a lattice and $I_L=langle x^{bf u}-x^{bf v}: {bf u}-{bf v}in Lrangle$ be the corresponding lattice ideal in $Bbbk[x_1,ldots, x_n]$, where $Bbbk$ is a field. In this paper we describe minimal binomial generating sets of $I
_L$ and their invariants. We use as a main tool a graph construction on equivalence classes of fibers of $I_L$. As one application of the theory developed we characterize binomial complete intersection lattice ideals, a longstanding open problem in the case of non-positive lattices.
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 Cauchons 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.
We present a combinatorial method to determine the dimension of $C{H}$-strata in the algebra of $mtimes n$ quantum matrices $Oq$ as follows. To a given $C{H}$-stratum we associate a certain permutation via the notion of pipe-dreams. We show that the
dimension of the $C{H}$-stratum is precisely the number of odd cycles in this permutation. Using this result, we are able to give closed formulas for the trivariate generating function that counts the $d$-dimensional $C{H}$-strata in $Oq$. Finally, we extract the coefficients of this generating function in order to settle conjectures proposed by the first and third named authors cite{bldim,bll} regarding the asymptotic proportion of $d$-dimensional $C{H}$-strata in $Oq$.
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of the polyno
mial method and show how the algorithmic theory of polynomial ideals can be used to detect k-colorability, unique Hamiltonicity, and automorphism rigidity of graphs. Our techniques are diverse and involve Nullstellensatz certificates, linear algebra over finite fields, Groebner bases, toric algebra, convex programming, and real algebraic geometry.
The main focus of this paper is on the problem of relating an ideal $I$ in the polynomial ring $mathbb Q[x_1, dots, x_n]$ to a corresponding ideal in $mathbb F_p[x_1,dots, x_n]$ where $p$ is a prime number; in other words, the textit{reduction modulo
$p$} of $I$. We first define a new notion of $sigma$-good prime for $I$ which does depends on the term ordering $sigma$, but not on the given generators of $I$. We relate our notion of $sigma$-good primes to some other similar notions already in the literature. Then we introduce and describe a new invariant called the universal denominator which frees our definition of reduction modulo~$p$ from the term ordering, thus letting us show that all but finitely many primes are good for $I$. One characteristic of our approach is that it enables us to easily detect some bad primes, a distinct advantage when using modular methods.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
