اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدHyperplane Sections, Groebner Bases, and Hough Transforms
186
0
0.0
(
0
)
تأليف
Lorenzo Robbiano
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 overcome 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.
قيم البحث
اقرأ أيضاً
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.
We describe the universal Groebner basis of the ideal of maximal minors and the ideal of $2$-minors of a multigraded matrix of linear forms. Our results imply that the ideals are radical and provide bounds on the regularity. In particular, the ideals
of maximal minors have linear resolutions. Our main theoretical contribution consists of introducing two new classes of ideals named after Cartwright and Sturmfels, and proving that they are closed under multigraded hyperplane sections. The gins of the ideals that we study enjoy special properties.
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.
Hara, Takemura and Yoshida discuss toric ideals arising from two way subtable sum problems and shows that these toric ideals are generated by quadratic binomials if and only if the subtables are either diagonal or triangular. In the present paper, we
show that if the subtables are either diagonal or triangular, then their toric ideals possess quadratic Groebner bases.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
