Results 1 to 10 of about 272 (33)
New lower bounds for van der Waerden numbers
We show that there is a red-blue colouring of $[N]$ with no blue 3-term arithmetic progression and no red arithmetic progression of length $e^{C(\log N)^{3/4}(\log \log N)^{1/4}}$.
Ben Green
doaj +1 more source
High-entropy dual functions over finite fields and locally decodable codes
We show that for infinitely many primes p there exist dual functions of order k over ${\mathbb{F}}_p^n$ that cannot be approximated in $L_\infty $-distance by polynomial phase functions of degree $k-1$. This answers in the negative a natural finite-field
Jop Briët, Farrokh Labib
doaj +1 more source
Lucas non-Wieferich primes in arithmetic progressions and the abc conjecture
We prove the lower bound for the number of Lucas non-Wieferich primes in arithmetic progressions. More precisely, for any given integer k≥2k\ge 2, there are ≫logx\gg \hspace{0.25em}\log x Lucas non-Wieferich primes p≤xp\le x such that p≡±1(modk)p\equiv ...
Anitha K. +2 more
doaj +1 more source
A characterization of covering equivalence [PDF]
Let A={a_s(mod n_s)}_{s=1}^k and B={b_t(mod m_t)}_{t=1}^l be two systems of residue classes. If |{1\le s\le k: x=a_s (mod n_s)}| and |{1\le t\le l: x=b_t (mod m_t)}| are equal for all integers x, then A and B are said to be covering equivalent.
Pan, Hao, Sun, Zhi-Wei
core +3 more sources
Covering an arithmetic progression with geometric progressions and vice versa [PDF]
We show that there exists a positive constant C such that the following holds: Given an infinite arithmetic progression A of real numbers and a sufficiently large integer n (depending on A), there needs at least Cn geometric progressions to cover the ...
Sanna, Carlo
core +2 more sources
ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS
We show that if $A\subset \{1,\ldots ,N\}$ does not contain any nontrivial solutions to the equation
TOMASZ SCHOEN, OLOF SISASK
doaj +1 more source
The elementary symmetric functions of a reciprocal polynomial sequence [PDF]
Erd\"{o}s and Niven proved in 1946 that for any positive integers $m$ and $d$, there are at most finitely many integers $n$ for which at least one of the elementary symmetric functions of $1/m, 1/(m+d), ..., 1/(m+(n-1)d)$ are integers. Recently, Wang and
Hong, Shaofang +3 more
core +3 more sources
Goldbach Conjecture and the least prime number in an arithmetic progression [PDF]
In this Note, we try to study the relations between the Goldbach Conjecture and the least prime number in an arithmetic progression. We give a new weakened form of the Goldbach Conjecture.
Zhang, Shaohua
core +3 more sources
On covers of abelian groups by cosets [PDF]
Let G be any abelian group and {a_sG_s}_{s=1}^k be a finite system of cosets of subgroups G_1,...,G_k. We show that if {a_sG_s}_{s=1}^k covers all the elements of G at least m times with the coset a_tG_t irredundant then [G:G_t]\le 2^{k-m} and ...
Lettl, Günter, Sun, Zhi-Wei
core +3 more sources
A sharp result on m-covers [PDF]
Let A={a_s+n_sZ}_{s=1}^k be a finite system of arithmetic sequences which forms an m-cover of Z (i.e., every integer belongs at least to m members of A). In this paper we show the following sharp result: For any positive integers m_1,...,m_k and theta in
Pan, Hao, Sun, Zhi-Wei
core +5 more sources

