On subsets of F_q^n containing no k-term progressions

DOI10.1016/J.EJC.2009.12.001zbMATH Open1246.11020OpenAlexW1573651432MaRDI QIDQ976161FDOQ976161

Authors: Yuncheng Lin, Julia Wolf 

Publication date: 17 June 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.12.001

Recommendations

• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• Subsets of \(\mathbb{F}_q[x]\) free of 3-term geometric progressions
• The number of subsets of integers with no \(k\)-term arithmetic progression
• scientific article; zbMATH DE number 3523693
• On sets of integers containing k elements in arithmetic progression
• On sets without \(k\)-term arithmetic progression
• On the size of subsets of \(\mathbb{F}_p^n\) without \(p\) distinct elements summing to zero
• scientific article; zbMATH DE number 3297285
• Subsets without \(q\)-separation and binomial products of Fibonacci numbers
• Large subsets of \(\mathbb{Z}_m^n\) without arithmetic progressions

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Arithmetic combinatorics; higher degree uniformity (11B30)

Cites Work

• Title not available (Why is that?)
• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• Title not available (Why is that?)
• On Certain Sets of Integers
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• Extensions of generalized product caps
• On subsets of finite Abelian groups with no 3-term arithmetic progressions
• Title not available (Why is that?)
• Roth's theorem on progressions revisited
• Large caps
• Finite field models in additive combinatorics
• New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometries
• Roth's theorem in \(\mathbb Z^n_4\)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (26)

• An extension of Behrend's theorem
• Additive combinatorics: with a view towards computer science and cryptography -- an exposition
• Sets without k‐term progressions can have many shorter progressions
• Subsets of without L-shaped configurations
• Caps and progression-free sets in \(\mathbb{Z}_m^n\)
• Maximum subsets of \(\mathbb{F}^n_q\) containing no right angles
• The number of subsets of integers with no \(k\)-term arithmetic progression
• Subsets of \(\mathbb{F}_q[x]\) free of 3-term geometric progressions
• Three-term arithmetic progressions in subsets of \(\mathbf{F}_q^\infty\) of large Fourier dimension
• On the size of subsets of \(\mathbb{F}_q^n\) avoiding solutions to linear systems with repeated columns
• Large subsets of \(\mathbb{Z}_m^n\) without arithmetic progressions
• Subsets without \(q\)-separation and binomial products of Fibonacci numbers
• Arithmetic progressions in multiplicative groups of finite fields
• Counting configuration-free sets in groups
• Improved bounds on sizes of generalized caps in \(AG(n,q)\)
• Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\)
• Further bounds in the polynomial Szemerédi theorem over finite fields
• Four‐term progression free sets with three‐term progressions in all large subsets
• Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• Title not available (Why is that?)
• Small Sets which meet all the n -Term Arithmetic Progressions in the Interval [1, n² ]
• Sparse hypergraphs: new bounds and constructions
• On arithmetic progressions in symmetric sets in finite field model
• New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometries
• A note on Elkin's improvement of Behrend's construction

This page was built for publication: On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976161)