Permutations of N generated by left-right filling algorithms

Dekking, FM

Permutations of N generated by left-right filling algorithms

Other (2020)

Authors

FM Dekking Applied Probability

Research Group

Applied Probability

Morphic word 3-automatic sequence Permutation of N

To reference this document use:

http://resolver.tudelft.nl/uuid:851713cf-c585-4700-b20e-198603b7c99f

More Info

expand_more

Published Date

2020

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Research Group

Applied Probability

Abstract

We give an in-depth analysis of an algorithm, introduced by Kimberling in the On-Line Encyclopedia of Integer Sequences, that generates permutations of the natural numbers. It turns out that each example of such a permutation in the Encyclopedia is completely determined by some 3-automatic sequence.