اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLaplacian ideals, arrangements, and resolutions
107
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The Laplacian matrix of a graph G describes the combinatorial dynamics of the Abelian Sandpile Model and the more general Riemann-Roch theory of G. The lattice ideal associated to the lattice generated by the columns of the Laplacian provides an algebraic perspective on this recently (re)emerging field. This ideal I_G has a distinguished monomial initial ideal M_G, characterized by the property that the standard monomials are in bijection with the G-parking functions of the graph G. The ideal M_G was also introduced by Postnikov and Shapiro (2004) in the context of monotone monomial ideals. We study resolutions of M_G and show that a minimal free cellular resolution is supported on the bounded subcomplex of a section of the graphical arrangement of G. This generalizes constructions from Postnikov and Shapiro (for the case of the complete graph) and connects to work of Manjunath and Sturmfels, and of Perkinson et al. on the commutative algebra of Sandpiles. As a corollary we verify a conjecture of Perkinson et al. regarding the Betti numbers of M_G, and in the process provide a combinatorial characterization in terms of acyclic orientations.
قيم البحث
اقرأ أيضاً
Given a graph $G$, the $G$-parking function ideal $M_G$ is an artinian monomial ideal in the polynomial ring $S$ with the property that a linear basis for $S/M_G$ is provided by the set of $G$-parking functions. It follows that the dimension of $S/M_
G$ is given by the number of spanning trees of $G$, which by the Matrix Tree Theorem is equal to the determinant of the reduced Laplacian of $G$. The ideals $M_G$ and related algebras were introduced by Postnikov and Shapiro where they studied their Hilbert functions and homological properties. The author and Sanyal showed that a minimal resolution of $M_G$ can be constructed from the graphical hyperplane arrangement associated to $G$, providing a combinatorial interpretation of the Betti numbers. Motivated by constructions in the theory of chip-firing on graphs, we study certain `skeleton ideals $M_G^{(k)} subset M_G$ generated by subsets of vertices of $G$ of size at most $k+1$. Here we focus our attention on the case $k=1$, the $1$-skeleton of the $G$-parking functions ideals. We consider standard monomials of $M_G^{(1)}$ and provide a combinatorial interpretation for the dimension of $S/M_G^{(1)}$ in terms of the signless Laplacian for the case $G = K_{n+1}$ is the complete graph. Our main study concerns homological properties of these ideals. We study resolutions of $M_G^{(1)}$ and show that for a certain class of graphs minimal resolution is supported on decompositions of Euclidean space coming from the theory of tropical hyperplane arrangements. This leads to combinatorial interpretations of the Betti numbers of these ideals.
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 h
ypergraphs 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.
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 com
bined 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.
In this article we prove that the ideal-Shi arrangements are free central arrangements of hyperplanes satisfying the dual-partition formula. Then it immediately follows that there exists a saturated free filtration of the cone of any affine Weyl arra
ngement such that each filter is a free subarrangement satisfying the dual-partition formula. This generalizes the main result in cite{ABCHT} which affirmatively settled a conjecture by Sommers and Tymoczko cite{SomTym}.
Let $I_1,dots,I_n$ be ideals generated by linear forms in a polynomial ring over an infinite field and let $J = I_1 cdots I_n$. We describe a minimal free resolution of $J$ and show that it is supported on a polymatroid obtained from the underlying r
epresentable polymatroid by means of the so-called Dilworth truncation. Formulas for the projective dimension and Betti numbers are given in terms of the polymatroid as well as a characterization of the associated primes. Along the way we show that $J$ has linear quotients. In fact, we do this for a large class of ideals $J_P$, where $P$ is a certain poset ideal associated to the underlying subspace arrangement.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
