Pith. sign in

REVIEW

The Green's Function for the H\"uckel (Tight Binding) Model

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1407.4780 v4 pith:P42L4VHW submitted 2014-07-17 math-ph cond-mat.str-elmath.MPquant-ph

classification math-phcond-mat.str-elmath.MPquant-ph
keywords matrixfunctiongreeninversemodeluckelapplicationsbinding
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Applications of the H\"uckel (tight binding) model are ubiquitous in quantum chemistry and solid state physics. The matrix representation of this model is isomorphic to an unoriented vertex adjacency matrix of a bipartite graph, which is also the Laplacian matrix plus twice the identity. In this paper, we analytically calculate the determinant and, when it exists, the inverse of this matrix in connection with the Green's function, $\mathbf{G}$, of the $N\times N$ H\"uckel matrix. A corollary is a closed form expression for a Harmonic sum (Eq. 12). We then extend the results to $d-$dimensional lattices, whose linear size is $N$. The existence of the inverse becomes a question of number theory. We prove a new theorem in number theory pertaining to vanishing sums of cosines and use it to prove that the inverse exists if and only if $N+1$ and $d$ are odd and $d$ is smaller than the smallest divisor of $N+1$. We corroborate our results by demonstrating the entry patterns of the Green's function and discuss applications related to transport and conductivity.

Discussion (0). Continue with ORCID to comment.

Pith tools