The hierarchy conjecture for products of irreducible polynomials in PRACs
Let be positive integers with , and let be irreducible polynomials of degree and exponent . Suppose that the set of sequences generated by each forms an -PRAC. Product-folding claim. For every integer satisfying , folding the sequences generated by yields an -PRAC. This gives a proposed hierarchy of PRACs obtained by multiplying irreducible polynomials; the supplied text does not establish whether the claim is proved or remains open.
References
Primary source
Simon Blackburn, Yeow Meng Chee, Tuvi Etzion and Huimin Lao, “On de Bruijn Array Codes Part II: Linear Codes”, arXiv:2501.12124 (2025).
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.