On the number of dot product chains in finite fields and rings

DOI10.1007/978-3-031-10796-2_1arXiv2101.03277MaRDI QIDQ6357877FDOQ6357877

Authors Vincent Blevins, David Crosby, Ethan Lynch, Steven Senger

Publication date 8 January 2021

Orthogonal arrays, Latin squares, Room squares (05B15) Other combinatorial number theory (11B75) Erd?s problems and related topics of discrete geometry (52C10) Arithmetic combinatorics; higher degree uniformity (11B30) Additive bases, including sumsets (11B13)

Abstract: We explore variants of ErdH os' unit distance problem concerning dot products between successive pairs of points chosen from a large finite subset of either

m a t h b b F_{q}^{d}

or

m a t h b b Z_{q}^{d},

where

q

is a power of an odd prime. Specifically, given a large finite set of points

E

, and a sequence of elements of the base field (or ring)

(a l p h a_{1}, l d o t s, a l p h a_{k})

, we give conditions guaranteeing the expected number of

(k + 1)

-tuples of distinct points

(x_{1}, d o t s, x_{k + 1}) i n E^{k + 1}

satisfying

x_{j} c d o t x_{j + 1} = a l p h a_{j}

for every

1 l e q j l e q k

.

This page was built for publication: On the number of dot product chains in finite fields and rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6357877)