TY - JOUR
T1 - Hilbert band complexes and their applications
AU - Zhang, Zeying
AU - Zhao, Y. X.
AU - Yao, Yugui
AU - Yang, Shengyuan A.
N1 - Publisher Copyright:
© 2025 American Physical Society.
PY - 2025/2/15
Y1 - 2025/2/15
N2 - The study of band connectivity is a fundamental problem in condensed matter physics. Here, we develop a method for analyzing band connectivity, which completely solves the outstanding questions of the reducibility and decomposition of band complexes. By translating the symmetry conditions into a set of band balance equations, we show that all possible band structure solutions can be described by a positive affine monoid structure, which has a unique minimal set of generators, called Hilbert basis. We show that Hilbert basis completely determines whether a band complex is reducible and how it can be decomposed. The band complexes corresponding to Hilbert basis vectors, termed as Hilbert band complexes (HBCs), can be regarded as elementary building blocks of band structures. We develop algorithms to construct HBCs, analyze their graph features, and merge them into large complexes. We find some interesting examples, such as HBCs corresponding to complete bipartite graphs, and complexes that can grow without bound by successively merging a HBC.
AB - The study of band connectivity is a fundamental problem in condensed matter physics. Here, we develop a method for analyzing band connectivity, which completely solves the outstanding questions of the reducibility and decomposition of band complexes. By translating the symmetry conditions into a set of band balance equations, we show that all possible band structure solutions can be described by a positive affine monoid structure, which has a unique minimal set of generators, called Hilbert basis. We show that Hilbert basis completely determines whether a band complex is reducible and how it can be decomposed. The band complexes corresponding to Hilbert basis vectors, termed as Hilbert band complexes (HBCs), can be regarded as elementary building blocks of band structures. We develop algorithms to construct HBCs, analyze their graph features, and merge them into large complexes. We find some interesting examples, such as HBCs corresponding to complete bipartite graphs, and complexes that can grow without bound by successively merging a HBC.
UR - http://www.scopus.com/inward/record.url?scp=85218943327&partnerID=8YFLogxK
U2 - 10.1103/PhysRevB.111.075154
DO - 10.1103/PhysRevB.111.075154
M3 - Article
AN - SCOPUS:85218943327
SN - 2469-9950
VL - 111
JO - Physical Review B
JF - Physical Review B
IS - 7
M1 - 075154
ER -