What Could Be a Simple Permutation?
Rehana Ashraf, Barbu Berceanu, and Ayesha Riasat

TL;DR
This paper explores various definitions of simple permutations, introduces new types, and analyzes their interrelations along with asymptotic and geometric properties of these classes.
Contribution
It defines new types of simple permutations and studies their connections and properties, expanding understanding of permutation structures.
Findings
Multiple definitions of simple permutations are compared.
New types of simple permutations are introduced.
Asymptotic and geometrical properties of these classes are analyzed.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Advanced Combinatorial Mathematics · semigroups and automata theory
