اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGroebner bases for spaces of quadrics of codimension 3
138
0
0.0
(
0
)
تأليف
Aldo Conca
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Let $R=oplus_{igeq 0} R_i$ be an Artinian standard graded $K$-algebra defined by quadrics. Assume that $dim R_2leq 3$ and that $K$ is algebraically closed of characteristic $ eq 2$. We show that $R$ is defined by a Grobner basis of quadrics with, essentially, one exception. The exception is given by $K[x,y,z]/I$ where $I$ is a complete intersection of 3 quadrics not containing the square of a linear form.
قيم البحث
اقرأ أيضاً
In this paper we introduce a new and large family of configurations whose toric ideals possess quadratic Groebner bases. As an application, a generalization of algebras of Segre-Veronese type will be studied.
A set of polynomials G in a polynomial ring S over a field is said to be a universal Gru007foebner basis, if G is a Gru007foebner basis with respect to every term order on S. Twenty years ago Bernstein, Sturmfels, and Zelevinsky proved that the set o
f the maximal minors of a matrix X of variables is a universal Gru007foebner basis. Boocher recently proved that any initial ideal of the ideal of maximal minors of X has a linear resolution. In this paper we give a quick proof of the results mentioned above. Our proof is based on a specialization argument. Then we show that similar statements hold in a more general setting, for matrices of linear forms satisfying certain homogeneity conditions. More precisely, we show that the set of maximal minors of a matrix L of linear forms is a universal Gru007foebner basis for the ideal I that it generates, provided that L is column-graded. Under the same assumption we show that every initial ideal of I has a linear resolution. Furthermore, the projective dimension of I and of its initial ideals is n-m, unless I=0 or a column of L is identically 0. Here L is a matrix of size m times n, and m is smaller than or equal to n. If instead L is row-graded, then we prove that I has a universal Gru007foebner basis of elements of degree m and that every initial ideal of I has a linear resolution, provided that I has the expected codimension. The proofs are based on a rigidity property of radical Borel fixed ideals in a multigraded setting: We prove that if two Borel fixed ideals I and J have the same multigraded Hilbert series and I is radical, then I = J. We also discuss some of the consequences of this rigidity property.
We present an algorithm for computing Groebner bases of vanishing ideals of points that is optimized for the case when the number of points in the associated variety is less than the number of indeterminates. The algorithm first identifies a set of e
ssential variables, which reduces the time complexity with respect to the number of indeterminates, and then uses PLU decompositions to reduce the time complexity with respect to the number of points. This gives a theoretical upper bound for its time complexity that is an order of magnitude lower than the known one for the standard Buchberger-Moeller algorithm if the number of indeterminates is much larger than the number of points. Comparison of implementations of our algorithm and the standard Buchberger-Moeller algorithm in Macaulay 2 confirm the theoretically predicted speedup. This work is motivated by recent applications of Groebner bases to the problem of network reconstruction in molecular biology.
We present a survey on the developments related to Groebner bases, and show explicit examples in CoCoA. The CoCoA project dates back to 1987: its aim was to create a mathematician-friendly computational laboratory for studying Commutative Algebra, mo
st especially Groebner bases. Always maintaining this friendly tradition, the project has grown and evolved, and the software has been completely rewritten. CoCoA offers Groebner bases for all levels of interest: from the basic, explicit call in the interactive system CoCoA-5, to problem-specific optimized implementations, to the computer--computer communication with the open source C++ software library, CoCoALib, or the prototype OpenMath-based server. The openness and clean design of CoCoALib and CoCoA-5 are intended to offer different levels of usage, and to encourage external contributions.
The purpose of this paper is twofold. In the first part we concentrate on hyperplane sections of algebraic schemes, and present results for determining when Grobner bases pass to the quotient and when they can be lifted. The main difficulty to overco
me is the fact that we deal with non-homogeneous ideals. As a by-product we hint at a promising technique for computing implicitization efficiently. In the second part of the paper we deal with families of algebraic schemes and the Hough transforms, in particular we compute their dimension, and show that in some interesting cases it is zero. Then we concentrate on their hyperplane sections. Some results and examples hint at the possibility of reconstructing external and internal surfaces of human organs from the parallel cross-sections obtained by tomography.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
