Bicrucial k-power-free permutations
Abstract
In this work, we prove that for every k≥ 3 there exist arbitrarily long bicrucial k-power-free permutations. We also show that for every k≥ 3 there exist right-crucial k-power-free permutations of any length at least (k-1)(2k+1).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.