Spectral antisymmetry of twisted graph adjacency
<|reference_start|>Spectral antisymmetry of twisted graph adjacency: We address a prime counting problem across the homology classes of a graph, presenting a graph-theoretical Dirichlet-type analogue of the prime number theorem. The main machinery we have developed and employed is a spectral antisymmetry theorem, revealing that the spectra of the twisted graph adjacency matrices have an antisymmetric distribution over the character group of the graph. Additionally, we derive some trace formulas based on the twisted adjacency matrices as part of our analysis.<|reference_end|>
@article{luo2024spectral,
    title={Spectral antisymmetry of twisted graph adjacency},
    author={Ye Luo, Arindam Roy},
    journal={arXiv preprint arXiv:2403.01550},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.01550},
    primaryClass={math.CO cs.DM math.NT math.SP}
}