4 papers
Dynamical Quantum Multigraphs
Kassahun H. Betre, Nathan Lewis
Motivated by applications in background-independent quantum gravity, we discuss the quantization of labeled and unlabeled finite multigraphs with a maximum edge count. We provide a…
Pure Simplicial and Clique Complexes with a Fixed Number of Facets
Kassahun H Betre, Yan X Zhang, Carter Edmond
We study structural and enumerative aspects of pure simplicial complexes and clique complexes. We prove a necessary and sufficient condition for any simplicial complex to be a cliq…
The Inductive Graph Dimension from The Minimum Edge Clique Cover
Kassahun Betre, Evatt Salinger
In this paper we prove that the inductively defined graph dimension has a simple additive property under the join operation. The dimension of the join of two simple graphs is one p…
The Inductive Graph Dimension from The Minimum Edge Clique Cover
Kassahun Betre, Evatt Salinger
In this paper we prove that the recursive (Knill) dimension of the join of two graphs has a simple formula in terms of the dimensions of the component graphs: $\mathrm{dim\,} (G_1+…