Avoiding a shape, and the slice rank method for a system of equations

2019/09/23 by Mimura, Masato, Tokushige, Norihide
#Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1909.10509

Abstract

Fix a vector space over a finite field and a system of linear equations. We provide estimates, in terms of the dimension of the vector space, of the maximum of the sizes of subsets of the space that do not admit solutions of the system consisting of more than one point. That from above is derived by slice rank method of Tao; to obtain one from below, we define the notion of 'dominant reductions' of the system. Furthermore, by adapting a recent argument of Sauermann, we make an estimation of the maximum of the sizes of subsets that are 'W shape'-free, that means, there exist no five distinct points forming two overlapping parallelograms.

Related

• On the size of subsets of \mathbbF_qⁿ avoiding solutions to linear systems with repeated columns
• The minimum size of a linear set
• Sets of generators and chains of subspaces
• Slice rank and analytic rank for trilinear forms
• Partition Rank and Partition Lattices