Indexed metadata
On permutation complexity of fixed points of some uniform binary morphisms
Alexandr Valyuzhenich
Source abstract
Combinatorics We study properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.