Results 41 to 50 of about 887,096 (204)
Monomial ideals via square-free monomial ideals [PDF]
Corrected Statement of Corollary 2.6 (took one statement out)
openaire +3 more sources
On Characteristic Poset and Stanley Decomposition
Let J ⊂ I be two monomial ideals such that I/J is Cohen Macaulay. By associating a finite posets PI/Jg$P_{I/J}^g$ to I/J, we show that if I/J is a Stanley ideal then I/J˜$\widetilde{I/J}$ is also a Stanley ideal, where I/J˜$\widetilde{I/J}$ is the ...
Ahmad Sarfraz +2 more
doaj +1 more source
When Is a Graded Free Complex Exact?
Minimal free resolutions of a finitely generated module over a polynomial ring S=k[x], with variables x={x1,…,xn} and a field k have been extensively studied.
David C. Molano +2 more
doaj +1 more source
Stanley depth and size of a monomial ideal
Lyubeznik introduced the concept of size of a monomial ideal and showed that the size of a monomial ideal increased by 1 1 is a lower bound for its depth.
Jürgen Herzog +2 more
core +1 more source
Cohen-Macaulay and (S2) Properties of the Second Power of Squarefree Monomial Ideals
We show that Cohen-Macaulay and (S 2 ) properties are equivalent for the second power of an edge ideal. We give an example of a Gorenstein squarefree monomial ideal I such that S / I 2 satisfies the Serre condition (S 2 ), but is ...
Do Trong Hoang +2 more
doaj +1 more source
COMPUTING RATIONAL POWERS OF MONOMIAL IDEALS [PDF]
This paper concerns fractional powers of monomial ideals. Rational powers of a monomial ideal generalize the integral closure operation as well as recover the family of symbolic powers.
LIM, JOSIAH +7 more
core
Normality Criteria for Monomial Ideals
In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters and their ideals of covers.
Luis A. Dupont +2 more
openaire +2 more sources
Derivations preserving a monomial ideal
Let I be a monomial ideal in a polynomial ring A = k[x1, . . . ,xn] over a field k of characteristic 0, TA/k(I) be the module of I-preserving k-derivations on A and G be the n-dimensional algebraic torus on k.
Tadesse, Yohannes,, Yohannes Tadesse
core +1 more source
Algebraic Algorithms for Even Circuits in Graphs
We present an algebraic algorithm to detect the existence of and to list all indecomposable even circuits in a given graph. We also discuss an application of our work to the study of directed cycles in digraphs.
Huy Tài Hà, Susan Morey
doaj +1 more source
In 1974, the author proved that the codimension of the ideal (g1,g2,…,gd) generated in the group algebra K[Zd] over a field K of characteristic 0 by generic Laurent polynomials having the same Newton polytope Γ is equal to d!×Volume(Γ).
Anatoly Kushnirenko
doaj +1 more source

