Year: 2024
Type: preprint
Abstract: In this work, we prove that for every $k\geq 3$ there exist arbitrarily long bicrucial $k$-power-free permutations. We also show that for every $k\geq 3$ there exist right-crucial $k$-power-free permutations of any length at least $(k-1)(2k+1)$.
Source: arXiv (Cornell University)
Institutions: Georgia Institute of Technology, Hebei Normal University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4402954443
