نتایج جستجو برای: minimal ideal
تعداد نتایج: 234992 فیلتر نتایج به سال:
Extending the notion of indispensable binomials of a toric ideal ([14], [7]), we define indispensable monomials of a toric ideal and establish some of their properties. They are useful for searching indispensable binomials of a toric ideal and for proving the existence or non-existence of a unique minimal system of binomials generators of a toric ideal. Some examples of indispensable monomials ...
We show that the number of elements generating a squarefree monomial ideal up to radical can always be bounded above in terms of the number of its minimal monomial generators and the maximal height of its minimal primes.
Extending the notion of indispensable binomials of a toric ideal ((14), (7)), we define indispensable monomials of a toric ideal and establish some of their properties. They are useful for searching indispensable binomials of a toric ideal and for proving the existence or non-existence of a unique minimal system of binomials generators of a toric ideal. Some examples of indispensable monomials ...
The use of algorithms in algebra as well as the study of their complexity was initiated before the advent of modern computers. Hermann [25] studied the ideal membership problem, i.e determining whether a given polynomial is in a fixed homogeneous ideal, and found a doubly exponential bound on its computational complexity. Later Mayr and Meyer [31] found examples which show that her bound was ne...
We show the existence of prime divisors computing minimal log discrepancies in positive characteristic except for a special case. Moreover we prove lower semicontinuity smooth varieties if exponent an ideal is less than canonical threshold ideal.
Introduction Let be a Noetherian ring with unity and be a regular ideal of , that is, contains a nonzerodivisor. Let . Then . The :union: of this family, , is an interesting ideal first studied by Ratliff and Rush in [15]. The Ratliff-Rush closure of is defined by . A regular ideal for which is called Ratliff-Rush ideal. The present paper, reviews some of the known prop...
We recall that a ring R is called near pseudo-valuation ring if every minimal prime ideal is a strongly prime ideal. Let R be a commutative ring, σ an automorphism of R and δ a σderivation of R. We recall that a prime ideal P of R is δ-divided if it is comparable (under inclusion) to every σ-invariant and δ-invariant ideal I (i.e. σ(I) ⊆ I and δ(I) ⊆ I) of R. A ring R is called a δ-divided ring...
We discuss the linearity of the minimal free resolution of a power of an edge ideal.
We survey some recent results on the minimal graded free resolution of a square-free monomial ideal. The theme uniting these results is the point-of-view that the generators of a monomial ideal correspond to the maximal faces (the facets) of a simplicial complex ∆. This correspondence gives us a new method, distinct from the Stanley-Reisner correspondence, to associate to a square-free monomial...
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید