On sequences without geometric progressions

DOI10.1090/S0025-5718-96-00765-XzbMath0853.11009OpenAlexW2014727454MaRDI QIDQ4718421

Daniel M. Gordon, Brienne E. Brown

Publication date: 3 December 1996

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-96-00765-x

zbMATH Keywords

greedy algorithmsequences without geometric progressions

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Density, gaps, topology (11B05)

Related Items (5)

Multiplicative structures in additively large sets ⋮ A problem of Rankin on sets without geometric progressions ⋮ Geometric progression-free sequences with small gaps ⋮ Subsets of \(\mathbb{F}_q[x\) free of 3-term geometric progressions] ⋮ On sets of integers which contain no three terms in geometric progression

Cites Work

• Unnamed Item
• Sets of Integers With No Long Arithmetic Progressions Generated by the Greedy Algorithm
• Greedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions
• On sets of integers containing k elements in arithmetic progression
• On Some Sequences of Integers
• On Certain Sets of Integers

This page was built for publication: On sequences without geometric progressions