Arithmetric structure and lacunary Fourier series
trigonometric polynomial f=2j akyk (l * * * , y,, eE) an inequality flfK?1pCB lf 112 holds, where the constant B depends only on E and p. Theorems 1 and 2 of this paper give estimates on the number of elements of E which can lie in a given multidimensional arithmetic progression in r. Theorem 2 is a generalization of Rudin's result [5, Theorem 3.5]. When a set E is A(p) for all 2
bounded function on E can be extended to be a Fourier-Stieltjes transform. It is known that every Sidon set is a A set, but the converse is unknown [4, p. 128]. As a corollary to Theorem 2 we find that A sets are also Sidon sets in groups F where each element has the same prime order. NOTATION. Suppose s and N are positive integers, 1 _r oo, b1, * * , bk E F have finite order, bk+1, b , bc F have infinite order and bo E F has arbitrary order. Set Ar(N, s, b) = n b + bo ZIn, Jr < N where n*b=nlbl+*+nsbs. Denote by f the Fourier transform of fe L'(G), by (x, y) the action of the character y on x E G, and by IFl the cardinality of a finite set F. THEOREM 1. Let bl, * * *, bk E r have finite orders ,l1, P*k, and let bk1, * * *, bs F F have infinite order. Let Ec F be a A(p) set with B a Received by the editors September 24, 1971 and, in revised form, December 8, 1971. AMS 1970 subject classifications. Primary 42A44, 43A70.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader