相关论文: A generalization of the Taylor complex constructio…
Let $I\supsetneq J$ be two squarefree monomial ideals of a polynomial algebra over a field. Suppose that $I$ is generated by one squarefree monomial of degree $ d>0$, and other squarefree monomials of degrees $\geq d+1$. If the Stanley…
When a monomial ideal has linear quotients with respect to an admissible order of increasing support-degree, we provide two proofs of different flavors to show that it is componentwise support-linear. We also introduce the variable…
We prove a duality theorem for simplicial complexes arising from a combinatorial construction we define, which applies to the squarefree monomial complexes for Veronese ideals of projective spaces and weighted projective spaces. Our theorem…
We introduce the notions of mixed resolutions and simplicial sections, and prove a theorem relating them. This result is used (in another paper) to study deformation quantization in algebraic geometry.
We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a combinatorial method to determine if an ideal is a…
We construct a commutative version of the group ring and show that it allows one to translate questions about the normal generation of groups into questions about the generation of ideals in commutative rings. We demonstrate this with an…
In this paper, basic properties of monomial difference ideals are studied. We prove the finitely generated property of well-mixed difference ideals generated by monomials. Furthermore, a finite prime decomposition of radical well-mixed…
It is known that the chain complex of a simplex on $q$ vertices can be used to construct a free resolution of any ideal generated by $q$ monomials, and as a direct result, the Betti numbers always have binomial upper bounds, given by the…
A translation into English of Winfried Bruns' article: "Jede" endliche freie Aufl\"osung ist freie Aufl\"osung eines von drei Elementen erzeugten Ideals' (published in J. Algebra 39, 429-439 (1976))
Given an ideal $\mathcal I$ on a variety $X$ with toroidal singularities, we produce a modification $X' \to X$, functorial for toroidal morphisms, making the ideal monomial on a toroidal stack $X'$. We do this by adapting the methods of…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
We construct a free resolution of $R/I^s$ over $R$ where $I\ideal R$ is generated by a (finite or infinite) regular sequence. This generalizes the Koszul complex for the case $s=1$. For $s>1$, we easily deduce that the algebra structure of…
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…
Linear resolutions and the stronger notion of linear quotients are important properties of monomial ideals. In this paper, we fully characterize linear quotients in terms of the lcm-lattice of monomial ideals. We also formulate an analogous…
Let $G$ be a group which admits the structure of an iterated semidirect product of finitely generated free groups. We construct a finite, free resolution of the integers over the group ring of $G$. This resolution is used to define…
Using divisibility relations between the generators of a square-free monomial ideal $I$, we describe divisibility relations between the generators of the second power $I^2$. We then employ discrete Morse theory to produce a cellular free…
We give a generalization of Hochster's formula for local cohomologies of square-free monomial ideals to monomial ideals, which are not necessarily square-free. Using this formula, we give combinatorial characterizations of generalized…
We characterize componentwise linear monomial ideals with minimal Taylor resolution and consider the lower bound for the Betti numbers of componentwise linear ideals.
We extend the sortability concept to monomial ideals which are not necessarily generated in one degree and as an application we obtain normal Cohen-Macaulay toric rings attached to vertex cover ideals of graphs. Moreover, we consider a…
We show how to construct a family of groups with simple commutator subgroups from aperiodic 1-vertex, finitely aligned higher rank graphs (which are, in fact, a class of cancellative monoids). Inverse semigroups form the intermediary…