Parker's improved conjecture on type-I complementary arrays

At least 12 years old · documented by

Let nn be a positive integer. A type-I complementary array over the alphabet 0,1,−1{0,1,-1} is an array represented by a function fn−1,0(x)f_{n-1,0}({\bf{x}}), with the indices and parameters ss, qq, pp, and ww as in the construction preceding the claim. Parker's improved conjecture. For any nn, each type-I complementary array over the alphabet 0,1,−1{0,1,-1} is of the form

fn−1,0(x)=(∏j=0∣s∣−1(xs(j)+xq(s(j))+w(s(j))+1))(−1)∑j=0∣p∣−1w(p(j))xp(j)+∑j=0∣p∣−2xp(j)xp(j+1).f_{n-1,0}({\bf{x}}) = \left(\prod_{j=0}^{|s|-1} \left(x_{s(j)} + x_{q(s(j))} + w({s(j)}) + 1\right)\right)(-1)^{\sum_{j=0}^{|p|-1} w({p(j)})x_{p(j)} + \sum_{j=0}^{|p|-2}x_{p(j)}x_{p(j+1)}}.

This claim strengthens the earlier conjecture cited in the source by characterising all type-I complementary arrays through the displayed construction; its resolution is not established in the supplied text.

References

Primary source

Gaofei Wu and Matthew G. Parker, “A complementary construction using mutually unbiased bases”, arXiv:1309.0157 (2013).

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.