Search arXivSearch

arXiv · 2007.01521

Balanced squeezed Complexes

Abstract

Given any order ideal $U$ consisting of color-squarefree monomials involving variables with $d$ colors, we associate to it a balanced $(d-1)$-dimensional simplicial complex $Δ_{\mathrm{bal}}(U)$ that we call a balanced squeezed complex. In fact, these complexes have properties similar to squeezed balls as introduced by Kalai and the more general squeezed complexes, introduced by the authors. We show that any balanced squeezed complex is vertex-decomposable and that its flag $h$-vector can be read off from the underlying order ideal. Moreover, we describe explicitly its Stanley-Reisner ideal $I_{Δ_{\mathrm{bal}}(U)}$. If $U$ is also shifted, we determine the multigraded generic initial ideal of $I_{Δ_{\mathrm{bal}}(U)}$ and establish that the balanced squeezed complex $Δ_{\mathrm{bal}}(U)$ has the same graded Betti numbers as the complex obtained from color-shifting it. We also introduce a class of color-squarefree monomial ideals that may be viewed as a generalization of the classical squarefree stable monomial ideals and show that their graded Betti numbers can be read off from their minimal generators. Moreover, we develop some tools for computing graded Betti numbers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Martina Juhnke-Kubitzke, Uwe Nagel. 2020-07-03. Balanced squeezed Complexes. https://arxiv.org/abs/2007.01521

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

KEEP EXPLORING

Related papers

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

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO