Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCellular resolutions of cointerval ideals
122
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Minimal cellular resolutions of the edge ideals of cointerval hypergraphs are constructed. This class of d-uniform hypergraphs coincides with the complements of interval graphs (for the case d=2), and strictly contains the class of `strongly stable hypergraphs corresponding to pure shifted simplicial complexes. The polyhedral complexes supporting the resolutions are described as certain spaces of directed graph homomorphisms, and are realized as subcomplexes of mixed subdivisions of the Minkowski sums of simplices. Resolutions of more general hypergraphs are obtained by considering decompositions into cointerval hypergraphs.
rate research
Read More
One can iteratively obtain a free resolution of any monomial ideal $I$ by considering the mapping cone of the map of complexes associated to adding one generator at a time. Herzog and Takayama have shown that this procedure yields a minimal resolution if $I$ has linear quotients, in which case the mapping cone in each step cones a Koszul complex onto the previously constructed resolution. Here we consider cellular realizations of these resolutions. Extending a construction of Mermin we describe a regular CW-complex that supports the resolutions of Herzog and Takayama in the case that $I$ has a `regular decomposition function. By varying the choice of chain map we recover other known cellular resolutions, including the `box of complexes resolutions of Corso, Nagel, and Reiner and the related `homomorphism complex resolutions of Dochtermann and Engstrom. Other choices yield combinatorially distinct complexes with interesting structure, and suggests a notion of a `space of cellular resolutions.
An explicit combinatorial minimal free resolution of an arbitrary monomial ideal $I$ in a polynomial ring in $n$ variables over a field of characteristic $0$ is defined canonically, without any choices, using higher-dimensional generalizations of combined spanning trees for cycles and cocycles (hedges) in the upper Koszul simplicial complexes of $I$ at lattice points in $mathbb{Z}^n$. The differentials in these sylvan resolutions are expressed as matrices whose entries are sums over lattice paths of weights determined combinatorially by sequences of hedges (hedgerows) along each lattice path. This combinatorics enters via an explicit matroidal expression for the Moore-Penrose pseudoinverses of the differentials in any CW complex as weighted averages of splittings defined by hedges. This Hedge Formula also yields a projection formula from CW chains to boundaries. The translation from Moore-Penrose combinatorics to free resolutions relies on Wall complexes, which construct minimal free resolutions of graded ideals from vertical splittings of Koszul bicomplexes. The algebra of Wall complexes applied to individual hedgerows yields explicit but noncanonical combinatorial minimal free resolutions of arbitrary monomial ideals in any characteristic.
We compute the Betti numbers for all the powers of initial and final lexsegment edge ideals. For the powers of the edge ideal of an anti-$d-$path, we prove that they have linear quotients and we characterize the normally torsion-free ideals. We determine a class of non-squarefree ideals, arising from some particular graphs, which are normally torsion-free.
This paper is concerned with the question of whether geometric structures such as cell complexes can be used to simultaneously describe the minimal free resolutions of all powers of a monomial ideal. We provide a full answer in the case of square-free monomial ideals of projective dimension one, by introducing a combinatorial construction of a family of (cubical) cell complexes whose 1-skeletons are powers of a graph that supports the resolution of the ideal.
We determine the Castelnuovo-Mumford regularity of binomial edge ideals of complement reducible graphs (cographs). For cographs with $n$ vertices the maximum regularity grows as $2n/3$. We also bound the regularity by graph theoretic invariants and construct a family of counterexamples to a conjecture of Hibi and Matsuda.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
