2000 character limit reached
Pairs of dot products in finite fields and rings
Published 11 Aug 2015 in math.CO | (1508.02691v1)
Abstract: We obtain bounds on the number of triples that determine a given pair of dot products arising in a vector space over a finite field or a module over the set of integers modulo a power of a prime. More precisely, given $E\subset \mathbb F_qd$ or $\mathbb Z_qd$, we provide bounds on the size of the set [\left{(u,v,w)\in E \times E \times E : u\cdot v = \alpha, u \cdot w = \beta \right}] for units $\alpha$ and $\beta$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.