On finite pseudorandom binary sequences. V: On \((n\alpha)\) and \((n^2\alpha)\) sequences (Q1974017): Difference between revisions

The authors introduced in 1997 a notion of pseudorandomness for binary sequences [see Acta Arith. 82, 365-377 (1997; Zbl 0886.11048)]. They devoted then a series of papers, some with coauthors, studying several sequences or classes of sequences for this notion [see Part II, J. Number Theory 73, 146-161 (1998; Zbl 0916.11047), Part III, Acta Arith. 87, 367-390 (1999; Zbl 0920.11053), Acta Arith. 95, 343-359 (2000; Zbl 0961.11026)]. In the paper under review, the authors study the sequence of \(\pm 1\)'s obtained by taking the signs of \(\frac{1}{2}- \{n\alpha\}\) (resp. \(\frac{1}{2}- \{n^2\alpha\}\)) as suggested to them by P. Erdős. They also announce that the case \(\frac{1}{2}- \{n^k\alpha\}\), \(k>2\), will be addressed in a forthcoming paper [Part VI, Monatsh. Math. 130, 281-298 (2000; Zbl 1011.11054)]. Note that the name of the first author is misspelled four times in the bibliography, and that Reference [2] has appeared: see the last reference above.