pith. sign in

arxiv: 2605.30781 · v1 · pith:5TO3XDURnew · submitted 2026-05-29 · 🧮 math.CO · cs.DM· math.AC

The NF-operator and the NF-Numbers of Simplicial Complexes

classification 🧮 math.CO cs.DMmath.AC
keywords bigtriangleupnf-numberdeltamathcalcomplexequalsgraphsnf-operator
0
0 comments X
read the original abstract

Let $\bigtriangleup$ be a simplicial complex and let $\delta_{\mathcal{NF}}$ denote the NF-operator. The NF-complex $\delta_{\mathcal{NF}}(\bigtriangleup)$ is defined as the Stanley--Reisner complex of the facet ideal of $\bigtriangleup$. Iterating $\delta_{\mathcal{NF}}$ gives a periodic orbit (up to isomorphism), and the smallest positive integer $t$ for which $\delta_{\mathcal{NF}}^{\,t}(\bigtriangleup)\cong \bigtriangleup$ is called the \emph{NF-number} of $\bigtriangleup$ (Habi and Mahmood, Algebra Colloquium, 2022). In this work, we provide various results and determine explicit formulas for the NF-number for several families of graphs. In particular, we compute the NF-number for dumbbell graphs. We also prove that the NF-number of the complete split graph $S_{n,m}$ equals $m+n+2$, and that the NF-number of the double star $D_{p+q}$ equals $p+q+4$. We conclude with remarks, open problems, and conjectures to guide future research.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.