Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern
Abstract
This paper presents results on maximal runs, order of squares, palindromes, and unbordered factors of members of the family of binary pattern sequences with the all-one pattern. Restricting ourselves to binary pattern sequences with the all-one pattern with at least three ones, five categories of maximal run lengths and 3 categories of orders of squares are presented, palindromes with locally maximal length as well as palindromes with the second to fifth-largest palindrome lengths are described, and unbordered factors of lengths powers of two are presented. Interestingly, the characteristic functions of specified prefixes of sequences of the 2-kernel of these sequences can be formulated using the Vile and Jacobsthal sequences. Both Mathematica and Walnut are employed for exploratory pattern analysis. Proofs are based on a correspondence between binary strings under concatenation and integers under addition and multiplication. It is observed that this correspondence seems most efficacious for proofs of theorems whose statements are classified at low levels in the arithmetic hierarchy.
Keywords
Cite
@article{arxiv.2505.20547,
title = {Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern},
author = {Russell Jay Hendel},
journal= {arXiv preprint arXiv:2505.20547},
year = {2025}
}
Comments
Version 5: This version rejected by a journal with the main comment "Not enough proofs (too many conjectures); not sophisticated mathematically." The author agrees and is rewriting the paper with proofs. Acknowledgement, with apologies to earlier readers, to an anonymous referee and kind editor who were instrumental in removing all typos in the paper and sloppiness in the bibiography