Search arXiv⌕ Search

arXiv · 2608.29981

Recovering Laplacian Lattices from $L$-Functions of Graphs

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel Labib, Antonio Lei. 2026-08-30. Recovering Laplacian Lattices from $L$-Functions of Graphs. https://arxiv.org/abs/2608.29981

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗