Search arXivSearch

arXiv · 1509.08275

Betti posets and the Stanley depth

Abstract

Let $S$ be a polynomial ring and let $I \subseteq S$ be a monomial ideal. In this short note, we propose the conjecture that the Betti poset of $I$ determines the Stanley projective dimension of $S/I$ or $I$. Our main result is that this conjecture implies the Stanley conjecture for $I$, and it also implies that \[ \operatorname{sdepth} S/I \geq \operatorname{depth} S/I - 1.\] Recently, Duval et al. found a counterexample to the Stanley conjecture, and their counterexample satisfies $\operatorname{sdepth} S/I = \operatorname{depth} S/I - 1$. So if our conjecture is true, then the conclusion is best possible.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lukas Katthän. 2016-02-05. Betti posets and the Stanley depth. https://doi.org/10.1007/s40598-016-0039-5

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO