Harmonic morphisms and hyperelliptic graphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

29 pages, 2 figures. v2: Added Corollary 4.25, Remark 4.26, and Corollary 5.21, and made minor stylistic changes

Scientific paper

We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and harmonic 1-forms induced by a harmonic morphism, and present a discrete analogue of the canonical map from a Riemann surface to projective space. We also discuss several equivalent formulations of the notion of a hyperelliptic graph, all motivated by the classical theory of Riemann surfaces. As an application of our results, we show that for a 2-edge-connected graph G which is not a cycle, there is at most one involution $\iota$ on G for which the quotient $G/\iota$ is a tree. We also show that the number of spanning trees in a graph G is even if and only if G admits a non-constant harmonic morphism to the graph B_2 consisting of 2 vertices connected by 2 edges. Finally, we use the Riemann-Hurwitz formula and our results on hyperelliptic graphs to classify all hyperelliptic graphs having no Weierstrass points.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Harmonic morphisms and hyperelliptic graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Harmonic morphisms and hyperelliptic graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Harmonic morphisms and hyperelliptic graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-159687

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.