Caps and progression-free sets in Z_m^n
From MaRDI portal
Publication:2004972
Abstract: We study progression-free sets in the abelian groups . Let denote the maximal size of a set that does not contain a proper arithmetic progression of length . We give lower bound constructions, which e.g. include that , when is even. When this is of order at least . Moreover, if the progression-free set satisfies a technical condition, which dominates the problem at least in low dimension, then holds. We present a number of new methods which cover lower bounds for several infinite families of parameters , which includes for example: . For we determine the exact values, when , e.g. , and for we determine the exact values, when , e.g. .
Recommendations
- Bounds on the size of progression-free sets in \(\mathbb{Z}_m^n\)
- Caps in \(\mathbb{Z}^2_n\)
- The minimum size of complete caps in \(({\mathbb Z}/n{\mathbb Z})^2\)
- A note on the capitulation in \(\mathbb{Z}_ p\)-extensions
- Large sum-free sets in \(\mathbb Z/p\mathbb Z\)
- A note on maximal progression-free sets
- Large zero-free subsets of Z/p Z
- The Erdős-Ginzburg-Ziv constant and progression-free subsets
- scientific article; zbMATH DE number 1771902
- Arithmetic capacities on \(\mathbb{P}^ N\)
Cites work
- A density version of a geometric Ramsey theorem
- A lattice point problem and additive number theory
- A Lattice Point Problem Related to Sets Containing No l-Term Arithmetic Progression
- A new exponential upper bound for the Erd\H{o}s-Ginzburg-Ziv constant
- A new proof of Szemerédi's theorem
- Additive combinatorics
- Density Hales-Jewett and Moser numbers
- Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint)
- Exponential bounds for the Erdős-Ginzburg-Ziv constant
- Extensions of generalized product caps
- Finite field models in additive combinatorics
- Finite field models in arithmetic combinatorics -- ten years on
- scientific article; zbMATH DE number 3169563 (Why is no real title available?)
- scientific article; zbMATH DE number 524118 (Why is no real title available?)
- scientific article; zbMATH DE number 3414378 (Why is no real title available?)
- scientific article; zbMATH DE number 3102822 (Why is no real title available?)
- Improved bounds for progression-free sets in C₈^n
- Large caps in small spaces
- Lower bounds for multidimensional zero sums
- Matrix multiplication via arithmetic progressions
- Maximal caps in \(\mathrm{AG}(6,3)\).
- Maximal sum-free sets of integer lattice grids
- Maximal three-independent subsets of \(\{0,1,2\}^ n\)
- Multiplying matrices faster than coppersmith-winograd
- New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometries
- New bounds on cap sets
- On cap sets and the group-theoretic approach to matrix multiplication
- On Certain Sets of Integers
- On Kemnitz' conjecture concerning lattice-points in the plane
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- On Roth's theorem on progressions
- On sets of integers containing k elements in arithmetic progression
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions
- On subsets of abelian groups with no 3-term arithmetic progression
- On subsets of finite Abelian groups with no 3-term arithmetic progressions
- On sunflowers and matrix multiplication
- On the Solution of Moser's Problem in Four Dimensions
- On triples in arithmetic progression
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- Progression-free sets in finite abelian groups.
- Regularity and Positional Games
- Remarks on a Problem of Moser
- Roth's theorem in \(\mathbb Z^n_4\)
- Sequences in abelian groups G of odd order without zero-sum subsequences of length (G)
- The card game SET.
- The classification of the largest caps in AG(5, 3)
- The Minimal Number of Three-Term Arithmetic Progressions Modulo a Prime Converges to a Limit
- ZERO-SUM PROBLEMS IN FINITE ABELIAN GROUPS AND AFFINE CAPS
Cited in
(10)- Bounds on the size of progression-free sets in \(\mathbb{Z}_m^n\)
- Improved bounds for progression-free sets in C₈^n
- Large subsets of \(\mathbb{Z}_m^n\) without arithmetic progressions
- Bounds on affine caps
- Sets avoiding six-term arithmetic progressions in \(\mathbb{Z}_6^n\) are exponentially small
- Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\)
- Exponentially larger affine and projective caps
- Complete 3-term arithmetic progression free sets of small size in vector spaces and other abelian groups
- Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024
- Maximal line-free sets in \(\mathbb{F}_p^n\)
This page was built for publication: Caps and progression-free sets in \(\mathbb{Z}_m^n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004972)