Permutation complexity of the fixed points of some uniform binary morphisms
Alexander Valyuzhenich (Novosibirsk State University)
TL;DR
This paper investigates the permutation complexity of fixed points generated by certain uniform binary morphisms, providing formulas to quantify their structural complexity.
Contribution
It introduces a formula for the permutation complexity of fixed points of specific uniform binary morphisms, advancing understanding of their combinatorial properties.
Findings
Derived explicit formulas for permutation complexity
Analyzed properties of fixed points under uniform binary morphisms
Enhanced understanding of infinite permutation structures
Abstract
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
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 · Authorship Attribution and Profiling · Coding theory and cryptography