English
Related papers

Related papers: On arithmetic progressions in finite fields

200 papers

We introduce a new, elementary method for studying random differences in arithmetic progressions and convergence phenomena along random sequences of integers. We apply our method to obtain significant improvements on previously known…

Combinatorics · Mathematics 2014-05-07 Nikos Frantzikinakis , Emmanuel Lesigne , Máté Wierdl

We introduce the notion of arithmetic progression blocks or AP-blocks of $\mathbb{Z}_n$, which can be represented as sequences of the form $(x, x+m, x+2m, ..., x+(i-1)m) \pmod n$. Then we consider the problem of partitioning $\mathbb{Z}_n$…

Combinatorics · Mathematics 2008-05-13 William Y. C. Chen , David G. L. Wang , Iris F. Zhang

B. Green and T. Tao have recently proved that 'the set of primes contains arbitrary long arithmetic progressions', answering to an old question with a remarkably simple formulation. The proof does not use any "transcendental" method and any…

Dynamical Systems · Mathematics 2007-05-23 Bernard Host

Recently, the $k$-normal element over finite fields is defined and characterized by Huczynska et al.. In this paper, the characterization of $k$-normal elements, by using to give a generalization of Schwartz's theorem, which allows us to…

Commutative Algebra · Mathematics 2015-02-02 Mahmood Alizadeh

Let $q, m\geq 2$ be integers with $(m,q-1)=1$. Denote by $s_q(n)$ the sum of digits of $n$ in the $q$-ary digital expansion. Further let $p(x)\in mathbb{Z}[x]$ be a polynomial of degree $h\geq 3$ with $p(\mathbb{N})\subset \mathbb{N}$. We…

Number Theory · Mathematics 2011-10-24 Thomas Stoll

In this paper we present some new results about unlike powers in arithmetic progression. We prove among other things that for given $k\geq 4$ and $L\geq 3$ there are only finitely many arithmetic progressions of the form…

Number Theory · Mathematics 2007-05-23 N. Bruin , K. Gyory , L. Hajdu , Sz. Tengely

We prove that for all $q>61$, every non-zero element in the finite field $\mathbb{F}_{q}$ can be written as a linear combination of two primitive roots of $\mathbb{F}_{q}$. This resolves a conjecture posed by Cohen and Mullen.

Number Theory · Mathematics 2014-03-19 Stephen D. Cohen , Tomás Oliveira e Silva , Tim Trudgian

In this note we use a result of Kantor to prove a conjecture of Degos. Specifically we prove the following: let $\mathbb{F}$ be a finite field of order $q$ and let $f, g\in\mathbb{F}[X]$ be distinct polynomials of degree $n$ such that $f$…

Group Theory · Mathematics 2015-10-21 Nick Gill

Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. We prove an estimate for fractional parts of polynomials over $\mathbb{F}_q[t]$ satisfying a certain divisibility condition…

Number Theory · Mathematics 2015-09-07 Shuntaro Yamagishi

A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…

Symbolic Computation · Computer Science 2026-02-11 Jean-Guillaume Dumas , Stefano Lia , John Sheekey

In this paper we derive a formula for the number of $N$-free elements over a finite field $\mathbb{F}_q$ with prescribed trace, in particular trace zero, in terms of Gaussian periods. As a consequence, we derive a simple explicit formula…

Number Theory · Mathematics 2015-08-13 Aleksandr Tuxanidy , Qiang Wang

A set of positive integers $A \subset \mathbb{Z}_{> 0}$ is \emph{log-sparse} if there is an absolute constant $C$ so that for any positive integer $x$ the sequence contains at most $C$ elements in the interval $[x,2x)$. In this note we…

Combinatorics · Mathematics 2021-04-20 Noga Alon , Ryan Alweiss , Yang P. Liu , Anders Martinsson , Shyam Narayanan

We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…

Number Theory · Mathematics 2019-02-06 Nathan McNew

Erd\H{o}s proved that $\mathcal{F}(A) := \sum_{a \in A}\frac{1}{a\log a}$ converges for any primitive set of integers $A$ and later conjectured this sum is maximized when $A$ is the set of primes. Banks and Martin further conjectured that…

Number Theory · Mathematics 2020-07-07 Andrés Gómez-Colunga , Charlotte Kavaler , Nathan McNew , Mirilla Zhu

The centrepiece of this paper is a normal form for primitive elements which facilitates the use of induction arguments to prove properties of primitive elements. The normal form arises from an elementary algorithm for constructing a…

Group Theory · Mathematics 2007-05-23 Adam Piggott

We investigate the first moment of primes in progressions $$ \sum_{\substack{q\leq x/N \\ (q,a)=1}} \Big(\psi(x; q, a) - \frac x{\varphi(q)}\Big) $$ as $x, N \to \infty$. We show unconditionally that, when $a=1$, there is a significant bias…

Number Theory · Mathematics 2021-04-07 Sary Drappeau , Daniel Fiorilli

Let $r$ be a positive divisor of $q-1$ and $f(x,y)$ a rational function of degree sum $d$ over $\mathbb{F}_q$ with some restrictions, where the degree sum of a rational function $f(x,y) = f_1(x,y)/f_2(x,y)$ is the sum of the degrees of…

Number Theory · Mathematics 2024-10-08 Soniya Takshak , Giorgos Kapetanakis , Rajendra Kumar Sharma

The main result of this paper is that if E is a field extension of finite odd degree over a real field Q, and if E is a repeated radical extension of Q, then every intermediate field is also a repeated radical extension of Q. This paper…

Number Theory · Mathematics 2008-02-03 I. M. Isaacs , David Petrie Moulton

We evaluate asymptotically the variance of the number of squarefree integers up to $x$ in short intervals of length $H < x^{6/11 - \varepsilon}$ and the variance of the number of squarefree integers up to $x$ in arithmetic progressions…

Number Theory · Mathematics 2024-10-15 Ofir Gorodetsky , Kaisa Matomäki , Maksym Radziwiłł , Brad Rodgers

I show that a trivial modification of a standard proof of the Roth's Theorem on triples in arithmetic progression would lead to the following Theorem: If A is a "large set" that is its elements are monotone increasing integers and the sum…

Number Theory · Mathematics 2014-04-08 Gabor Korvin
‹ Prev 1 8 9 10 Next ›