Search arXivSearch

arXiv · 2010.14474

Standard monomials of $1$-skeleton ideals of multigraphs

Abstract

Given a graph $G$ on the vertex set $\{0,1,\ldots,n\}$ with the root vertex $0$, Postnikov and Shapiro associated a monomial ideal $\mathcal{M}_G$ in the polynomial ring $R=\mathbb{K}[x_1,\ldots,x_n]$ over a field $\mathbb{K}$ such that $\dim_{\mathbb{K}}(R/\mathcal{M}_G)=\det\widetilde L_G$, where $\widetilde L_G$ is the truncated Laplacian of $G$. Dochtermann introduced the $1$-skeleton ideal $\mathcal{M}_G^{(1)}$ of $\mathcal{M}_G$ which satisfies the property that $\dim_{\mathbb{K}}(R/\mathcal{M}_G^{(1)})\ge\det\widetilde Q_G$, where $\widetilde Q_G$ is the truncated signless Laplacian of $G$. In this paper we characterize all subgraphs of the multigraph $K_{n+1}^{a,1}$, in particular all simple graphs $G$, such that $\dim_{\mathbb{K}}(R/\mathcal{M}_G^{(1)})=\det\widetilde Q_G$. Moreover, we give examples of subgraphs $G$ of the complete multigraph $K_{n+1}^{a,b}$, in which the equality $\dim_{\mathbb{K}}(R/\mathcal{M}_G^{(1)})=\det\widetilde Q_G$ holds. We also provide a conjecture on the structure of a general multigraph satisfying the above-mentioned equality.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amit Roy. 2023-03-06. Standard monomials of $1$-skeleton ideals of multigraphs. https://doi.org/10.1007/s13226-025-00862-x

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