Wilf-class and palindromic-prefix enumeration conjecture for Hertzsprung patterns
Wilf-class and palindromic-prefix enumeration conjecture for Hertzsprung patterns
Let denote the set of Hertzsprung patterns of length , and let be the autocorrelation polynomial of . For a palindrome , let be the set of lengths of its palindromic prefixes. Define
and let be the number of distinct sets for palindromes . Wilf-class and palindromic-prefix enumeration conjecture. For , one has
The equality is supported by the computed values through , which agree with the OEIS sequence A304178 from ; a general proof is not supplied.
Sources & referencesView supporting material
Primary source
Anders Claesson, “From Hertzsprung's problem to pattern-rewriting systems”, arXiv:2012.15309 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.