Orientable sequences over non-binary alphabets Article Swipe
Related Concepts
Binary number
Computer science
Combinatorics
Mathematics
Arithmetic
Abbas Alhakim
,
Chris J. Mitchell
,
Janusz Szmidt
,
Peter Wild
·
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.1007/s12095-024-00742-x
· OA: W4402139861
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.1007/s12095-024-00742-x
· OA: W4402139861
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either direction. In particular we establish how two variants of a generalised Lempel homomorphism can be used to recursively construct such sequences, generalising previous work on the binary case. We also derive an upper bound on the period of an orientable sequence.
Related Topics
Finding more related topics…