The hierarchy conjecture for products of irreducible polynomials in PRACs

From papers

Let n1,n2,r1,r2,k,n_1,n_2,r_1,r_2,k,\ell be positive integers with n1<r1<2n1n_1<r_1<2n_1, and let f1(x),,f(x)f_1(x),\ldots,f_\ell(x) be irreducible polynomials of degree n1n2n_1n_2 and exponent r1r2r_1r_2. Suppose that the set of sequences generated by each fi(x)f_i(x) forms an (r1,r2;n1,n2)(r_1,r_2;n_1,n_2)-PRAC. Product-folding claim. For every integer kk satisfying 1k1\leq k\leq\ell, folding the sequences generated by i=1kfi(x)\prod_{i=1}^k f_i(x) yields an (r1,r2;n1,kn2)(r_1,r_2;n_1,kn_2)-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.

Progress summary

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

Sources & referencesView supporting material

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).

Solutions 0

No solutions have been posted yet.