Permutations of N generated by left-right filling algorithms

2020/01/24 by Dekking, F. M.
#11 B 85 #68 R 05 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2001.08915

Abstract

We give an in depth analysis of an algorithm that generates permutations of the natural numbers introduced by Clark Kimberling in the On Line Encyclopedia of Integer Sequences. It turns out that the examples of such permutations in OEIS are completely determined by 3-automatic sequences.

Related

• Permutation Generation: Two New Permutation Algorithms
• A Versatile Algorithm to Generate Various Combinatorial Structures
• Counting Permutations Where The Difference Between Entries Located r Places Apart Can never be s (For any given positive integers r and s)
• On Discovering Interesting Combinatorial Integer Sequences
• The Number of Permutations With A Prescribed Number of 132 and 123 Patterns