Irreducibility of the Dispersion Polynomial for Periodic Graphs

Abstract

We use methods from algebra and discrete geometry to study the irreducibility of the dispersion polynomial of a discrete periodic operator associated to a periodic graph after changing the period lattice. We provide numerous applications of these results to discrete periodic operators associated to families of graphs which include dense periodic graphs, and a family containing the hexagonal and diamond lattices.