Related papers: On arithmetic progressions in finite fields

Given $\mathbb{F}_{q^{n}}$, a field with $q^n$ elements, where $q $ is a prime power and $n$ is positive integer. For $r_1,r_2,m_1,m_2 \in \mathbb{N}$, $k_1,k_2 \in \mathbb{N}\cup \{0\}$, a rational function $F = \frac{F_1}{F_2}$ in…

We study the repetition of patches in self-affine tilings in R^d. In particular, we study the existence and non-existence of arithmetic progressions. We first show that an arithmetic condition of the expansion map for a self-affine tiling…

The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…

We prove an upper bound for the length of an arithmetic progression represented by an irreducible integral binary quadratic form or a norm form, which depends only on the form and the progression's common difference. For quadratic forms,…

We prove that for any prime power $q\notin\{3,4,5\}$, the cubic extension $\mathbb{F}_{q^3}$ of the finite field $\mathbb{F}_q$ contains a primitive element $\xi$ such that $\xi+\xi^{-1}$ is also primitive, and…

Let $q$ be a positive integral power of some prime $p$ and $\mathbb{F}_{q^m}$ be a finite field with $q^m$ elements for some $m \in \mathbb{N}$. Here we establish a sufficient condition for the existence of a non-zero element $\epsilon \in…

We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…

A reasonably complete theory of the approximation of an irrational by rational fractions whose numerators and denominators lie in prescribed arithmetic progressions is developed in this paper. Results are both, on the one hand, from a…

Pillai showed that any sequence of consecutive integers with at most 16 terms possesses one term that is relatively prime to all the others. We give a new proof of a slight generalization of this result to arithmetic progressions of…

In this paper we prove a basic theorem which says that if f : F_p^n -> [0,1] has the property that ||f^||_(1/3) is not too ``large''(actually, it also holds for quasinorms 1/2-\delta in place of 1/3), and E(f) = p^{-n} sum_m f(m) is not too…

We prove explicit versions of Cram\'er's theorem for primes in arithmetic progressions, on the assumption of the generalized Riemann hypothesis.

Assuming the generalized Riemann hypothesis, we give asymptotic bounds on the size of intervals that contain primes from a given arithmetic progression using the approach developed by Carneiro, Milinovich and Soundararajan [Comment. Math.…

Let $F$ be a finite field of odd characteristic. We prove that any set $A\subset F$ with $|A|\geq C|F|^{5/6}$ contains a nontrivial quadratic progression $(x, x+y, x+y^2), y\neq 0.$ For prime fields, this improves the previous best-known…

Let $q$ be a prime power and $m>1$ be any integer. Let $\mathbb F_{q^m}$ be the finite field of order $q^m$ and $\theta\in\mathbb F_{q^m}$ be such that $\mathbb F_{q^m} = \mathbb F(\theta)$. We obtain a nontrivial bound for the mixed…

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

Normal bases in finite fields constitute a vast topic of large theoretical and practical interest. Recently, $k$-normal elements were introduced as a natural extension of normal elements. The existence and the number of $k$-normal elements…

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

In this paper we give a very elementary proof that if A and B are subsets of {1,2,...,N}, each having at least 5N^{1 - (4(k-1))^{-1}} elements, then the sumset A+B has a k-term arithmetic progression.

If $a$ and $b$ are integers with $b>a>1$, we completely characterize ``long'' arithmetic progressions in the sumsets of the geometric progressions $1, a, a^2, a^3, \ldots$ and $1, b, b^2, b^3, \ldots$. Our proofs utilize recent applications…

In this article, we establish a sufficient condition for the existence of primitive element $\alpha\in \Fm$ is such that $f(\alpha)$ is also primitive element of $\Fm$ and $Tr_{\Fm/\F}(\alpha)=\beta$, for any prescribed $\beta\in\F$, where…