Generalized Rudin-Shapiro sequences

From MaRDI portal





The celebrated Rudin-Shapiro sequence turns out to be \(\varepsilon_ n=(-1)^{u(n)}\), where \(u(n)\) counts the number of possibly overlapping appearances of the string \(11\) in the binary representation of \(n\). The sequence has the pleasing property that for all \(N\geq0\) \[ \sup_{\theta\in\mathbb{R}}\bigl|\sum_{n<N}\varepsilon_ ne^{2i\pi n\theta}\bigr|\leq CN^{1/2} , \] where one may take \(C=2+\sqrt 2\). More generally one has \[ \sup_{f\in M_ 2}\bigl|\sum_{n<N}f(n)e^{2i\pi xu(n)}\bigr|\leq C'N^{\alpha(x)}, \] where \(M_ 2\) is the set of 2-multiplicative sequences with modulus 1, the modulus \(\alpha(x)\) is explicit (for example \(\alpha(x)=1/2\) for all \(x\in \mathbb{Z}+1/2\)), and \(C'\) does not depend on \(x\). This paper extends such results to other sequences. Examples include counting the number of words of length \(d+2\) beginning and ending with 1 in the binary expansion of each \(n\) and the use of Hadamard matrices to replace \(M_ 2\) by the set \(M_ q\) of \(q\)-multiplicative sequences of modulus 1. A discussion of so-called chain sequences in a compact and metrizable group leads to inequalities with the exponential function replaced by an irreducible representation of the group.




Cited in
(43)








This page was built for publication: Generalized Rudin-Shapiro sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3982853)