The NF-Number of a Simplicial Complex

DOI10.1142/S1005386722000451MaRDI QIDQ5056818zbMATH OpenOpenAlexFDO

Authors Takayuki Hibi, Hasan Mahmood

Publication date 8 December 2022

Published in Algebra Colloquium (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.01247

zbMATH Keywords

facet idealsimplicial complexStanley-Reisner complexvertex cover

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)

Abstract: Let $Delta$ be a simplicial complex on $[n]$. The $mathcalNmathcalF$-complex of $Delta$ is the simplicial complex $delt{a}_{mathcalNmathcalF}(Delta)$ on $[n]$ for which the facet ideal of $Delta$ is equal to the Stanley--Reisner ideal of $delt{a}_{mathcalNmathcalF}(Delta)$. Furthermore, for each $k=2,3,ldots$,, we introduce {em $k^{th}$ $mathcalNmathcalF$-complex} $delt{a}_{mathcalNmathcalF}^{(k)}(Delta)$ which is inductively defined by $delt{a}_{mathcalNmathcalF}^{(k)}(Delta)=delt{a}_{mathcalNmathcalF}(delt{a}_{mathcalNmathcalF}^{(k-1)}(Delta))$ with setting $delt{a}_{mathcalNmathcalF}^{(1)}(Delta)=delt{a}_{mathcalNmathcalF}(Delta)$. One can set $delt{a}_{mathcalNmathcalF}^{(0)}(Delta)=Delta$. The $mathcalNmathcalF$-number of $Delta$ is the smallest integer $k>0$ for which $delt{a}_{mathcalNmathcalF}^{(k)}(Delta)simeqDelta$. In the present paper we are especially interested in the $mathcalNmathcalF$-number of a finite graph, which can be regraded as a simplicial complex of dimension one. It is shown that the $mathcalNmathcalF$-number of the finite graph $K_{n}coprod{K}_m$ on $[n+m]$, which is the disjoint union of the complete graphs $K_n$ on $[n]$ and $K_m$ on $[m]$, where $ngeq2$ and $mgeq2$ with $(n,m)eq(2,2)$, is equal to $n+m+2$. Its corollary says that the $mathcalNmathcalF$-number of the complete bipartite graph $K_{n,m}$ on $[n+m]$ is also equal to $n+m+2$.

Recommendations

• The \(\mathcal{NF}\)-number of two complete graphs joined by a common vertex
• Complexes of graphs with bounded matching size
• SPANNING SIMPLICIAL COMPLEXES OF n-CYCLIC GRAPHS WITH A COMMON VERTEX
• Spanning simplicial complexes of n-cyclic graphs with a common edge
• scientific article; zbMATH DE number 409491

Cited in

(2)

• The \(\mathcal{NF}\)-number of two complete graphs joined by a common vertex
• Expected \(\mathcal{NF}\)-number of disjoint union of finite copies of complete graph

This page was built for publication: The NF-Number of a Simplicial Complex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056818)