Omega sequences have linear complexity near half the sequence length

Let O{\cal O} denote the omega sequence, and let L(O,N)L({\cal O},N) be its NNth linear complexity.

Omega linear-complexity conjecture.

L(O,N)=N2+O(1).L({\cal O},N)=\frac{N}{2}+O(1).

This conjecture is based on numerical data; the paper gives no proof or further evidence of resolution.

Sources & referencesView supporting material

Primary source

Arne Winterhof, “Pseudorandom binary sequences: quality measures and number-theoretic constructions”, arXiv:2305.11486 (2023).

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.