2017•Transactions of the American Mathematical SocietyOpen access

On the law of the iterated logarithm for random exponential sums

I. Berkés, Bence Borda

Open full text 8 citations

Abstract

The asymptotic behavior of exponential sums ∑ k = 1 N exp ⁡ ( 2 π i n k α ) \sum _{k=1}^N \exp ( 2\pi i n_k \alpha ) for Hadamard lacunary ( n k ) (n_k) is well known, but for general ( n k ) (n_k) very few precise results exist, due to number theoretic difficulties. It is therefore natural to consider random ( n k ) (n_k) , and in this paper we prove the law of the iterated logarithm for ∑ k = 1 N exp ⁡ ( 2 π i n k α ) \sum _{k=1}^N \exp (2\pi i n_k \alpha ) if the gaps n k + 1 − n k n_{k+1}-n_k are independent, identically distributed random variables. As a comparison, we give a lower bound for the discrepancy of { n k α } \{n_k \alpha \} under the same random model, exhibiting a completely different behavior.

Open-access reader

About this research paper

What this paper is about

The asymptotic behavior of exponential sums ∑ k = 1 N exp ⁡ ( 2 π i n k α ) \sum _{k=1}^N \exp ( 2\pi i n_k \alpha ) for Hadamard lacunary ( n k ) (n_k) is well known, but for general ( n k ) (n_k) very few precise results exist, due to number theoretic difficulties. It is therefore natural to consider random ( n k ) (n_k) , and in this paper we prove the law of the iterated logarithm for ∑ k = 1 N exp ⁡ ( 2 π i n k α ) \sum _{k=1}^N \exp (2\pi i n_k \alpha ) if the gaps n k + 1 − n k n_{k+1}-n_k are independent, identically distributed random variables. As a comparison, we give a lower bound for the discrepancy of { n k α } \{n_k \alpha \} under the same random model, exhibiting a completely different behavior.

Why it matters

OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The asymptotic behavior of exponential sums ∑ k = 1 N exp ⁡ ( 2 π i n k α ) \sum _{k=1}^N \exp ( 2\pi i n_k \alpha ) for Hadamard lacunary ( n k ) (n_k) is well known, but for general ( n k ) (n_k) very few precise results exist, due to number theoretic difficulties. It is therefore natural to consider random ( n k ) (n_k) , and in this paper we prove the law of the iterated logarithm for ∑ k = 1 N exp ⁡ ( 2 π i n k α ) \sum _{k=1}^N \exp (2\pi i n_k \alpha ) if the gaps n k + 1 − n k n_{k+1}-n_k are independent, identically distributed random variables. As a comparison, we give a lower bound for the discrepancy of { n k α } \{n_k \alpha \} under the same random model, exhibiting a completely different behavior.

Key concepts: Mathematics, Law of the iterated logarithm, Iterated logarithm, Logarithm, Exponential function, Pure mathematics, Applied mathematics, Mathematical analysis

Related papers

Back to paper searchBrowse research topicsOriginal source
On the law of the iterated logarithm for random exponential sums — Research Paper | ScholarLens