Article
Some Applications of W. Rudin’s Inequality to Problems of Combinatorial Number Theory
Authors
Abstract
In the paper we obtain some new applications of well-known W. Rudin’s theorem concerning lacunary series to problems of combinatorial number theory. We generalize a result of M.-C. Chang on L2(Λ)-norm of Fourier coef- ficients of a set (here Λ is a dissociated set), and prove a dual version of the theorem. Our main instrument is computing of eigenvalues of some operators.
Keywords
Abelian group, matrix, singular, eigenvalue, prime, Fourier transformation.
Citation
Shkredov, I. D. (2011). Some applications of w. rudin’s inequality to problems of combinatorial number theory. Uniform Distribution Theory, 6(2), 95–116.
I. D. Shkredov, “Some applications of w. rudin’s inequality to problems of combinatorial number theory,” Uniform Distribution Theory, vol. 6, no. 2, pp. 95–116, 2011.
Shkredov ID. Some applications of w. rudin’s inequality to problems of combinatorial number theory. Uniform Distribution Theory. 2011;6(2):95–116.
Shkredov, I. D. (2011), ‘Some applications of w. rudin’s inequality to problems of combinatorial number theory’, Uniform Distribution Theory, 6(2), pp. 95–116.
Shkredov, Ilya D. “Some Applications of W. Rudin’s Inequality to Problems of Combinatorial Number Theory.” Uniform Distribution Theory, vol. 6, no. 2, 2011, pp. 95–116.
Shkredov, Ilya D. “Some Applications of W. Rudin’s Inequality to Problems of Combinatorial Number Theory.” Uniform Distribution Theory 6, no. 2 (2011): 95–116.
Export citation
Published by: Engineering Journals
