Related papers: Regular CW-complexes and poset resolutions of mono…
For a monomial ideal $I$ of a polynomial ring $S$, a "polarization" of $I$ is a \textit{squarefree} monomial ideal $J$ of a larger polynomial ring $S'$ such that $S/I$ is a quotient of $S'/J$ by a regular sequence (consisting of degree 1…
In this paper,we introduce the monomial ideals I(H) associated to a special class of non uniform hypergraphs H(X; E; d) namely uniformly increasing hypergraphs. These ideals are named as inclusion ideals. In this paper, we discuss some…
We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple…
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 provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…
A symmetric chain of ideals is a rule that assigns to each finite set $S$ an ideal $I_S$ in the polynomial ring $\mathbb{C}[x_i]_{i \in S}$ such that if $\phi \colon S \to T$ is an embedding of finite sets then the induced homomorphism…
We introduce two polynomials (in $q$) associated with a finite poset $P$ that encode some information on the covering relation in $P$. If $P$ is a distributive lattice, and hence $P$ is isomorphic to the poset of dual order ideals in a…
Given a collection of $t$ subspaces in an $n$-dimensional $\mathbb{K} $-vector space $W$ we can associate to them $t$ vanishing ideals in the symmetric algebra $\mathcal{S}(W^*) = \mathbb{K}[x_1,x_2,\dots,x_n]$. As a subspace is defined by…
We describe a natural topological generalization of edge expansion for graphs to regular CW complexes and prove that this property holds with high probability for certain random complexes.
In this article we first compare the set of elements in the socle of an ideal of a polynomial algebra $K[x_1,\ldots,x_d]$ over a field $K$ that are not in the ideal itself and Macaulay's inverse systems of such polynomial algebras in a…
In this paper, we show for a monomial ideal $I$ of $K[x_1,x_2,\ldots,x_n]$ that the integral closure $\ol{I}$ is a monomial ideal of Borel type (Borel-fixed, strongly stable, lexsegment, or universal lexsegment respectively), if $I$ has the…
We present a method to compute integral cohomology of posets. This toolbox is applicable as soon as the sub-posets under each object possess certain structure. This is the case for simplicial complexes and simplex-like posets. The method is…
We give a necessary and sufficient condition on a homogeneous polynomial ideal for its Taylor complex to be exact. Then we give a combinatorial construction of a minimal resolution for ideals satisfying the above condition (in particular…
A cosheaf is the dual notion of a sheaf, but we cannot define its homology as the formal dual of sheaf cohomology, in general, because of the lack of the cosheafification. A cellular cosheaf is a contravariant functor from the face poset of…
We present a procedure that constructs, in a combinatorial manner, a chain complex of free modules over a polynomial ring in finitely many variables, modulo an ideal generated by quadratic monomials. Applying this procedure to two specific…
For a monomial ideal $I$, let $G(I)$ be its minimal set of monomial generators. If there is a total order on $G(I)$ such that the corresponding Lyubeznik resolution of $I$ is a minimal free resolution of $I$, then $I$ is called a Lyubeznik…
To a digraph with a choice of certain integral basis, we construct a CW complex, whose integral singular cohomology is canonically isomorphic to the path cohomology of the digraph as introduced in \cite{GLMY}. The homotopy type of the CW…
We consider ideals in a polynomial ring that are generated by regular sequences of homogeneous polynomials and are stable under the action of the symmetric group permuting the variables. In previous work, we determined the possible…
Let (P,<) be a finite poset and let G be its comparability graph. If cl(G) is the clutter of maximal cliques of G, we prove that cl(G) satisfies the max-flow min-cut property and that its edge ideal is normally torsion free. We prove that…
We generalize an algorithm by Goward for principalization of monomial ideals in nonsingular varieties to work on any scheme of finite type over a field. The normal crossings condition considered by Goward is weakened to the condition that…