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

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

Julia Wolf, Yuncheng Lin

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

Mathematics Subject Classification ID

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

Cites Work

• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• 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
• Roth's theorem on progressions revisited
• Large caps
• 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?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (13)

• Sets without k‐term progressions can have many shorter progressions
• Caps and progression-free sets in \(\mathbb{Z}_m^n\)
• Maximum subsets of \(\mathbb{F}^n_q\) containing no right angles
• Improved Bounds on Sizes of Generalized Caps in $AG(n,q)$
• Large subsets of \(\mathbb{Z}_m^n\) without arithmetic progressions
• Subsets without \(q\)-separation and binomial products of Fibonacci numbers
• Counting configuration-free sets in groups
• Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\)
• Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3
• Small Sets which meet all the n -Term Arithmetic Progressions in the Interval [1, n² ]
• Sparse hypergraphs: new bounds and constructions
• New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometries
• Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On sets of integers containing k elements in arithmetic progression 👍 👎
• On sets without \(k\)-term arithmetic progression 👍 👎
• 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] 👍 👎
• Subsets without \(q\)-separation and binomial products of Fibonacci numbers 👍 👎
• On the size of subsets of \(\mathbb{F}_p^n\) without \(p\) distinct elements summing to zero 👍 👎
• Large subsets of \(\mathbb{Z}_m^n\) without arithmetic progressions 👍 👎
• The Number of Subsets of Integers with Nok-Term Arithmetic Progression 👍 👎

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)