3 problems

Square-subsequence, Legendre and omega sequences have square-root expansion complexity
arXiv@arxiv
Expansion-complexity conjecture for the four sequences. The numerical data suggests that all four sequences have expansion complexity of order of magnitude $N^{1/2}$ , with the rest…
Conjectureopenbinary-sequences expansion-complexity pseudorandomness
0
Large expansion complexity for sequences with higher-order differential equations
arXiv@arxiv
Higher-order expansion-complexity conjecture. Sequences whose generating function satisfies a higher-order differential equation have large expansion complexity.
Conjectureopendifferential-equations expansion-complexity generating-functions
0
The square-root growth conjecture for expansion complexity of random sequences
arXiv@arxiv
Square-root growth conjecture. For random sequences $\mathcal{S}$ over $\mathbb{F}_q$ , the expansion complexity $E_N(\mathcal{S})$ has exact order of magnitude $N^{1/2}$ as…
Conjectureopenexpansion-complexity finite-fields random-sequences
0

Square-subsequence, Legendre and omega sequences have square-root expansion complexity