Table of Contents
Fetching ...

On an analogue of BRK-type sets in finite fields

Madeline Forbes

TL;DR

This work develops a finite-field analogue of Besicovitch-Rado-Kinney (BRK) sets by defining $(n,d)$-BRK-type sets of degree $\ell$ in $\mathbb{F}_q^n$, which contain a family of $d$-dimensional sets governed by homogeneous polynomials. It employs the polynomial method and the method of multiplicities to derive two main lower bounds on the size of such sets: a baseline bound $|S| \gtrsim_{n,\ell} q^n$ and an improved multiplicity-based bound $|S| \geq \frac{(q-1)^n}{(\ell + 1 - 2\ell/q)^n}$, the latter matching Trainor's earlier results and independent of $d$. The authors adapt vanishing-multiplicity techniques to the $(n,d)$-BRK-type context and utilize a graded lexicographic order to control leading terms, enabling coefficient extraction and contradiction arguments. Collectively, the results advance the finite-field BRK-type theory by providing robust, $d$-independent lower bounds and connecting BRK-type phenomena to the polynomial method and multiplicities in higher-dimensional families.

Abstract

A Besicovitch-Rado-Kinney (BRK) set in $\mathbb{R}^n$ contains a hypersphere of every radius. In $\mathbb{F}_q^n$, BRK-type sets of degree $\ell$ analogously contain a family of $(n-1)$-dimensional surfaces, parametrized by a dilation factor and determined by a fixed homogeneous polynomial of degree $\ell$. We define $(n,d)$-BRK-type sets of degree $\ell$, which contain a family of $d$-dimensional sets parametrized by an $(n-d)$-dimensional dilation factor and determined by fixed homogeneous polynomials of degree $\ell$. We use the polynomial method to obtain a lower bound $|S| \gtrsim_{n, \ell} q^n$ on $(n,d)$-BRK-type sets $S$ of degree $\ell$. We obtain an improved lower bound $|S| \geq \frac{(q-1)^n}{(\ell + 1 - 2\ell/q)^n}$ by implementing the method of multiplicities; this is the same bound obtained by Trainor on BRK-type sets of degree $\ell$, and we obtain this bound independently of $d$.

On an analogue of BRK-type sets in finite fields

TL;DR

This work develops a finite-field analogue of Besicovitch-Rado-Kinney (BRK) sets by defining -BRK-type sets of degree in , which contain a family of -dimensional sets governed by homogeneous polynomials. It employs the polynomial method and the method of multiplicities to derive two main lower bounds on the size of such sets: a baseline bound and an improved multiplicity-based bound , the latter matching Trainor's earlier results and independent of . The authors adapt vanishing-multiplicity techniques to the -BRK-type context and utilize a graded lexicographic order to control leading terms, enabling coefficient extraction and contradiction arguments. Collectively, the results advance the finite-field BRK-type theory by providing robust, -independent lower bounds and connecting BRK-type phenomena to the polynomial method and multiplicities in higher-dimensional families.

Abstract

A Besicovitch-Rado-Kinney (BRK) set in contains a hypersphere of every radius. In , BRK-type sets of degree analogously contain a family of -dimensional surfaces, parametrized by a dilation factor and determined by a fixed homogeneous polynomial of degree . We define -BRK-type sets of degree , which contain a family of -dimensional sets parametrized by an -dimensional dilation factor and determined by fixed homogeneous polynomials of degree . We use the polynomial method to obtain a lower bound on -BRK-type sets of degree . We obtain an improved lower bound by implementing the method of multiplicities; this is the same bound obtained by Trainor on BRK-type sets of degree , and we obtain this bound independently of .

Paper Structure

This paper contains 10 sections, 15 theorems, 51 equations.

Key Result

Theorem 1.3

Let $S \subset \mathbb{F}_q^n$. Suppose that $S$ is a $(n, d)$-BRK-type set of degree $\ell$, where $\ell \geq 2$. Then $|S| \geq \binom{\lfloor\frac{q-1}{\ell}\rfloor + n}{n}$.

Theorems & Definitions (28)

  • Definition 1.1
  • Definition 1.2
  • Theorem 1.3
  • Theorem 1.4
  • Lemma 2.2
  • Definition 2.3
  • Lemma 2.4
  • Definition 2.5
  • Lemma 2.6
  • Lemma 2.7
  • ...and 18 more