Quasi f-Simplicial Complexes and Quasi f-Graphs
Hasan Mahmood, Fazal Ur Rehman, Thai Thanh Nguyen, Muhammad Ahsan, Binyamin

TL;DR
This paper introduces quasi f-simplicial complexes and quasi f-graphs, expanding the concept of f-ideals, and provides characterizations, connectedness criteria, and Cohen-Macaulay constructions for these structures.
Contribution
It generalizes the notion of f-ideals to quasi f-ideals, introduces quasi f-simplicial complexes and graphs, and offers characterizations and construction methods for Cohen-Macaulay cases.
Findings
Characterization of quasi f-graphs on n vertices
Complete solution for connectedness of quasi f-simplicial complexes
Method for constructing Cohen-Macaulay quasi f-graphs
Abstract
The notion of -ideal is recent and has so far been studied in several papers. In \cite{qfi}, the idea of -ideal is generalized to quasi -ideals, which is much larger class than the class of -ideals. In this paper, we introduce the concept of quasi -simplicial complex and quasi -graph. We give a characterization of quasi -graphs on vertices. A complete solution of connectedness of quasi -simplicial complexes is described. We have also shown a method of constructing Cohen-Macaulay quasi -graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Topological and Geometric Data Analysis · Advanced Combinatorial Mathematics
