Polynomials, meanders, and paths in the lattice of noncrossing partitions

Details Polynomials, meanders, and paths in the lattice of noncrossing partitions Polynomials, meanders, and paths in the lattice of noncrossing partitions

2006-06-07

arxiv.org/abs/math/0606169v2

Mathematics

Combinatorics

24 pages, 7 figures. To appear, Transactions of the A.M.S. Revised based on referee report; final section added

Scientific paper

For every polynomial f of degree n with no double roots, there is an associated family C(f) of harmonic algebraic curves, fibred over the circle, with at most n-1 singular fibres. We study the combinatorial topology of C(f) in the generic case when there are exactly n-1 singular fibres. In this case, the topology of C(f) is determined by the data of an n-tuple of noncrossing matchings on the set {0,1,...,2n-1} with certain extra properties. We prove that there are 2(2n)^{n-2} such n-tuples, and that all of them arise from the topology of C(f) for some polynomial f.

Affiliated with

Also associated with

No associations

Rating

Polynomials, meanders, and paths in the lattice of noncrossing partitions 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 Polynomials, meanders, and paths in the lattice of noncrossing partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomials, meanders, and paths in the lattice of noncrossing partitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-507337