Tree-like properties of cycle factorizations

From MaRDI portal
Publication:1601424

DOI10.1006/jcta.2001.3230zbMath0992.05002arXivmath/0106039OpenAlexW2050823015WikidataQ114234205 ScholiaQ114234205MaRDI QIDQ1601424

Alexander Yong, Ian P. Goulden

Publication date: 30 August 2002

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0106039




Related Items (23)

The number of prefixes of minimal factorisations of a cycleCombinatorial flip actions and Gelfand pairs for affine Weyl groupsRandom stable-type minimal factorizations of the n-cycle\(k\)-factorizations of the full cycle and generalized Mahonian statistics on \(k\)-forestsRibbon decomposition and twisted Hurwitz numbersExceptional sequences over path algebras of type \(A_n\) and non-crossing spanning trees.Annular noncrossing permutations and minimal transitive factorizationsTransitive cycle factorizations and prime parking functionsOn maximal chains in the non-crossing partition latticeTrees, parking functions and factorizations of full cyclesCombinatorics of exceptional sequences in type AA combinatorial interpretation of the bijection of Goulden and YongSome factorisations counted by Catalan numbersUnnamed ItemUnnamed ItemA geometric representation of fragmentation processes on stable treesDegrees in random uniform minimal factorizationsTrajectories in random minimal transposition factorizationsThe geometry of random minimal factorizations of a long cycle via biconditioned bitype random treesCycle factorizations and 1-faced graph embeddingsRandom generation and scaling limits of fixed genus factorizations into transpositionsFactorizations of cycles and multi-noded rooted treesCombinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson



Cites Work


This page was built for publication: Tree-like properties of cycle factorizations