اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA test for monomial containment
240
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present an algorithm to decide whether a given ideal in the polynomial ring contains a monomial without using Grobner bases, factorization or sub-resultant computations.
قيم البحث
اقرأ أيضاً
In this paper we study the equations of the elimination ideal associated with $n+1$ generic multihomogeneous polynomials defined over a product of projective spaces of dimension $n$. We first prove a duality property and then make this duality explic
it by introducing multigraded Sylvester forms. These results provide a partial generalization of similar properties that are known in the setting of homogeneous polynomial systems defined over a single projective space. As an important consequence, we derive a new family of elimination matrices that can be used for solving zero-dimensional multiprojective polynomial systems by means of linear algebra methods.
Let $k$ be an arbitrary field. In this note, we show that if a sequence of relatively prime positive integers ${bf a}=(a_1,a_2,a_3,a_4)$ defines a Gorenstein non complete intersection monomial curve ${mathcal C}({bf a})$ in ${mathbb A}_k^4$, then the
re exist two vectors ${bf u}$ and ${bf v}$ such that ${mathcal C}({bf a}+t{bf u})$ and ${mathcal C}({bf a}+t{bf v})$ are also Gorenstein non complete intersection affine monomial curves for almost all $tgeq 0$.
Scattered over the past few years have been several occurrences of simplicial complexes whose topological behavior characterize the Cohen-Macaulay property for quotients of polynomial rings by arbitrary (not necessarily squarefree) monomial ideals. T
he purpose of this survey is to gather the developments into one location, with self-contained proofs, including direct combinatorial topological connections between them.
We study a monomial derivation $d$ proposed by J. Moulin Ollagnier and A. Nowicki in the polynomial ring of four variables, and prove that $d$ has no Darboux polynomials if and only if $d$ has a trivial field of constants.
In this paper we develop a new technique to compute the Betti table of a monomial ideal. We present a prototype implementation of the resulting algorithm and we perform numerical experiments suggesting a very promising efficiency. On the way of descr
ibing the method, we also prove new constraints on the shape of the possible Betti tables of a monomial ideal.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
