اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNormaliz 2013-2016
44
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this article we describe mathematically relevant extensions to Normaliz that were added to it during the support by the DFG SPP Algorithmische und Experimentelle Methoden in Algebra, Geometrie und Zahlentheorie: nonpointed cones, rational polyhedra, homogeneous systems of parameters, bottom decomposition, class groups and systems of module generators of integral closures.
قيم البحث
اقرأ أيضاً
The Springer variety is the set of flags stabilized by a nilpotent operator. In 1976, T.A. Springer observed that this varietys cohomology ring carries a symmetric group action, and he offered a deep geometric construction of this action. Sixteen yea
rs later, Garsia and Procesi made Springers work more transparent and accessible by presenting the cohomology ring as a graded quotient of a polynomial ring. They combinatorially describe an explicit basis for this quotient. The goal of this paper is to generalize their work. Our main result deepens their analysis of Springer varieties and extends it to a family of varieties called Hessenberg varieties, a two-parameter generalization of Springer varieties. Little is known about their cohomology. For the class of regular nilpotent Hessenberg varieties, we conjecture a quotient presentation for the cohomology ring and exhibit an explicit basis. Tantalizing new evidence supports our conjecture for a subclass of regular nilpotent varieties called Peterson varieties.
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.
In this article, we study the weak and strong Lefschetz properties, and the related notion of almost revlex ideal, in the non-Artinian case, proving that several results known in the Artinian case hold also in this more general setting. We then apply
the obtained results to the study of the Jacobian algebra of hyperplane arrangements.
The $q,t$-Catalan numbers can be defined using rational functions, geometry related to Hilbert schemes, symmetric functions, representation theory, Dyck paths, partition statistics, or Dyck words. After decades of intensive study, it was eventually p
roved that all these definitions are equivalent. In this paper, we study the similar situation for higher $q,t$-Catalan numbers, where the equivalence of the algebraic and combinatorial definitions is still conjectural. We compute the limits of sever
We show that the deletion theorem of a free arrangement is combinatorial, i.e., whether we can delete a hyperplane from a free arrangement keeping freeness depends only on the intersection lattice. In fact, we give an explicit sufficient and necessar
y condition for the deletion theorem in terms of characteristic polynomials. This gives a lot of corollaries including the existence of free filtrations. The proof is based on the result about the form of minimal generators of a logarithmic derivation module of a multiarrangement which satisfies the $b_2$-equality.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
