Search arXivSearch

arXiv · 2309.04570

A Torelli theorem for graphs via quasistable divisors

Abstract

The Torelli theorem establishes that the Jacobian of a smooth projective curve, together with the polarization provided by the theta divisor, fully characterizes the curve. In the case of nodal curves, there exists a concept known as fine compactified Jacobian. The fine compactified Jacobian of a curve comes with a natural stratification that can be regarded as a poset. Furthermore, this poset is entirely determined by the dual graph of the curve and is referred to as the poset of quasistable divisors on the graph. We present a combinatorial version of the Torelli theorem, which demonstrates that the poset of quasistable divisors of a graph completely determines the biconnected components of the graph (up to contracting separating edges). Moreover, we achieve a natural extension of this theorem to tropical curves.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alex Abreu, Marco Pacini. 2023-09-08. A Torelli theorem for graphs via quasistable divisors. https://doi.org/10.1017/fms.2024.135

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO