Wilf-class and palindromic-prefix enumeration conjecture for Hertzsprung patterns

About 6 years old · traced to

Let Sk\mathcal{S}_k denote the set of Hertzsprung patterns of length kk, and let Ω(σ,σ)\Omega(\sigma,\sigma) be the autocorrelation polynomial of σ∈Sk\sigma\in\mathcal{S}_k. For a palindrome w∈{0,1}kw\in\{0,1\}^k, let P(w)P(w) be the set of lengths of its palindromic prefixes. Define

ak=∣{Ω(σ,σ):σ∈Sk}∣,a_k=|\{\Omega(\sigma,\sigma):\sigma\in\mathcal{S}_k\}|,

and let bkb_k be the number of distinct sets P(w)P(w) for palindromes w∈{0,1}kw\in\{0,1\}^k. Wilf-class and palindromic-prefix enumeration conjecture. For k≥3k\geq 3, one has

ak=bk+1.a_k=b_{k+1}.

The equality is supported by the computed values through k=15k=15, which agree with the OEIS sequence A304178 from k≥3k\geq3; a general proof is not supplied.

References

Primary source

Anders Claesson, “From Hertzsprung's problem to pattern-rewriting systems”, arXiv:2012.15309 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.