What Could Be a Simple Permutation?
Combinatorics
2010-07-23 v1 Group Theory
Abstract
Different ways to describe a permutation, as a sequence of integers, or a product of Coxeter generators, or a tree, give different choices to define a simple permutation. We recollect few of them, define new types of simple permutations, and analyze their interconnections and some asymptotic and geometrical properties of these classes.
Keywords
Cite
@article{arxiv.1007.3869,
title = {What Could Be a Simple Permutation?},
author = {Rehana Ashraf and Barbu Berceanu and Ayesha Riasat},
journal= {arXiv preprint arXiv:1007.3869},
year = {2010}
}
Comments
19 pages, 11 figures