On the complexity group of stable curves

Details On the complexity group of stable curves On the complexity group of stable curves

2008-08-11

arxiv.org/abs/0808.1529v1

Mathematics

Algebraic Geometry

Scientific paper

In this paper, we study combinatorial properties of stable curves. To the dual graph of any nodal curve, it is naturally associated a group, which is the group of components of the N\'eron model of the generalized Jacobian of the curve. We study the order of this group, called the complexity. In particular, we provide a partial characterization of the stable curves having maximal complexity, and we provide an upper bound, depending only on the genus $g$ of the curve, on the maximal complexity of stable curves; this bound is asymptotically sharp for $g\gg 0$. Eventually, we state some conjectures on the behavior of stable curves with maximal complexity, and prove partial results in this direction.

Affiliated with

Also associated with

No associations

Rating

On the complexity group of stable curves 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 On the complexity group of stable curves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the complexity group of stable curves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-493266