Large subsets of Z_m^n without arithmetic progressions
From MaRDI portal
Publication:2697487
DOI10.1007/S10623-022-01145-WOpenAlexW4311468491MaRDI QIDQ2697487FDOQ2697487
Authors: Christian Elsholtz, Benjamin Klahn, Gabriel F. Lipnik 
Publication date: 12 April 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.02588
Recommendations
Cites Work
- Title not available (Why is that?)
- On sets of integers containing k elements in arithmetic progression
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Extensions of generalized product caps
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions
- Caps and progression-free sets in \(\mathbb{Z}_m^n\)
Cited In (10)
- Sets of integers that do not contain long arithmetic progressions
- On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions
- Bounds on the size of progression-free sets in \(\mathbb{Z}_m^n\)
- Large sets without Fourier restriction theorems
- Arithmetic properties of sparse subsets of $\mathbb{Z}^n$
- Sets avoiding six-term arithmetic progressions in \(\mathbb{Z}_6^n\) are exponentially small
- Large Subsets of $\mathbb{Z}_m^n$ without Arithmetic Progressions
- A generalization of sets without long arithmetic progressions based on Szekeres algorithm
- The maximum size of subsets forbidding cyclic arithmetic progressions
- An enumeration problem arising from a result about arithmetic progressions
This page was built for publication: Large subsets of \(\mathbb{Z}_m^n\) without arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2697487)
