On substitution algebras of permutations
Mohammad Assem
TL;DR
This paper explores substitution algebras of permutations, focusing on transpositions instead of replacements, and provides a simulation related to prior work in the field.
Contribution
It introduces a new approach to substitution algebras by considering transpositions, extending previous models that used replacements.
Findings
Developed a simulation model for transposition-based substitution algebras
Compared transposition substitutions with replacement-based models
Extended theoretical framework for permutation-based algebras
Abstract
The subject of this paper is a simulation to that in [1] but here we consider substitutions corresponding to transpositions instead of replacements.
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
Topicssemigroups and automata theory · Advanced Combinatorial Mathematics · Genome Rearrangement Algorithms