Upper bounds for certain trigonometric sums involving cosine powers

Anastasios D. Simalarides

Displaying similar documents to “Upper bounds for certain trigonometric sums involving cosine powers”

Zero-sums of length kq in $ℤ_{q}^{d}$

Silke Kubertin (2005)

Acta Arithmetica

Similarity:

Gauss Sums of Cubic Characters over $_{p^{r}}$ , p Odd

Davide Schipani, Michele Elia (2012)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

An elementary approach is shown which derives the values of the Gauss sums over $_{p^{r}}$ , p odd, of a cubic character. New links between Gauss sums over different field extensions are shown in terms of factorizations of the Gauss sums themselves, which are then revisited in terms of prime ideal decompositions. Interestingly, one of these results gives a representation of primes p of the form 6k+1 by a binary quadratic form in integers of a subfield of the cyclotomic field of the pth roots of...

A note on signs of Kloosterman sums

Kaisa Matomäki (2011)

Bulletin de la Société Mathématique de France

Similarity:

We prove that the sign of Kloosterman sums $Kl (1, 1; n)$ changes infinitely often as $n$ runs through the square-free numbers with at most $15$ prime factors. This improves on a previous result by Sivak-Fischler who obtained 18 instead of 15. Our improvement comes from introducing an elementary inequality which gives lower and upper bounds for the dot product of two sequences whose individual distributions are known.

On sums of powers of the positive integers

A. Schinzel (2013)

Colloquium Mathematicae

Similarity:

The pairs (k,m) are studied such that for every positive integer n we have $1^{k} + 2^{k} + \dots + n^{k} | 1^{k m} + 2^{k m} + \dots + n^{k m}$ .

On sum-sets and product-sets of complex numbers

József Solymosi (2005)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We give a simple argument that for any finite set of complex numbers $A$ , the size of the the sum-set, $A + A$ , or the product-set, $A \cdot A$ , is always large.

The sum of digits of $⌊ n^{c} ⌋$

Johannes F. Morgenbesser (2011)

Acta Arithmetica

Similarity:

Exponential sums of the form $\sum χ {(x)}^{a x} ζ_{m}^{b x}$

S. Gurak (2007)

Acta Arithmetica

Similarity:

The mean value of |L(k,χ)|² at positive rational integers k ≥ 1

Stéphane Louboutin (2001)

Colloquium Mathematicae

Similarity:

Let k ≥ 1 denote any positive rational integer. We give formulae for the sums $S_{o d d} (k, f) = \sum_{χ (- 1) = - 1} | L (k, χ) | ²$ (where χ ranges over the ϕ(f)/2 odd Dirichlet characters modulo f > 2) whenever k ≥ 1 is odd, and for the sums $S_{e v e n} (k, f) = \sum_{χ (- 1) = + 1} | L (k, χ) | ²$ (where χ ranges over the ϕ(f)/2 even Dirichlet characters modulo f>2) whenever k ≥ 1 is even.

Rademacher-Carlitz polynomials

Matthias Beck, Florian Kohl (2014)

Acta Arithmetica

Similarity:

We introduce and study the Rademacher-Carlitz polynomial $R (u, v, s, t, a, b) : = \sum_{k = ⌈ s ⌉}^{⌈ s ⌉ + b - 1} u^{⌊ (k a + t) ⌋} / b_{v^{k}}$ where $a, b \in ℤ_{> 0}$ , s,t ∈ ℝ, and u and v are variables. These polynomials generalize and unify various Dedekind-like sums and polynomials; most naturally, one may view R(u,v,s,t,a,b) as a polynomial analogue (in the sense of Carlitz) of the Dedekind-Rademacher sum $r_{t} (a, b) : = \sum_{k = 0}^{b - 1} (((k a + t) / b)) ((k / b))$ , which appears in various number-theoretic, combinatorial, geometric, and computational contexts. Our results come in three flavors: we prove a reciprocity theorem for Rademacher-Carlitz...

On Sums of Squares in $Q^{\frac{1}{2}} (X)$ etc

W. J. Ellison (1970-1971)

Séminaire de théorie des nombres de Bordeaux

Similarity:

A generalization of a theorem of Erdős-Rényi to m-fold sums and differences

Kathryn E. Hare, Shuntaro Yamagishi (2014)

Acta Arithmetica

Similarity:

Let m ≥ 2 be a positive integer. Given a set E(ω) ⊆ ℕ we define $r_{N}^{(m)} (ω)$ to be the number of ways to represent N ∈ ℤ as a combination of sums and differences of m distinct elements of E(ω). In this paper, we prove the existence of a “thick” set E(ω) and a positive constant K such that $r_{N}^{(m)} (ω) < K$ for all N ∈ ℤ. This is a generalization of a known theorem by Erdős and Rényi. We also apply our results to harmonic analysis, where we prove the existence of certain thin sets.

On the $k$ -polygonal numbers and the mean value of Dedekind sums

Jing Guo, Xiaoxue Li (2016)

Czechoslovak Mathematical Journal

Similarity:

For any positive integer $k \geq 3$ , it is easy to prove that the $k$ -polygonal numbers are $a_{n} (k) = (2 n + n (n - 1) (k - 2)) / 2$ . The main purpose of this paper is, using the properties of Gauss sums and Dedekind sums, the mean square value theorem of Dirichlet $L$ -functions and the analytic methods, to study the computational problem of one kind mean value of Dedekind sums $S (a_{n} (k) {\bar{a}}_{m} (k), p)$ for $k$ -polygonal numbers with $1 \leq m, n \leq p - 1$ , and give an interesting computational formula for it.

On the 4-norm of an automorphic form

Valentin Blomer (2013)

Journal of the European Mathematical Society

Similarity:

We prove the optimal upper bound $\sum_{f} {∥f∥}_{4}^{4} ≪ q^{ϵ}$ where $f$ runs over an orthonormal basis of Maass cusp forms of prime level $q$ and bounded spectral parameter.

Two examples of subspaces in $L^{2 l}$ spanned by characters of finite order

Mats Erik Andersson (2001)

Colloquium Mathematicae

Similarity:

By a Fourier multiplier technique on Cantor-like Abelian groups with characters of finite order, the norms from L² into $L^{2 l}$ of certain embeddings of character sums are computed. It turns out that the orders of the characters are immaterial as soon as they are at least four.

Limit theorems for sums of dependent random vectors in $R^{d}$

Andrzej Kłopotowski

Similarity:

CONTENTSIntroduction.......................................................................................................................................................................... 5 I. Infinitely divisible probability measures on $R^{d}$ ....................................................................................... 6 II. The classical limit theorems for sums of independent random vectors................................................ 14 III. Convergence in law to ℒ ( $\vec{a}$ ,...

Gauss Sums of the Cubic Character over $G F (2^{m})$ : an Elementary Derivation

Davide Schipani, Michele Elia (2011)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

By an elementary approach, we derive the value of the Gauss sum of a cubic character over a finite field $_{2^{s}}$ without using Davenport-Hasse’s theorem (namely, if s is odd the Gauss sum is -1, and if s is even its value is $- {(- 2)}^{s / 2}$ ).

Less than one implies zero

Felix L. Schwenninger, Hans Zwart (2015)

Studia Mathematica

Similarity:

In this paper we show that from an estimate of the form $s u p_{t \geq 0} | | C (t) - c o s (a t) I | | < 1$ , we can conclude that C(t) equals cos(at)I. Here ${(C (t))}_{t \geq 0}$ is a strongly continuous cosine family on a Banach space.

Some new sums related to D. H. Lehmer problem

Han Zhang, Wenpeng Zhang (2015)

Czechoslovak Mathematical Journal

Similarity:

About Lehmer’s number, many people have studied its various properties, and obtained a series of interesting results. In this paper, we consider a generalized Lehmer problem: Let $p$ be a prime, and let $N (k; p)$ denote the number of all $1 \leq a_{i} \leq p - 1$ such that $a_{1} a_{2} \dots a_{k} \equiv 1 mod p$ and $2 ∣ a_{i} + {\bar{a}}_{i} + 1,$ $i = 1, 2, \dots, k$ . The main purpose of this paper is using the analytic method, the estimate for character sums and trigonometric sums to study the asymptotic properties of the counting function $N (k; p),$ and give an interesting asymptotic formula...