Transitivity and connectivity of permutations
From MaRDI portal
Publication:705750
DOI10.1007/s00493-004-0029-4zbMath1057.05002OpenAlexW2001378190MaRDI QIDQ705750
Pierre Rosenstiehl, Patrice Ossona de Mendez
Publication date: 14 February 2005
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-004-0029-4
Related Items (10)
New permutation coding and equidistribution of set-valued statistics ⋮ On the connected components of a random permutation graph with a given number of edges ⋮ Bifix codes and Sturmian words ⋮ Connected chord diagrams and bridgeless maps ⋮ On Sillke's bijection ⋮ On enumeration of families of genus zero permutations ⋮ Hypermaps and indecomposable permutations ⋮ On random trees obtained from permutation graphs ⋮ The combinatorics of associated Hermite polynomials ⋮ Indecomposable permutations, hypermaps and labeled Dyck paths
This page was built for publication: Transitivity and connectivity of permutations
