Related papers: Kirchhoff's theorem for Prym varieties

Kirchhoff's Matrix-Tree Theorem asserts that the number of spanning trees in a finite graph can be computed from the determinant of any of its reduced Laplacian matrices. In many cases, even for well-studied families of graphs, this can be…

Let $\mathfrak{A}$ be a finite abelian group. In this article, we classify harmonic $\mathfrak{A}$-covers of a tropical curve $\Gamma$ (which allow dilation along edges and at vertices) in terms of the cohomology group of a suitably defined…

Let k be a local field and let A be the two-by-two matrix algebra over k. In our previous work we developed a theory that allows the computation of the set of maximal orders in A containing a given suborder. This set is given as a sub-tree…

With the use of mathematical techniques of tropical geometry, it was shown by Mikhalkin some twenty years ago that certain Gromov-Witten invariants associated with topological quantum field theories of pseudoholomorphic maps can be computed…

The software TrIm offers implementations of tropical implicitization and tropical elimination, as developed by Tevelev and the authors. Given a polynomial map with generic coefficients, TrIm computes the tropical variety of the image. When…

We introduce a ``Kirchhoff--Tur\'an'' variant of the extremal $C_4$ problem: among all simple connected $n$-vertex $C_4$-free graphs $G$, maximize the number of spanning trees $\tau(G)$. For the projective-plane orders $n=q^2+q+1$ we…

Let $A$ be an abelian variety over an algebraically closed field $k$ that is complete with respect to a nontrivial nonarchimedean absolute value. Let $A^{\mathrm{an}}$ denote the analytification of $A$ in the sense of Berkovich, and let…

In this paper we study a $k$-dimensional analytic subvariety of the complex algebraic torus. We show that if its logarithmic limit set is a finite rational $(k-1)$-dimensional spherical polyhedron, then each irreducible component of the…

The Prym variety for a branched double covering of a nonsingular projective curve is defined as a polarized abelian variety. We prove that any double covering of an elliptic curve which has more than $4$ branch points is recovered from its…

Unlike Abel map of the symmetric power of a Riemann surface onto its Jacobian, the Abel--Prym map generically can not be reversed by means of conventional technique related to the Jacobi inversion problem, and of its main ingredient, namely…

We introduce a novel intrinsic volume concept in tropical geometry. This is achieved by developing the foundations of a tropical analog of lattice point counting in polytopes. We exhibit the basic properties and compare it to existing…

We exploit three classical characterizations of smooth genus two curves to study their tropical and analytic counterparts. First, we provide a combinatorial rule to determine the dual graph of each algebraic curve and the metric structure…

Kirchhoff's matrix tree theorem is a well-known result that gives a formula for the number of spanning trees in a finite, connected graph in terms of the graph Laplacian matrix. A closely related result is Wilson's algorithm for putting the…

We produce Brill-Noether general graphs in every genus, confirming a conjecture of Baker and giving a new proof of the Brill-Noether Theorem, due to Griffiths and Harris, over any algebraically closed field.

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

Using the special value at $u=1$ of Artin-Ihara $L$-functions, we associate to every $\mathbb{Z}$-cover of a finite connected graph a polynomial which we call the \emph{Ihara polynomial}. We show that the number of spanning trees for the…

This document provides a formal proof of Birkhoff's completeness theorem for multi-sorted algebras which states that any equational entailment valid in all models is also provable in the equational theory. More precisely, if a certain…

Treewidth is a graph parameter that plays a fundamental role in several structural and algorithmic results. We study the problem of decomposing a given graph $G$ into node-disjoint subgraphs, where each subgraph has sufficiently large…

Given a tame Galois branched cover of curves pi: X -> Y with any finite Galois group G whose representations are rational, we compute the dimension of the (generalized) Prym variety corresponding to any irreducible representation \rho of G.…

We prove that the tropical surface of the root system $A_{n-1}$ has degree $\frac{1}{2}n (n-1)(n-2)$.