In this paper, we investigate the asymptotic distribution of a class of multiplicative functions over arithmetic progressions without the Ramanujan conjecture. We also apply these results to some interesting arithmetic functions in automorphic context, such as coefficients of automorphic L-functions, coefficients of their Rankin–Selberg.

In this paper we study the existence of higher dimensional arithmetic progressions in Meyer sets. We show that the case when the ratios are linearly dependent over ${\mathbb Z}$ is trivial and focus on arithmetic progressions for which the ratios are linearly independent. Given a Meyer set $\Lambda $ and a fully Euclidean model set with the property that finitely many translates of cover $\Lambda $ , we prove that we can find higher dimensional arithmetic progressions of arbitrary length with k linearly independent ratios in $\Lambda $ if and only if k is at most the rank of the ${\mathbb Z}$ -module generated by . We use this result to characterize the Meyer sets that are subsets of fully Euclidean model sets.

Let $\mathrm{AP}_k=\{a,a+d,\ldots,a+(k-1)d\}$ be an arithmetic progression. For $\varepsilon>0$ we call a set $\mathrm{AP}_k(\varepsilon)=\{x_0,\ldots,x_{k-1}\}$ an $\varepsilon$ -approximate arithmetic progression if for some a and d, $|x_i-(a+id)|<\varepsilon d$ holds for all $i\in\{0,1\ldots,k-1\}$ . Complementing earlier results of Dumitrescu (2011, J. Comput. Geom.2(1) 16–29), in this paper we study numerical aspects of Van der Waerden, Szemerédi and Furstenberg–Katznelson like results in which arithmetic progressions and their higher dimensional extensions are replaced by their $\varepsilon$ -approximation.

A subset $A$ of a finite abelian group $G$ is called $(k,l)$-sum-free if the sum of $k$ (not necessarily distinct) elements of $A$ never equals the sum of $l$ (not necessarily distinct) elements of $A$. We find an explicit formula for the maximum size of a $(k,l)$-sum-free subset in $G$ for all $k$ and $l$ in the case when $G$ is cyclic by proving that it suffices to consider $(k,l)$-sum-free intervals in subgroups of $G$. This simplifies and extends earlier results by Hamidoune and Plagne [‘A new critical pair theorem applied to sum-free sets in abelian groups’, Comment. Math. Helv. 79(1) (2004), 183–207] and Bajnok [‘On the maximum size of a $(k,l)$-sum-free subset of an abelian group’, Int. J. Number Theory 5(6) (2009), 953–971].

Let $C$ be a hyperelliptic curve given by the equation ${{y}^{2}}\,=\,f(x)$ for $f\,\in \,\mathbb{Z}[x]$ without multiple roots. We say that points ${{P}_{i}}\,=\,({{x}_{i}},\,{{y}_{i}})\,\in \,C(\mathbb{Q})$ for $i\,=\,1,\,2,\,\ldots ,\,m$ are in arithmetic progression if the numbers ${{x}_{i}}$ for $i\,=\,1,\,2,\,\ldots ,\,m$ are in arithmetic progression.

In this paper we show that there exists a polynomial $k\,\in \,\mathbb{Z}[t]$ with the property that on the elliptic curve $\varepsilon \prime :{{y}^{2}}={{x}^{3}}+k(t)$ (defined over the field $\mathbb{Q}(t)$) we can find four points in arithmetic progression that are independent in the group of all $\mathbb{Q}(t)$-rational points on the curve $\varepsilon \prime $. In particular this result generalizes earlier results of Lee and Vélez. We also show that if $n\,\in \,\mathbb{N}$ is odd, then there are infinitely many $k$'s with the property that on curves ${{y}^{2}}\,=\,{{x}^{n}}\,+\,k$ there are four rational points in arithmetic progressions. In the case when $n$ is even we can find infinitely many $k$'s such that on curves ${{y}^{2}}\,=\,{{x}^{n}}\,+\,k$ there are six rational points in arithmetic progression.

Suppose that G is an abelian group and that A ⊂ G is finite and contains no non-trivial three-term arithmetic progressions. We show that |A+A| »ε|A|(log|A|)⅓−ε.

Erdős and Odlyzko proved that odd integers k such that k2n+1 is prime for some positive integer n have a positive lower density. In this paper, we characterize all arithmetic progressions in which natural numbers that can be expressed in the form (p−1)2−n (where p is a prime number) have a positive proportion. We also prove that an arithmetic progression consisting of odd numbers can be obtained from a covering system if and only if those integers in such a progression which can be expressed in the form (p−1)2−n have an asymptotic density of zero.

Given two sets of elements of the finite field 𝔽q of q elements, we show that the product set contains an arithmetic progression of length k≥3 provided that k<p, where p is the characteristic of 𝔽q, and #𝒜#ℬ≥3q2d−2/k. We also consider geometric progressions in a shifted product set 𝒜ℬ+h, for f∈𝔽q, and obtain a similar result.

Let $n,d,k\geq2,b,y$ and $\ell\geq3$ be positive integers with the greatest prime factor of b not exceeding k. It is proved that the equation $n (n+d) \dotsb (n+(k-1)d)=b y^{\ell}$ has no solution if d exceeds d1, where d1 equals 30 if $\ell =3$; 950 if $\ell =4$; $5\times 10^4$ if $\ell=5$ or 6; 108 if $\ell=7$, 8, 9 or 10; 1015 if $\ell \geq 11$. This confirms a conjecture of Erdős on the above equation for a large number of values of d.

It is proved that a product of four or more terms of positive integers in arithmetic progression with common difference a prime power is never a square. More general results are given which completely solve (1.1) with gcd(n, d)=1, k≥3 and 1<d≤104.

Crittenden and Vanden Eynden conjectured that if n arithmetic progressions, each having modulus at least k, include all the integers from 1 to k2n-k+1, then they include all the integers. They proved this for the cases k = 1 and k = 2. We give various necessary conditions for a counterexample to the conjecture; in particular we show that if a counterexample exists for some value of k, then one exists for that k and a value of n less than an explicit function of k.