Cycle factorizations and one-faced graph embeddings

Details Cycle factorizations and one-faced graph embeddings Cycle factorizations and one-faced graph embeddings

2008-10-21

arxiv.org/abs/0810.3892v2

Mathematics

Combinatorics

21 pages, 6 figures

Scientific paper

Consider factorizations into transpositions of an n-cycle in the symmetric group S_n. To every such factorization we assign a monomial in variables w_{ij} that retains the transpositions used, but forgets their order. Summing over all possible factorizations of n-cycles we obtain a polynomial that happens to admit a closed expression. From this expression we deduce a formula for the number of 1-faced embeddings of a given graph.

Affiliated with

Also associated with

No associations

Rating

Cycle factorizations and one-faced graph embeddings 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 Cycle factorizations and one-faced graph embeddings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cycle factorizations and one-faced graph embeddings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-574302