New lower bounds for cap sets

09/20/2022
by   Fred Tyrrell, et al.
0

A cap set is a subset of 𝔽_3^n with no solutions to x+y+z=0 other than when x=y=z. In this paper, we provide a new lower bound on the size of a maximal cap set. Building on a construction of Edel, we use improved computational methods and new theoretical ideas to show that, for large enough n, there is always a cap set in 𝔽_3^n of size at least 2.218^n.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/05/2019

Correcting Codes for Asymmetric Single Magnitude Four Error

An error model with asymmetric single magnitude four error is considered...
research
02/07/2019

Bounds for the VC Dimension of 1NN Prototype Sets

In Statistical Learning, the Vapnik-Chervonenkis (VC) dimension is an im...
research
03/04/2019

Asymmetric Single Magnitude Four Error Correcting Codes

Limited magnitude asymmetric error model is well suited for flash memory...
research
10/23/2017

Lower bounds on the number of realizations of rigid graphs

In this paper we take advantage of a recently published algorithm for co...
research
05/29/2019

Resolution Lower Bounds for Refutation Statements

For any unsatisfiable CNF formula we give an exponential lower bound on ...
research
05/23/2023

On 4-general sets in finite projective spaces

A 4-general set in PG(n,q) is a set of points of PG(n,q) spanning the wh...
research
02/27/2020

A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods

It is well-known that some equational theories such as groups or boolean...

Please sign up or login with your details

Forgot password? Click here to reset