Search arXivSearch

arXiv · 2511.04113

On an analogue of BRK-type sets in finite fields

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$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Madeline Forbes. 2026-07-08. On an analogue of BRK-type sets in finite fields. https://arxiv.org/abs/2511.04113

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO