English

Capturing Forms in Dense Subsets of Finite Fields

Number Theory 2012-11-30 v2 Combinatorics

Abstract

An open problem of arithmetic Ramsey theory asks if given a finite rr-colouring c:N{1,...,r}c:\mathbb{N}\to\{1,...,r\} of the natural numbers, there exist x,yNx,y\in \mathbb{N} such that c(xy)=c(x+y)c(xy)=c(x+y) apart from the trivial solution x=y=2x=y=2. More generally, one could replace x+yx+y with a binary linear form and xyxy with a binary quadratic form. In this paper we examine the analogous problem in a finite field Fq\mathbb{F}_q. Specifically, given a linear form LL and a quadratic from QQ in two variables, we provide estimates on the necessary size of AFqA\subset \mathbb{F}_q to guarantee that L(x,y)L(x,y) and Q(x,y)Q(x,y) are elements of AA for some x,yFqx,y\in\mathbb{F}_q.

Keywords

Cite

@article{arxiv.1211.5771,
  title  = {Capturing Forms in Dense Subsets of Finite Fields},
  author = {Brandon Hanson},
  journal= {arXiv preprint arXiv:1211.5771},
  year   = {2012}
}

Comments

Corrected typos. Added reference to other work on the subject

R2 v1 2026-06-21T22:43:43.926Z