{"paper":{"title":"Factorizations of cycles and multi-noded rooted trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.CO","authors_text":"Fu Liu, Rosena R. X. Du","submitted_at":"2010-08-22T06:36:30Z","abstract_excerpt":"In this paper, we study factorizations of cycles. The main result is that under certain condition, the number of ways to factor a $d$-cycle into a product of cycles of prescribed lengths is $d^{r-2}.$ To prove our result, we first define a new class of combinatorial objects, multi-noded rooted trees, which generalize rooted trees. We find the cardinality of this new class which with proper parameters is exactly $d^{r-2}.$ The main part of this paper is the proof that there is a bijection from factorizations of a $d$-cycle to multi-noded rooted trees via factorization graphs. This implies the d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3677","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}