Related papers: Torelli theorem for graphs and tropical curves
We give a necessary and sufficient graph-theoretic characterization of toric ideals of graphs that are unimodular. As a direct consequence, we provide the structure of unimodular graphs by proving that the incidence matrix of a graph $G$ is…
This work re-examines a classical construction of a 2-connected (simple) graph where every intermediate graph is 2-connected before detailing an analogous construction for 3-connected graphs which requires a graph equivalence relation…
We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.
We show that the Fourier transform on the Jacobian of a curve interchanges "$\delta$ functions" at the curve and the theta divisor. The Torelli theorem is an immediate consequence.
The deck of a graph $X$, $D(X)$, is defined as the multiset of all vertex-deleted subgraphs of $X$. Two graphs are said to be hypomorphic, if they have the same deck. Kelly-Ulam conjecture states that any two hypomorphic graphs on at least…
We show that two smooth projective curves C_1 and C_2 of genus g which have isomorphic symmetric products are isomorphic unless g=2. This extends a theorem of Martens.
A framework to handle tree decompositions of the components of a Borel graph in a Borel fashion is introduced, along the lines of Tserunyan's Stallings Theorem for equivalence relations arXiv:1805.09506. This setting leads to a notion of…
If a graph can be drawn on the torus so that every two independent edges cross an even number of times, then the graph can be embedded on the torus.
We give a short proof that every finite graph (or matroid) has a tree-decomposition that displays all maximal tangles. This theorem for graphs is a central result of the graph minors project of Robertson and Seymour and the extension to…
We consider three classes of geodesic embeddings of graphs on Euclidean flat tori: (1) A toroidal graph embedding $\Gamma$ is positive equilibrium if it is possible to place positive weights on the edges, such that the weighted edge vectors…
Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…
We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degree of locality. The global structure of the graph, as…
Torelli's theorem is proven by the study of the convolution product of the intersection cohomology sheaf of the thetadivisor.
We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. The study of pure graphs is motivated by two conjectures about the transition systems of eulerian graphs and by the Cycle Double Cover…
We generalise structure tree theory, which is based on removing finitely many edges, to removing finitely many vertices. This gives a significant generalization of Tutte's tree decomposition of 2-connected graphs into 3-connected blocks.…
Robertson and Seymour proved two fundamental theorems about tangles in graphs: the tree-of-tangles theorem, which says that every graph has a tree-decomposition such that distinguishable tangles live in different nodes of the tree, and the…
We compute the automorphism groups of the Torelli complex and the complex of separating curves for all but finitely many compact orientable surfaces. As an application, we show that the abstract commensurators of the Torelli group and the…
We prove an analogue of Clifford's inequality for tropical curves. Next we focus on the hyperelliptic case and we characterize divisors attaining equality. Finally we speculate whether inequality in tropical Clifford's Theorem does imply…
Duality of curves is one of the important aspects of the ``classical'' algebraic geometry. In this paper, using this foundation, the duality of tropical polynomials is constructed to introduce the duality of Non-Archimedean curves. Using…
Tropicalization is a procedure for associating a polyhedral complex in Euclidean space to a subvariety of an algebraic torus. We study the question of which graphs arise from tropicalizing algebraic curves. By using Baker's specialization…