Recovering Laplacian Lattices from L-Functions of Graphs
Daniel Labib, Antonio Lei
Abstract
We introduce L-functions associated with characters of the Jacobian of a finite graph, as a graph-theoretic analogue of the L-functions arising from unramified coverings of algebraic curves. These L-functions are defined using the Riemann--Roch structure on the graph and extend Lorenzini's two-variable zeta function. We show that if two graphs without bridges have isomorphic Jacobians and their L-functions agree under the induced correspondence of characters, then their Laplacian lattices coincide. We also show that Lorenzini's zeta function is invariant under contraction of bridges, explaining the necessity of the bridge-free hypothesis in the main theorem. Finally, we give examples showing that neither the Jacobian nor the Lorenzini zeta function alone determine the Laplacian lattice.
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato