English
Related papers

Related papers: Covering an arithmetic progression with geometric …

200 papers

We show that there is a positive constant $c$ such that any graph on vertex set $[n]$ with at most $c n^2/k^2 \log k$ edges contains an independent set of order $k$ whose vertices form an arithmetic progression. We also present applications…

Combinatorics · Mathematics 2019-01-17 David Conlon , Jacob Fox , Benny Sudakov

We prove that for any partition of a set which contains an infinite arithmetic (respectively geometric) progression into two disjoint subsets, at least one of these subsets contains an infinite number of triplets such that each triplet is…

General Mathematics · Mathematics 2009-11-24 Florentin Smarandache

We show that for every $\varepsilon>0$ there is an absolute constant $c(\varepsilon)>0$ such that the following is true. The union of any $n$ arithmetic progressions, each of length $n$, with pairwise distinct differences must consist of at…

Combinatorics · Mathematics 2017-05-15 Shoni Gilboa , Rom Pinchasi

We investigate whether there exists an arithmetic progression or geometric progression consisting only palindromic numbers. In this paper we show that the answer to this question is NO. Given the first and final term we will also give an…

General Mathematics · Mathematics 2017-03-14 Sayak Chakrabarty , Argya Datta

We present an elementary proof that if $A$ is a finite set of numbers, and the sumset $A+_GA$ is small, $|A+_GA|\leq c|A|$, along a dense graph $G$, then $A$ contains $k$-term arithmetic progressions.

Number Theory · Mathematics 2007-05-23 Jozsef Solymosi

In this paper, we study $k$-term arithmetic progressions $N, N+d, ..., N+(k-1)d$ of powerful numbers. Under the $abc$-conjecture, we obtain $d \gg_\epsilon N^{1/2 - \epsilon}$. On the other hand, there exist infinitely many $3$-term…

Number Theory · Mathematics 2022-10-04 Tsz Ho Chan

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…

Number Theory · Mathematics 2025-12-04 Michael A. Bennett

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

Let F be a fixed finite field of characteristic at least 5. Let G = F^n be the n-dimensional vector space over F, and write N := |G|. We show that if A is a subset of G with size at least c_F N(log N)^{-c}, for some absolute constant c > 0…

Combinatorics · Mathematics 2014-02-26 Ben Green , Terence Tao

Let $A$ be an artin algebra. The aim of this work is to describe the enlargements of an indecomposable complex in $\mathbf{C}_{n}(\mbox{proj} \,A)$, and to study the irreducible morphisms between them. Precisely, we prove that any…

Representation Theory · Mathematics 2025-09-17 Claudia Chaio , Alfredo Gonzalez Chaio , Pamela Suarez

We prove that the gcd of certain infinite number of integers associated to generalised arithmetic progressions remains bounded independent of the progression. Using this we also get bounds on the indices of certain congruence subgroups of…

Number Theory · Mathematics 2007-05-23 T. N. Venkataramana

In this paper, we study how close the terms of a finite arithmetic progression can get to a perfect square. The answer depends on the initial term, the common difference and the number of terms in the arithmetic progression.

Number Theory · Mathematics 2018-01-08 Tsz Ho Chan

Consider the congruence class R_m(a)={a+im:i\in Z} and the infinite arithmetic progression P_m(a)={a+im:i\in N_0}. For positive integers a,b,c,d,m the sum of products set R_m(a)R_m(b)+R_m(c)R_m(d) consists of all integers of the form…

Number Theory · Mathematics 2016-12-30 Sergei V. Konyagin , Melvyn B. Nathanson

We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…

Number Theory · Mathematics 2023-02-08 Prajeet Bajpai , Michael A. Bennett , Tsz Ho Chan

Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…

Number Theory · Mathematics 2018-02-08 Yu-Chen Sun , Hao Pan

For every positive integer k, it is shown that there exists a positive definite diagonal quaternary integral quadratic form that represents all positive integers except for precisely those which lie in k arithmetic progressions. For k=1,…

Number Theory · Mathematics 2019-09-19 A. G. Earnest , Ji Young Kim

We solve the enumeration of the set $\textrm{AP}(n)$ of partitions of a positive integer $n$ in which the nondecreasing sequence of parts forms an arithmetic progression. In particular, we establish a formula for the number of nondecreasing…

Number Theory · Mathematics 2022-06-13 F. Javier de Vega

Suppose that A is a subset of the integers {1,...,N} of density a. We provide a new proof of a result of Green which shows that A+A contains an arithmetic progression of length exp(ca(log N)^{1/2}) for some absolute c>0. Furthermore we…

Number Theory · Mathematics 2010-04-02 Tom Sanders

In order to investigate multiplicative structures in additively large sets, Beiglb\"{o}ck et al. raised a significant open question as to whether or not every subset of the natural numbers with bounded gaps (syndetic set) contains…

Number Theory · Mathematics 2019-04-30 Bhuwanesh Rao Patil

Let $G$ be a graph which satisfies $c^{-1} a^r \le |B(v,r)| \le c a^r$, for some constants $c,a>1$, every vertex $v$ and every radius $r$. We prove that this implies the isoperimetric inequality $|\partial A| \ge C |A| / \log(2+ |A|)$ for…

Metric Geometry · Mathematics 2007-05-23 Itai Benjamini , Oded Schramm
‹ Prev 1 2 3 10 Next ›