Nodal domain theorem of signed hypergraphs

Abstract

In 2001, Davies, Gladwell, Leydold, and Stadler proved discrete nodal domain theorems for eigenfunctions of generalized Laplacians. In 2019, Jost and Mulas generalized the normalized combinatorial Laplace operator of graphs to signed hypergraphs. In this paper, we establish nodal domain theorems for the normalized combinatorial Laplace operator in signed hypergraphs. We also obtain a lower bound estimates for the number of strong nodal domains.

25 pages, 1 figures. arXiv admin note: substantial text overlap with arXiv:2201.00198 by other authors