What Could Be a Simple Permutation?
classification
🧮 math.CO
math.GR
keywords
permutationsimpledefinedifferentanalyzeasymptoticchoicesclasses
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.