Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0501356

On the multigraded Hilbert and Poincaré-Betti series and the Golod property of monomial rings

Michael Joellenbeck
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the multigraded Poincaré-Betti series of $A=S/\aaf$, where $S$ is the ring of polynomials in $n$ indeterminates divided by the monomial ideal $\aaf$. There is a conjecture about the multigraded Poincaré-Betti series by Charalambous and Reeves which they proved in the case, where the Taylor resolution is minimal. We introduce a conjecture about the minimal $A$-free resolution of the residue class field and show that this conjecture implies the conjecture of Charalambous and Reeves. We prove our conjecture for several classes of algebras. The conjecture implies that $A$ is Golod if and only if the product (i.e. the first Massey operation) on the Koszul homology is trivial. Under the assumption of the conjecture we finally prove that a very simple purely combinatorial condition on the minimal monomial generating system of $\aaf$ implies Golodness for $A$.

Explore related subjects

math.COmath.AC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Joellenbeck. 2005-01-21. On the multigraded Hilbert and Poincaré-Betti series and the Golod property of monomial rings. https://arxiv.org/abs/math/0501356

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗